A Graph-Theoretic Approach to the Hidden Line Elimination Problem
We consider the hidden line elimination problem for displaying 3D solid objects represented as polyhedra on 2D display devices. The objects are assumed to be composed of polygonal faces. The algorithm presented is based on a graph-theoretic approach in that a certain graph representing the projections of the edges of the polyhedron is constructed and visible edges are found using depth-first search technique in the graph. The way in which visible edges are found is different from the previous ones in that it first assumes all the edges of the polygonal faces are invisible from the viewer and based on some criteria seeks out visible ones, whence the efficiency of the algorithm is, to some extent, independent of the number of hidden edges. In this sense it is more appropriate to refer to the algorithm as visible line determination algorithm.
The worst case time complexity of the algorithm is shown to be 0(nbnlog n) + F, where n is the total number of edges, nb the number of boundary edges and F the number of visible edges displayed. However, if the number nb of boundary edges is much smaller than n, which is true in most cases, the algorithm is more efficient than previous approaches whose worst case complexity may be 0(n2).
KeywordsView Plane Front Face Intersection Graph Boundary Edge Back Face
Unable to display preview. Download preview PDF.
- J. K. Aggarwal and R. O. Duda, “Computer analysis of moving polygonal images,” IEEE Trans. Comput., C-24, 10, Oct. 1975.Google Scholar
- P. Atherton, K. Weiler and D. Greenberg, “Polygon shadow generation,” Computer Graphics, 12,3, pp. 275–281, August 1978.Google Scholar
- D. K. Brotz, “Intersecting polyhedra with successive planes,” Computer & Graphics, 2, 1976.Google Scholar
- J. H. Clark, “Hierarchical geometric models for visible surface algorithm,” Comm. ACM, 19,10, pp. 547–554, Oct. 1976.Google Scholar
- M. Cyrus and J. Beck, “Generalized two-and three-dimensional clipping,” Computer & Graphics, 3, 1978.Google Scholar
- C. Eastman, J. Livdini and D. Stoken, “A database for designing large physical systems,” AFIPS44, pp. 603–611, 1975.Google Scholar
- W. R. Franklin, “A linear time exact hidden surface algorithm techniques,” Computer Graphics, 14,3, pp. 117–123, July 1980.Google Scholar
- H. Fuchs, Z. Kedem and B. Naylor, “On visible surface generation by a priori tree structures,” Computer Graphics, 14,3, pp. 124–133, July 1980.Google Scholar
- R. Galimberti and U. Montanari, “An algorithm for hidden line elimination,” Comm. ACM, 12,4, pp. 206–211, April 1969.Google Scholar
- G. Hamlin, Jr. and C. W. Gear, “Raster-scan hidden surface algorithm techniques, Computer Graphics, 11,2, pp. 206–213, Summer 1977.Google Scholar
- M. Lee and R. V. DiMarco, “Computer graphics with hidden surfaces,” Computer & Graphics, 3, 1978.Google Scholar
- L. G. Roberts, “Machine perception of three-dimensional solids,” Optical and Electro-Optical Information Processing, MIT Press, Cambridge, Mass., pp. 159, 1964.Google Scholar
- S. Sechrest and D. P. Greenberg, “A visible polygon reconstruction algorithm,” Computer Graphics, 15,3, pp. 17–27, Aug. 1981.Google Scholar
- I. E. Sutherland and G. W. Hogman, “Reentrant polygon clipping,” Comm. ACM, 17,1, pp. 32–42, Jan. 1974.Google Scholar
- G. S. Watkins, “A real time visible surface algorithm,” Univ. of Utah, Comput. Sci. Dept., UTEC-CSc-70–101, NTIS AD 762004, June 1970.Google Scholar
- K. Weiler and P. Atherton, “Hidden surface removal using polygon area sorting,” Computer Graphics, pp. 214–222, Summer 1977.Google Scholar