An algorithm for the numerical detection of simplex overlap

DOI10.1016/0893-9659(95)00039-SMaRDI QIDQ1895105zbMATH OpenFDO

Authors M. L. Brodzik

Publication date 14 August 1995

Published in Applied Mathematics Letters (Search for Journal in Brave)

zbMATH Keywords

computational geometrysimplexnumerical algorithmsintersection detection

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 4098718
• A dual approach to detect polyhedral intersections in arbitrary dimensions
• scientific article; zbMATH DE number 1839668
• A simple linear algorithm for intersecting convex polygons
• Test for intersection between a plane and a connected compact polyhedron

Cites work

• scientific article; zbMATH DE number 3928227 (Why is no real title available?)
• scientific article; zbMATH DE number 4110185 (Why is no real title available?)
• scientific article; zbMATH DE number 4189102 (Why is no real title available?)
• Collision of convex objects
• Detecting the intersection of convex objects in the plane
• The computation of simplicial approximations of implicitly defined two- dimensional manifolds

Cited in

(2)

• The computation of simplicial approximations of implicitly defined \(p\)-dimensional manifolds
• MANPAK: A set of algorithms for computations on implicitly defined manifolds

This page was built for publication: An algorithm for the numerical detection of simplex overlap

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