Visibility problems for orthogonal objects in two-or three-dimensions |
| |
Authors: | Jeong-In Doh Kyung-Yong Chwa |
| |
Affiliation: | (1) Computer Science Department, Korea Advanced Institute of Science and Technology, Cheongryang, P.O. Box 150, Seoul, Korea |
| |
Abstract: | LetP be a set ofl points in 3-space, and letF be a set ofm opaque rectangular faces in 3-space with sides parallel tox- ory-axis. We present anO(n logn) time andO(n) space algorithm for determining all points inP which are visible from a viewpoint at (0,0,), wheren=l+m. We also present anO(n logn+k) time andO(n) space algorithm for the hidden-line elimination problem for the orthogonal polyhedra together with a viewpoint at (0,0,), wheren is the number of vertices of the polyhedra andk is the number of edge intersections in the projection plane. |
| |
Keywords: | Visibility Hidden-line elimination Orthogonal objects Computational geometry |
本文献已被 SpringerLink 等数据库收录! |
|