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

Datensatz

DATENSATZ AKTIONENEXPORT

Freigegeben

Konferenzbeitrag

On the Efficiency of Ray-shooting Acceleration Schemes

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

Szirmay-Kalos, L., Havran, V., Balázs, B., & Szécsi, L. (2002). On the Efficiency of Ray-shooting Acceleration Schemes. In Proceedings of the 18th Spring Conference on Computer Graphics (SCCG 2002) (pp. 89-98). New York, USA: ACM Siggraph.


Zitierlink: http://hdl.handle.net/11858/00-001M-0000-000F-301A-9
Zusammenfassung
This paper examines the efficency of different ray-shooting acceleration schemes, including the uniform space subdivision, octree and kd-tree. We use simple computational model , which assume that the objects are uniformly distributed in space. The efficiency is characterized by two measures, including the expected number of ray-object intersections needed to identified the first intersected object, and the expected number of steps on the space partitioning data structure. We can come to the interesting conclusion that these numbers are constant and are independent of the number of objects in the scene. The number of intersections is determined by how well the cells of the partitioning data structure enclose the objects. Such analysis helps to understand why kd-tree is better than octree and uniform space subdivision and provides hints to improve their implementation.