Test for intersection between box and tetrahedron

DOI10.1080/00207169708804610MaRDI QIDQ4375398zbMATH OpenOpenAlexFDO

Authors H. Ratschek, J. Rokne

Publication date 5 January 1999

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207169708804610

zbMATH Keywords

boxnumerical examplesbarycentric coordinatesinterval analysistetrahedronrange computationgeometric intersection

Mathematics Subject Classification ID

Interval and finite arithmetic (65G30)

Recommendations

• Box-sphere intersection tests
• How trivial are reliable box-plane intersections?
• Test for intersection between a plane and a connected compact polyhedron
• FAST SOFTWARE FOR BOX INTERSECTIONS
• An algorithm for the numerical detection of simplex overlap

Cites work

• scientific article; zbMATH DE number 3936378 (Why is no real title available?)
• A procedure to determine intersections between polyhedral objects
• Computation of rational interval functions
• Test for intersection between a plane and a connected compact polyhedron
• Test for intersection between plane and box

Cited in

(3)

• How trivial are reliable box-plane intersections?
• Test for intersection between a plane and a connected compact polyhedron
• Test for intersection between circle and rectangle

This page was built for publication: Test for intersection between box and tetrahedron

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