The Visual Computer

, Volume 3, Issue 6, pp 329–343 | Cite as

Hidden-surface removal in polyhedral cross-sections

  • Peter Egyed


Many of the fundamental problems in computer graphics involve the notion of visibility. In one approach to the hiddensurface problem, priorities are assigned to the faces of a scene. A realistic image is then rendered by displaying the faces with the resulting priority ordering. We introduce a tree-based formalism for describing priority orderings that simplifies an existing algorithm. As well, a decompositionbased algorithm is presented for classes of scenes that do not in general admit priority orderings. The algorithm requiresO(n logn) time ift=1 andO(tn logn+n logn logm) time ift>1, wheren andm are respectively the number of faces and polyhedra in the scene, andt is a minimum decomposition factor of the scene. Finally, the tree-based formalism is used in the development ofO(n) time insertion and deletion algorithms that solve the problem of dynamically maintaining a priority ordering.

Key words

Hidden-surface problems Computational geometry Priority orderings Decomposition techniques Dynamization techniques 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Aho AV, Hopcroft JH, Ullmann JD (1983) Data structures and algorithms. Addison-Wesley, Reading, pp 88–93Google Scholar
  2. Chazelle B (1982) A theorem on polygon cutting with applications. Proc 23rd Ann IEEE Symp Foundat Comput Sci, pp 339–349Google Scholar
  3. Chazelle B, Incerpi J (1983) Triangulating a polygon by divide-and-comquer. Proc 21st Ann Allerton Conf Commun Control Comput, pp 447–456Google Scholar
  4. Devai F (1986) Quadratic bounds for hidden-line elimination. Proc ACM Symp Comput Geom, pp 269–275Google Scholar
  5. Garey MR, Johnson DS, Preparata FP, Tarjan RE (1978) Triangulating a simple polygon. Inf Proc Lett 7:175–179Google Scholar
  6. Guibas LJ, Yao FF (1980) On translating a set of rectangles. Proc 12th Ann ACM Symp Theor Comput, pp 154–157Google Scholar
  7. Guting RH, Ottmann T (1984) New algorithms for special cases of the hidden-line elimination problem. Tech Rep 184, Univ DortmundGoogle Scholar
  8. Hertel S, Mehlhorn K (1983) Fast triangulation of simple polygons. Proc Conf Foundat Comput Theor, pp 207–218Google Scholar
  9. McKenna M (1987) Worst-case optimal hidden-surface removal. ACM Trans Graph 6(1):19–28Google Scholar
  10. Muller DE, Preparata FP (1978) Finding the intersection of two convex polyhedra. Theor Comput Sci 7(2):217–236Google Scholar
  11. Nurmi O (1985) A fast line-sweep algorithm for hidden-line elimination. BIT 25(3):466–472Google Scholar
  12. Ottmann T, Widmayer P (1983) On translating a set of line segments. Comput Vision Graph Image Process 24(3):382–389Google Scholar
  13. Ottmann T, Widmayer P, Wood D (1985) A worst-case efficient algorithm for hidden-line elimination. Int J Comput Math 18(2):93–119Google Scholar
  14. Rappaport D (1986) A linear algorithm for eliminating hidden lines from a polygonal cylinder. The Visual Computer 2:44–53Google Scholar
  15. Schmitt A (1981) Time and space bounds for hidden-line and hidden-surface algorithms. Proc Eurographics '81, pp 43–56Google Scholar
  16. Shamos MI, Hoey D (1976) Geometric intersection problems. Proc 17th Ann IEEE Symp Foundat Comput Sci, pp 208–215Google Scholar
  17. Shamos MI (1977) Computational Geometry. PhD Thesis, Yale UnivGoogle Scholar
  18. Yao FF (1980) On the priority approach to hidden-surface algorithms. Proc 21st Ann IEEE Symp Foundat Comput Sci, pp 301–307Google Scholar

Copyright information

© Springer-Verlag 1988

Authors and Affiliations

  • Peter Egyed
    • 1
  1. 1.School of Computer ScienceMcGill UniversityMontrealCanada

Personalised recommendations