Premium
A Robust and Consistent Algorithm for Intersecting Convex Polyhedra
Author(s) -
Sugihara Kokichi
Publication year - 1994
Publication title -
computer graphics forum
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.578
H-Index - 120
eISSN - 1467-8659
pISSN - 0167-7055
DOI - 10.1111/1467-8659.1330045
Subject(s) - polyhedron , regular polygon , computer science , algorithm , convex polytope , convex set , convex optimization , combinatorics , mathematics , geometry
This paper presents a numerically robust and topologically consistent algorithm for intersecting convex polyhedra. This algorithm is new in the sense that the consistency issue is completely separated from the numerical error issue. The intersection operation is combinatorially abstracted as the operation of changing the vertex‐edge graphs associated with the input polyhedra, and numerical computation is employed only for choosing the branch of processing which is most likely to lead to the correct solution of the problem. Hence, the resultant algorithm is completely free from topological inconsistency.