Analysis of a bounding box heuristic for object intersection

DOI10.1145/331524.331528MaRDI QIDQ3158559zbMATH OpenOpenAlexFDO

Authors Yunhong Zhou, Subhash Suri

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

zbMATH Keywords

Aspect ratiobounding boxcollision detectionscale factor

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Nonnumerical algorithms (68W05) Analysis of algorithms (68W40)

Recommendations

• scientific article; zbMATH DE number 1305478
• scientific article; zbMATH DE number 1182926
• scientific article; zbMATH DE number 1670680
• scientific article; zbMATH DE number 1303549
• Space searching for intersecting objects

Cited in

(8)

• Kinetic collision detection for convex fat objects
• Local polyhedra and geometric graphs
• On R-trees with low query complexity
• scientific article; zbMATH DE number 1670680 (Why is no real title available?)
• scientific article; zbMATH DE number 1305478 (Why is no real title available?)
• Collision detection for deforming necklaces
• Exact and approximation algorithms for computing optimal fat decompositions
• Computing distance using internal axis-aligned bounding-box for nearly intersected objects

This page was built for publication: Analysis of a bounding box heuristic for object intersection

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3158559)