A Procedure for Detecting Intersections of Three-Dimensional Objects
Journal of the ACM (JACM)
Mathematical model for mechanical part description
Communications of the ACM
The notion of quantitative invisibility and the machine rendering of solids
ACM '67 Proceedings of the 1967 22nd national conference
Half-tone perspective drawings by computer
AFIPS '67 (Fall) Proceedings of the November 14-16, 1967, fall joint computer conference
Construction and display of three-dimensional polygonal-histograms
ACM SIGGRAPH Computer Graphics
Computer-Aided Design
A Two-Space Solution to the Hidden Line Problem for Plotting Functions of Two Variables
IEEE Transactions on Computers
Computer Simulation of Space-Filling Molecular Models
IEEE Transactions on Computers
Recent advances in sketch recognition
AFIPS '73 Proceedings of the June 4-8, 1973, national computer conference and exposition
Sorting and the hidden-surface problem
AFIPS '73 Proceedings of the June 4-8, 1973, national computer conference and exposition
An algorithm to display three-dimensional objects
Computers and Structures
An optimal hidden-surface algorithm and its parallelization
ICCSA'11 Proceedings of the 2011 international conference on Computational science and its applications - Volume Part III
Simultaneous precise solutions to the visibility problem of sculptured models
GMP'06 Proceedings of the 4th international conference on Geometric Modeling and Processing
An O(log N) parallel time exact hidden-line algorithm
EGGH'87 Proceedings of the Second Eurographics conference on Advances in Computer Graphics Hardware
Hidden contours on a frame-buffer
EGGH'92 Proceedings of the Seventh Eurographics conference on Graphics Hardware
| Hi-index | 14.99 |
The "hidden-line problem" for computer-drawn polyhedra is the problem of determining which edges, or parts of edges, of a polyhedra are visible from a given vantage point. This is an important problem in computer graphics, and its fast solution is especially critical for on-line CRT display applications. The method presented here for solving this problem is believed to be faster than previously known methods. An edge classification scheme is described that eliminates at once most of the totally invisible edges. The remaining, potentially visible edges are then tested in paths, which eventually cover the whole polyhedra. These paths are synthesized in such a way as to minimize the number of calculations. Both the case of a cluster of polyhedra and the illumination problem in which a polyhedron is illuminated from a point source of light are treated as applications of the general algorithm. Several illustrative examples are included.