FAST SOFTWARE FOR BOX INTERSECTIONS

DOI10.1142/S0218195902000785zbMath1080.68713OpenAlexW2095966322MaRDI QIDQ4818605

Afra Zomorodian, Herbert Edelsbrunner

Publication date: 29 September 2004

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218195902000785

zbMATH Keywords

algorithmsquantificationimplementationexperimentationsegment treebox intersectionrange tree

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (5)

Boolean operations on 3D selective Nef complexes: data structure, algorithms, optimized implementation and experiments ⋮ Separating linear forms and rational univariate representations of bivariate systems ⋮ Exact, robust, and efficient regularized Booleans on general 3D meshes ⋮ Local polyhedra and geometric graphs ⋮ Parallel geometric algorithms for multi-core computers

Cites Work

• Multidimensional divide-and-conquer
• Batched dynamic solutions to decomposable searching problems
• Multidimensional binary search trees used for associative searching
• APPROXIMATING CENTER POINTS WITH ITERATIVE RADON POINTS

This page was built for publication: FAST SOFTWARE FOR BOX INTERSECTIONS