How trivial are reliable box-plane intersections?

DOI10.1016/S0010-4485(00)00052-XzbMATH Open1206.65059OpenAlexW1967781922WikidataQ126809420 ScholiaQ126809420MaRDI QIDQ628002FDOQ628002

Authors H. Ratschek, J. Rokne

Publication date 4 March 2011

Published in CAD. Computer-Aided Design (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0010-4485(00)00052-x

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computer science aspects of computer-aided design (68U07) Computer-aided design (modeling of curves and surfaces) (65D17)

Recommendations

• FAST SOFTWARE FOR BOX INTERSECTIONS
• ERIT—A Collection of Efficient and Reliable Intersection Tests
• Box-sphere intersection tests
• Test for intersection between box and tetrahedron
• Test for intersection between a plane and a connected compact polyhedron

Cited in

(4)

• Line segment intersection testing
• Introduction to the special issue: What can one learn from box-plane intersections?
• FAST SOFTWARE FOR BOX INTERSECTIONS
• A robust segment/triangle intersection algorithm for interference tests. Efficiency study

Describes a project that uses

Uses Software

• C-XSC 2.0

This page was built for publication: How trivial are reliable box-plane intersections?

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