Cost prediction for ray shooting in octrees
From MaRDI portal
Publication:2495947
Recommendations
- Octrees with near optimal cost for ray-shooting
- Cost prediction for ray shooting
- LATIN 2004: Theoretical Informatics
- Ray tracing algorithm based on octree space partition method
- Compact storage for octtrees in a fast ray-tracing algorithm
- Cost-driven octree construction schemes: An experimental study
- Cost-driven octree construction schemes
Cites work
- Approximating minimum-weight triangulations in three dimensions
- Cost-driven octree construction schemes: An experimental study
- Hierarchical geometric models for visible surface algorithms
- scientific article; zbMATH DE number 1241835 (Why is no real title available?)
- scientific article; zbMATH DE number 1033560 (Why is no real title available?)
- scientific article; zbMATH DE number 1182925 (Why is no real title available?)
- scientific article; zbMATH DE number 194963 (Why is no real title available?)
- scientific article; zbMATH DE number 3451445 (Why is no real title available?)
- LATIN 2004: Theoretical Informatics
- Worst-case versus average case complexity of ray-shooting
Cited in
(5)
This page was built for publication: Cost prediction for ray shooting in octrees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2495947)