Robust Computation of Intersection Graph between Two Solids

Simple item page
dc.contributor.authorNakamura, Hiroyukien_US
dc.contributor.authorHigashi, Masatakeen_US
dc.contributor.authorHosaka, Mamoruen_US
dc.date.accessioned2015-02-15T18:05:14Z
dc.date.available2015-02-15T18:05:14Z
dc.date.issued1997en_US
dc.description.abstractWe propose a new robust algorithm for Boolean operations on solid models. The algorithm produces a consistent intersection graph between two input solids whose geometrical data are represented in floating point numbers. In order to prevent numerical calculation errors and inaccuracy of input data from causing inconsistency of the output, we put higher priority on symbolical connectivity of the edge-face intersection points than their numerical nearness. Each edge-face intersection point is symbolically represented using face names, which generate connectivity relations between the intersection points and the intersection line segments. The symbols with the same connectivity are made into clusters. The intersection line segments connected together at their end clusters form the intersection graph of two solids. Inconsistency of the connectivity of the clusters is detected and the intersection graph is corrected automatically. We describe the algorithm in detail for polyhedral solids, discuss extension to curves solids, and show its effectiveness by some examples of Boolean operations for two solids whose faces intersect at a very small angle.en_US
dc.description.number3en_US
dc.description.seriesinformationComputer Graphics Forumen_US
dc.description.volume16en_US
dc.identifier.doi10.1111/1467-8659.00144en_US
dc.identifier.issn1467-8659en_US
dc.identifier.pagesC79-C88en_US
dc.identifier.urihttps://doi.org/10.1111/1467-8659.00144en_US
dc.publisherBlackwell Publishers Ltd and the Eurographics Associationen_US
dc.titleRobust Computation of Intersection Graph between Two Solidsen_US
Files
Collections
Issue 3