A Robust and Consistent Algorithm for Intersecting Convex Polyhedra

Simple item page
dc.contributor.authorSugihara, Kokichien_US
dc.date.accessioned2014-10-21T07:31:25Z
dc.date.available2014-10-21T07:31:25Z
dc.date.issued1994en_US
dc.description.abstractThis 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.en_US
dc.description.number3en_US
dc.description.seriesinformationComputer Graphics Forumen_US
dc.description.volume13en_US
dc.identifier.doi10.1111/1467-8659.1330045en_US
dc.identifier.issn1467-8659en_US
dc.identifier.pages45-54en_US
dc.identifier.urihttps://doi.org/10.1111/1467-8659.1330045en_US
dc.publisherBlackwell Science Ltd and the Eurographics Associationen_US
dc.titleA Robust and Consistent Algorithm for Intersecting Convex Polyhedraen_US
Files
Collections
Issue 3
EG 1994 Conference Proceedings