An algorithm for the numerical detection of simplex overlap

DOI10.1016/0893-9659(95)00039-SzbMath0826.65140MaRDI QIDQ1895105

M. L. Brodzik

Publication date: 14 August 1995

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

zbMATH Keywords

simplexcomputational geometrynumerical 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)

Related Items (2)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Detecting the intersection of convex objects in the plane
• The computation of simplicial approximations of implicitly defined two- dimensional manifolds
• Collision of convex objects

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