Test for intersection between a plane and a connected compact polyhedron

DOI10.1016/0010-4485(94)90090-6MaRDI QIDQ1335437zbMATH OpenOpenAlexFDO

Authors Ching-Kuang Shene

Publication date 28 March 1995

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

Full work available at URL https://doi.org/10.1016/0010-4485(94)90090-6

zbMATH Keywords

algorithmcomplexitygeometric intersectionslinear programmingnumerical examplesrange computations

Mathematics Subject Classification ID

Descriptive geometry (51N05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Interval and finite arithmetic (65G30) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Review text

A method of constructing a test for intersection between a plane and a connected compact polyhedron with a finite number of vertices is proposed. Using linear programming, the intersection test is transformed to compute the range of a linear function, and then test to see whether it contains zero. A complexity analysis of the algorithm and computer experiment examples are presented.

Recommendations

• Test for intersection between plane and box
• Test for intersection between box and tetrahedron
• scientific article; zbMATH DE number 3874425
• scientific article; zbMATH DE number 1089821
• The intersection condition for regular polytopes
• On intersections of simply connected sets in the plane
• Property testing for point sets on the plane
• Connectivity of plane triangulations
• scientific article; zbMATH DE number 1839668

Cited in

(5)

• An algorithm for the numerical detection of simplex overlap
• Test for intersection between box and tetrahedron
• scientific article; zbMATH DE number 1537530 (Why is no real title available?)
• How trivial are reliable box-plane intersections?
• Fast detection of polyhedral intersection

This page was built for publication: Test for intersection between a plane and a connected compact polyhedron

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