Quadtree Relief Mapping

dc.contributor.authorSchroders, Marc F. A.en_US
dc.contributor.authorGulik, Rob vanen_US
dc.contributor.editorMarc Olano and Philipp Slusalleken_US
dc.date.accessioned2013-10-28T10:04:57Z
dc.date.available2013-10-28T10:04:57Z
dc.date.issued2006en_US
dc.description.abstractRelief mapping is an image based technique for rendering surface details. It simulates depth on a polygonal model using a texture that encodes surface height. The presented method incorporates a quadtree structure to achieve a theoretically proven performance between W(log(p)) and O(pp) for computing the first intersection of a ray with the encoded surface, where p is the number of pixels in the used texture. In practice, the performance was found to be close to log(p) in most cases. Due to the hierarchical nature of our technique, the algorithm scales better than previous comparable techniques and therefore better accommodates to future games and graphics hardware. As the experimental results show, quadtree relief mapping is more efficient than previous techniques when textures larger than 512×512 are used. The method correctly handles self-occlusions, shadows, and irregular surfaces.en_US
dc.description.seriesinformationGraphics Hardwareen_US
dc.identifier.isbn3-905673-37-1en_US
dc.identifier.issn1727-3471en_US
dc.identifier.urihttps://doi.org/10.2312/EGGH/EGGH06/061-066en_US
dc.publisherThe Eurographics Associationen_US
dc.subjectCategories and Subject Descriptors (according to ACM CCS): I.3.7 [Three-Dimensional Graphics and Realism]: Color, Shading, Shadowing, and Texture; Raytracing I.3.5 [Computational Geometry and Object Modeling]: Hierarchy and geometric transformationsen_US
dc.titleQuadtree Relief Mappingen_US
Files
Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
061-066.pdf
Size:
256.63 KB
Format:
Adobe Portable Document Format