FAST SOFTWARE FOR BOX INTERSECTIONS

DOI10.1142/S0218195902000785zbMATH Open1080.68713OpenAlexW2095966322MaRDI QIDQ4818605FDOQ4818605

Authors: 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

Recommendations

• How trivial are reliable box-plane intersections?
• ERIT—A Collection of Efficient and Reliable Intersection Tests
• Fast detection of polyhedral intersection
• Box-sphere intersection tests
• scientific article; zbMATH DE number 1182926

zbMATH Keywords

algorithmsquantificationexperimentationimplementationsegment treebox intersectionrange tree

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (6)

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

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

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