Principles of interactive computer graphics (2nd ed.)
Principles of interactive computer graphics (2nd ed.)
Boolean operations of 2-manifolds through vertex neighborhood classification
ACM Transactions on Graphics (TOG)
Constructive solid geometry for polyhedral objects
SIGGRAPH '86 Proceedings of the 13th annual conference on Computer graphics and interactive techniques
Consistent calculations for solids modeling
SCG '85 Proceedings of the first annual symposium on Computational geometry
Raster-scan hidden surface algorithm techniques
SIGGRAPH '77 Proceedings of the 4th annual conference on Computer graphics and interactive techniques
A scan-line hidden surface removal procedure for constructive solid geometry
SIGGRAPH '83 Proceedings of the 10th annual conference on Computer graphics and interactive techniques
Polygon comparison using a graph representation
SIGGRAPH '80 Proceedings of the 7th annual conference on Computer graphics and interactive techniques
A 3-dimensional representation for fast rendering of complex scenes
SIGGRAPH '80 Proceedings of the 7th annual conference on Computer graphics and interactive techniques
UNIGRAFIX 2.0 User''s Manual and Tutorial
UNIGRAFIX 2.0 User''s Manual and Tutorial
Modelling volumes bounded by b-spline surfaces
Modelling volumes bounded by b-spline surfaces
Calculating approximate curve arrangements using rounded arithmetic
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Using tolerances to guarantee valid polyhedral modeling results
SIGGRAPH '90 Proceedings of the 17th annual conference on Computer graphics and interactive techniques
Efficient Delaunay triangulation using rational arithmetic
ACM Transactions on Graphics (TOG)
Proceedings of the 18th annual conference on Computer graphics and interactive techniques
Error-free boundary evaluation using lazy rational arithmetic: a detailed implementation
SMA '93 Proceedings on the second ACM symposium on Solid modeling and applications
Intersecting solids on a massively parallel processor
ACM Transactions on Graphics (TOG)
Converting sets of polygons to manifold surfaces by cutting and stitching
Proceedings of the conference on Visualization '98
Cutting and Stitching: Converting Sets of Polygons to Manifold Surfaces
IEEE Transactions on Visualization and Computer Graphics
| Hi-index | 0.00 |
An algorithm is described for partitioning intersecting polyhedrons into disjoint pieces and, more generally, removing intersections from sets of planar polygons embedded in three space. Polygons, or faces, need not be convex and may contain multiple holes. Intersections are removed by considering pairs of faces and slicing the faces apart along their regions of intersection. To reduce the number of face pairs examined, bounding boxes around groups of faces are checked for overlap. The intersection algorithm also computes set-theoretic operations on polyhedrons. Information gathered during face cutting is used to determine which portions of the original boundaries may be present in the result of an intersection, a union, or a difference of solids. The method includes provisions to detect and in some cases overcome, the effects of numerical inaccuracy on the topological decisions that the algorithm must make. The regions in which ambiguous results are possible are flagged so that the user can take appropriate action.