Visibility problems for orthogonal objects in two-or three-dimensions

Let P be a set of l points in 3-space, and let F be a set of m opaque rectangular faces in 3-space with sides parallel to x- or y-axis. We present an O(n log n) time and O(n) space algorithm for determining all points in P which are visible from a viewpoint at (0,0,∞), where n=l+m. We also present a...

Full description

Bibliographic Details
Published in:The Visual Computer : International Journal of Computer Graphics, Vol. 4, No. 2 (1988), p. 84-97
Main Author: Doh, Jeong-In
Other Involved Persons: Chwa, Kyung-Yong
Format: electronic Article
Language:English
ISSN:1432-2315
Physical Description:Online-Ressource
DOI:10.1007/BF01905560
Subjects:
QR Code: Show QR Code
Description:
  • Let P be a set of l points in 3-space, and let F be a set of m opaque rectangular faces in 3-space with sides parallel to x- or y-axis. We present an O(n log n) time and O(n) space algorithm for determining all points in P which are visible from a viewpoint at (0,0,∞), where n=l+m. We also present an O(n log n+k) time and O(n) space algorithm for the hidden-line elimination problem for the orthogonal polyhedra together with a viewpoint at (0,0,∞), where n is the number of vertices of the polyhedra and k is the number of edge intersections in the projection plane.