A Solution to the Hidden-Line Problem for Computer-Drawn Polyhedra

摘要: The "hidden-line problem" for computer-drawn polyhedra is the problem of determining which edges, or parts a are visible from given vantage point. This an important in computer graphics, and its fast solution especially critical on-line CRT display applications. method presented here solving this believed to be faster than previously known methods. An edge classification scheme described that eliminates at once most totally invisible edges. remaining, potentially edges then tested paths, eventually cover whole polyhedra. These paths synthesized such way as minimize number calculations. Both case cluster illumination polyhedron illuminated point source light treated applications general algorithm. Several illustrative examples included.