Cost-driven octree construction schemes: An experimental study

DOI10.1016/j.comgeo.2004.07.005zbMath1060.65553OpenAlexW4245219328MaRDI QIDQ1775782

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

Publication date: 4 May 2005

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

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

zbMATH Keywords

algorithmnumerical examplescomputer graphicsCost modelOctreeAverage performanceCost predictionRay shootingSpace decomposition

Mathematics Subject Classification ID

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

Related Items (4)

Cost prediction for ray shooting in octrees ⋮ Octrees with near optimal cost for ray-shooting ⋮ Minimizing the stabbing number of matchings, trees, and triangulations ⋮ Convex subdivisions with low stabbing numbers

Uses Software

• Genocop

Cites Work

• Unnamed Item
• Unnamed Item
• Approximating minimum-weight triangulations in three dimensions
• Cost prediction for ray shooting
• LATIN 2004: Theoretical Informatics

This page was built for publication: Cost-driven octree construction schemes: An experimental study