de.mpg.escidoc.pubman.appbase.FacesBean
Deutsch
 
Hilfe Wegweiser Impressum Kontakt Einloggen
  DetailsucheBrowse

Datensatz

DATENSATZ AKTIONENEXPORT

Freigegeben

Zeitschriftenartikel

On Improving KD-Trees for Ray Shooting

MPG-Autoren
http://pubman.mpdl.mpg.de/cone/persons/resource/persons44596

Havran,  Vlastimil
Computer Graphics, MPI for Informatics, Max Planck Society;

Externe Ressourcen
Es sind keine Externen Ressourcen verfügbar
Volltexte (frei zugänglich)
Es sind keine frei zugänglichen Volltexte verfügbar
Ergänzendes Material (frei zugänglich)
Es sind keine frei zugänglichen Ergänzenden Materialien verfügbar
Zitation

Havran, V., & Bittner, J. (2002). On Improving KD-Trees for Ray Shooting. Journal of WSCG, 10, 209-216.


Zitierlink: http://hdl.handle.net/11858/00-001M-0000-000F-300F-3
Zusammenfassung
Efficient ray shooting algorithm is inherently required by many computer graphics algorithms, particularly in image synthesis. Practical ray shooting algorithms aiming at the average-case complexity use some underlying spatial data structure such as $kd$-tree. We show the new termination criteria algorithm that improves the space and time complexity of the $kd$-tree construction. It provides efficient ray-shooting queries and does not require any specific constants from a user. Further, we show how to apply a novel clipping algorithm into the $kd$-tree within construction phase in order to improve its properties.