English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Conference Paper

On the Efficiency of Ray-shooting Acceleration Schemes

MPS-Authors
/persons/resource/persons44596

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

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

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.


Cite as: https://hdl.handle.net/11858/00-001M-0000-000F-301A-9
Abstract
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.