Fast software for box intersections

We present fast implementations of a hybrid algorithm for reporting box and cube intersections. Our algorithm initially takes a divide-and-conquer approach and switches to simpler algorithms for low numbers of boxes. We use our implementations as engines to solve problems about geometric primitives. We look at two such problems in the category of quality analysis of surface triangulations.

• Type: Conference
• Year: 2000
• Where: COMPGEOM
• Authors: Afra Zomorodian, Herbert Edelsbrunner
• Keywords: Algorithms, COMPGEOM 2000, Discrete Geometry, Fast Implementations, Hybrid Algorithm