Viewspace partitioning of densely occluded scenes

Yiorgos Chrysanthou, Daniel Cohen-Or, Eyal Zadicario

Research output: Contribution to conferencePaperpeer-review

Abstract

Computing the visibility of out-door scenes is often much harder than of in-door scenes. The difficulty is that although the majority of objects are hidden, some parts might be visible at a distance in an arbitrary location, and it is not clear how to detect them quickly. The results of our method to partition the viewspace into cells are presented, where each cell contains a conservative superset of visible objects. For each object it searches for a strong occluder which guarantees that the object is not visible from any point within the cell.

Original languageEnglish
Pages413-414
Number of pages2
DOIs
StatePublished - 1998
Externally publishedYes
EventProceedings of the 1998 14th Annual Symposium on Computational Geometry - Minneapolis, MN, USA
Duration: 7 Jun 199810 Jun 1998

Conference

ConferenceProceedings of the 1998 14th Annual Symposium on Computational Geometry
CityMinneapolis, MN, USA
Period7/06/9810/06/98

Fingerprint

Dive into the research topics of 'Viewspace partitioning of densely occluded scenes'. Together they form a unique fingerprint.

Cite this