Analysis of a bounding box heuristic for object intersection

DOI10.1145/331524.331528zbMATH Open1161.68821OpenAlexW1983471184MaRDI QIDQ3158559FDOQ3158559

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

collision detectionscale factorbounding boxAspect ratio

Mathematics Subject Classification ID

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

Cited In (7)

• Computing distance using internal axis-aligned bounding-box for nearly intersected objects
• 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
• Collision detection for deforming necklaces
• Title not available (Why is that?)

   Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Space searching for intersecting 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)