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...
|Published in:||The Visual Computer : International Journal of Computer Graphics, Vol. 4, No. 2 (1988), p. 84-97|
|Other Involved Persons:|
|QR Code:||Show QR Code|