Title: Silhouette Partitioning for Height Field Ray Tracing
Authors: Sakalauskas, Tomas
Citation: WSCG '2007: Short Communications Proceedings: The 15th International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision 2007 in co-operation with EUROGRAPHICS: University of West Bohemia, Plzen, Czech Republic, January 29 – February 1, 2007, p. 73-80.
Issue Date: 2007
Publisher: Václav Skala - UNION Agency
Document type: konferenční příspěvek
URI: http://wscg.zcu.cz/wscg2007/Papers_2007/short/!WSCG2007_Short_Proceedings_Final-Part_1.zip
ISBN: 978-80-86943-02-2
Keywords: vizualizace dynamického výškového pole;vykreslování;sledování paprsku;grafické procesory;dělení siluet;terén
Keywords in different language: dynamic height field visualization;rendering;ray tracing;graphic processing units;silhouette partitioning;terrain
Abstract: This paper presents parallel algorithm to ray trace height fields that is suitable for recent GPUs. No data preprocessing is needed, therefore this algorithm can render dynamic height fields. Partitioning binary tree for screen space is calculated each frame. It takes silhouettes of height field regions as partitioning curves. Ray tracing step uses binary search in this silhouette tree to find height field coordinates of pixel visible at given screen coordinates. Presented algorithm takes fixed amount of samples into consideration to produce value in each pass, therefore worst-case scenario is deterministic. This enables the implementation for GPUs having limited dependent texture lookups.
Rights: © Václav Skala - UNION Agency
Appears in Collections:WSCG '2007: Short Communications Proceedings

Files in This Item:
File Description SizeFormat 
Sakalauskas.pdfPlný text2,04 MBAdobe PDFView/Open
Sakalauskas_prezentace.pptPrezentace1,11 MBMicrosoft PowerpointView/Open

Please use this identifier to cite or link to this item: http://hdl.handle.net/11025/11165

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.