Analysis of a bounding box heuristic for object intersection
From MaRDI portal
Publication:3158559
DOI10.1145/331524.331528zbMath1161.68821OpenAlexW1983471184MaRDI QIDQ3158559
Publication date: 25 January 2005
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/331524.331528
Analysis of algorithms (68W40) Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (5)
Collision detection for deforming necklaces ⋮ Exact and approximation algorithms for computing optimal fat decompositions ⋮ Local polyhedra and geometric graphs ⋮ Kinetic collision detection for convex fat objects ⋮ On R-trees with low query complexity
This page was built for publication: Analysis of a bounding box heuristic for object intersection