Computing Visibility Subsets In An Orthogonal Polyhedron

Jefri Marzal, Hong Xie, Chun Che FungZenodo 2015 · DOI

Abstract

Visibility problems are central to many computational geometry applications. One of the typical visibility problems is computing the view from a given point. In this paper, a linear time procedure is proposed to compute the visibility subsets from a corner of a rectangular prism in an orthogonal polyhedron. The proposed algorithm could be useful to solve classic 3D problems.
BibTeX
@inproceedings{marzal2015computing,
  author = {Jefri Marzal and Hong Xie and Chun Che Fung},
  title = {{Computing Visibility Subsets In An Orthogonal Polyhedron}},
  booktitle = {Zenodo},
  year = {2015},
  doi = {10.5281/zenodo.1110889},
}

Loading related content...

Figure