Cost prediction for ray shooting in octrees

DOI10.1016/j.comgeo.2005.09.002zbMath1093.65013OpenAlexW1974415757MaRDI QIDQ2495947

Yi-Jen Chiang, Boris Aronov, Allen Y. Chang, Hervé Brönnimann

Publication date: 30 June 2006

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2005.09.002

zbMATH Keywords

cost modeluniform gridoctreecost predictionspace decompositionaverage performanceray shooting\(k\)d-tree

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items (2)

Amortized analysis of smooth quadtrees in all dimensions ⋮ Dynamic smooth compressed quadtrees

Cites Work

• Worst-case versus average case complexity of ray-shooting
• Approximating minimum-weight triangulations in three dimensions
• Cost-driven octree construction schemes: An experimental study
• Hierarchical geometric models for visible surface algorithms
• LATIN 2004: Theoretical Informatics
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Cost prediction for ray shooting in octrees