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.
|Number of pages||2|
|State||Published - 1998|
|Event||Proceedings of the 1998 14th Annual Symposium on Computational Geometry - Minneapolis, MN, USA|
Duration: 7 Jun 1998 → 10 Jun 1998
|Conference||Proceedings of the 1998 14th Annual Symposium on Computational Geometry|
|City||Minneapolis, MN, USA|
|Period||7/06/98 → 10/06/98|