Apex Point Map for Constant-Time Bounding Plane Approximation

Simple item page
dc.contributor.authorLaine, Samulien_US
dc.contributor.authorKarras, Teroen_US
dc.contributor.editorJaakko Lehtinen and Derek Nowrouzezahraien_US
dc.date.accessioned2015-06-23T05:04:19Z
dc.date.available2015-06-23T05:04:19Z
dc.date.issued2015en_US
dc.description.abstractWe introduce apex point map, a simple data structure for constructing conservative bounds for rigid objects. The data structure is distilled from a dense k-DOP, and can be queried in constant time to determine a tight bounding plane with any given normal vector. Both precalculation and lookup can be implemented very efficiently on current GPUs. Applications include, e.g., finding tight world-space bounds for transformed meshes, determining perobject shadow map extents, more accurate view frustum culling, and collision detection.en_US
dc.description.sectionheadersRay Tracingen_US
dc.description.seriesinformationEurographics Symposium on Rendering - Experimental Ideas & Implementationsen_US
dc.identifier.doi10.2312/sre.20151166en_US
dc.identifier.pages51-55en_US
dc.identifier.urihttps://doi.org/10.2312/sre.20151166en_US
dc.publisherThe Eurographics Associationen_US
dc.subjectI.3.5 [Computer Graphics]en_US
dc.subjectComputational Geometry and Object Modelingen_US
dc.subjectBoundary representationsen_US
dc.titleApex Point Map for Constant-Time Bounding Plane Approximationen_US
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
051-055.pdf
Size:
1.76 MB
Format:
Adobe Portable Document Format
Download
Collections
Rendering - Experimental Ideas & Implementations 2015