FAST SOFTWARE FOR BOX INTERSECTIONS

DOI10.1142/S0218195902000785MaRDI QIDQ4818605zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

algorithmsbox intersectionexperimentationimplementationquantificationrange treesegment tree

Mathematics Subject Classification ID

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

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

Cites work

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

Cited in

(9)

• Box-sphere intersection tests
• Local polyhedra and geometric graphs
• Exact, robust, and efficient regularized Booleans on general 3D meshes
• Boolean operations on 3D selective Nef complexes: data structure, algorithms, optimized implementation and experiments
• ERIT—A Collection of Efficient and Reliable Intersection Tests
• Test for intersection between box and tetrahedron
• Separating linear forms and rational univariate representations of bivariate systems
• How trivial are reliable box-plane intersections?
• Parallel geometric algorithms for multi-core computers

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)