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


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… (More)
DOI: 10.1007/BF01905560

9 Figures and Tables


  • Presentations referencing similar topics