Deutsch
 
Hilfe Datenschutzhinweis Impressum
  DetailsucheBrowse

Datensatz

DATENSATZ AKTIONENEXPORT
 
 
DownloadE-Mail
 DetailsÜbersicht
  On the Fast Construction of Spatial Hierarchies for Ray Tracing

Havran, V., Herzog, R., & Seidel, H.-P. (2006). On the Fast Construction of Spatial Hierarchies for Ray Tracing. In Proceedings of the 2006 IEEE Symposium on Interactive Ray Tracing (pp. 71-80). Piscataway, USA: IEEE.

Item is

 

einblenden: alle ausblenden: alle

Basisdaten

einblenden: ausblenden:
Datensatz-Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-2397-2 Versions-Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-2398-F
Genre: Konferenzbeitrag

Externe Referenzen

einblenden:

Urheber

einblenden:
ausblenden:
 Urheber:
Havran, Vlastimil1, Autor           
Herzog, Robert1, 2, Autor           
Seidel, Hans-Peter1, Autor           
Wald, Ingo1, Herausgeber           
Parker, Steven G., Herausgeber
Affiliations:
1Computer Graphics, MPI for Informatics, Max Planck Society, ou_40047              
2International Max Planck Research School, MPI for Informatics, Max Planck Society, ou_1116551              

Inhalt

einblenden:
ausblenden:
Schlagwörter: -
 Zusammenfassung: In this paper we address the problem of fast construction of spatial hierarchies for ray tracing with applications in animated environments including non-rigid animations. We discuss properties of currently used techniques with $O(N \log N)$ construction time for kd-trees and bounding volume hierarchies. Further, we will propose a hybrid data structure blending a spatial kd-tree with bounding volume primitives. We will keep our novel hierarchical data structures algorithmically efficient and comparable with kd-trees by using a cost model based on surface area heuristics. Although the time complexity $O(N \log N)$ is a lower bound required for construction of any spatial hierarchy, which corresponds to sorting based on comparisons, using an approximate method based on space discretization, we propose a new hierarchical data structures with expected $O(N \log\log N)$ time complexity. We also discuss the constants behind the construction algorithms of spatial hierarchies that are important in practice. We document the performance of our algorithms by results obtained from nine different scenes.

Details

einblenden:
ausblenden:
Sprache(n): eng - English
 Datum: 2007-03-032006
 Publikationsstatus: Erschienen
 Seiten: -
 Ort, Verlag, Ausgabe: Piscataway, USA : IEEE
 Inhaltsverzeichnis: -
 Art der Begutachtung: -
 Identifikatoren: eDoc: 314634
Anderer: Local-ID: C125675300671F7B-94561A8D2A5BD650C125722F005A0243-HavranRT2006
 Art des Abschluß: -

Veranstaltung

einblenden:
ausblenden:
Titel: Untitled Event
Veranstaltungsort: Salt Lake City, UT, USA
Start-/Enddatum: 2006-09-18

Entscheidung

einblenden:

Projektinformation

einblenden:

Quelle 1

einblenden:
ausblenden:
Titel: Proceedings of the 2006 IEEE Symposium on Interactive Ray Tracing
Genre der Quelle: Konferenzband
 Urheber:
Affiliations:
Ort, Verlag, Ausgabe: Piscataway, USA : IEEE
Seiten: - Band / Heft: - Artikelnummer: - Start- / Endseite: 71 - 80 Identifikator: ISBN: 1-4244-0693-5