Robust Polygons Clipping to Model Complex Objects
Loading...
Date
2000
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Eurographics Association
Abstract
One of the most important problems to solve in Solids Modelling is computing the boolean operations for solids (union, intersection and difference). In order to implement these three operations an algorithm to compute the intersection between faces is needed (polygons clipping). In the case of solids with planar faces there are many solutions, although most of them are valid only when the faces are convex. In this paper we present an algorithm to determine the intersection between polygons of any nature (concave or convex, manifol or non-manifold, with or without holes, etc.) based on the idea of simplicial coverings proposed by Feito 11. One of the advantages of this approach is the robustness of algorithms, since decompositions or complex operations that may alter the results obtained are not avoided. A very interesting application of this algorithm is the modelling of complex solids with this type of polygons as faces.
Description
@inproceedings{10.2312:egs.20001002,
booktitle = {Eurographics 2000 - Short Presentations},
editor = {},
title = {{Robust Polygons Clipping to Model Complex Objects}},
author = {Segura, Rafael J. and Feito, Francisco R.},
year = {2000},
publisher = {Eurographics Association},
ISSN = {1017-4656},
ISBN = {},
DOI = {10.2312/egs.20001002}
}