A Low Dimensional Framework for Exact Polygon-to-Polygon Occlusion Queries

dc.contributor.authorHaumont, Denisen_US
dc.contributor.authorMakinen, Otsoen_US
dc.contributor.authorNirenstein, Shaunen_US
dc.contributor.editorKavita Bala and Philip Dutreen_US
dc.date.accessioned2014-01-27T14:48:47Z
dc.date.available2014-01-27T14:48:47Z
dc.date.issued2005en_US
dc.description.abstractDespite the importance of from-region visibility computation in computer graphics, efficient analytic methods are still lacking in the general 3D case. Recently, different algorithms have appeared that maintain occlusion as a complex of polytopes in Plücker space. However, they suffer from high implementation complexity, as well as high computational and memory costs, limiting their usefulness in practice. In this paper, we present a new algorithm that simplifies implementation and computation by operating only on the skeletons of the polyhedra instead of the multi-dimensional face lattice usually used for exact occlusion queries in 3D. This algorithm is sensitive to complexity of the silhouette of each occluding object, rather than the entire polygonal mesh of each object. An intelligent feedback mechanism is presented that greatly enhances early termination by searching for apertures between query polygons. We demonstrate that our technique is several times faster than the state of the art.en_US
dc.description.seriesinformationEurographics Symposium on Rendering (2005)en_US
dc.identifier.isbn3-905673-23-1en_US
dc.identifier.issn1727-3463en_US
dc.identifier.urihttps://doi.org/10.2312/EGWR/EGSR05/211-222en_US
dc.publisherThe Eurographics Associationen_US
dc.subjectCategories and Subject Descriptors (according to ACM CCS): I.3.3 [Computer Graphics]: Exact Visibility Cullingen_US
dc.titleA Low Dimensional Framework for Exact Polygon-to-Polygon Occlusion Queriesen_US
Files
Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
211-222.pdf
Size:
2.29 MB
Format:
Adobe Portable Document Format