We present a practical and new hidden-line elimination technique for displaying the perspective view of a scene of three-dimensional isothetic parallelepipeds (3D-rectangles). We assume that the 3D-rectangles are totally ordered based upon the dominance relation of occlusion. The perspective view is generated incrementally, starting with the closest 3D-rectangle and proceeding away from the viewpoint. Our algorithm is scene-sensitive and uses O((n + d) log n log log n) time, where n is the number of 3D-rectangles and d is the number of edges of the display. This improves over the heretofore best known technique. The primary data structure is an efficient alternative to dynamic fractional cascading for use with augmented segment and range trees when the universe is fixed beforehand. It supports queries in O((logn + k) log log n) time, where k is the size of the output, and insertions and deletions in O(log n log log n) time, all in the worst case.
CITATION STYLE
Preparata, F. P., Vitter, J. S., & Yvinec, M. (1990). Output-sensitive generation of the perspective view of isothetic parallelepipeds. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 447 LNCS, pp. 71–84). Springer Verlag. https://doi.org/10.1007/3-540-52846-6_79
Mendeley helps you to discover research relevant for your work.