The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.02 - April-June (2001 vol.7)
pp: 136-151
ABSTRACT
<p><b>Abstract</b>—Many real-world polygonal surfaces contain topological singularities that represent a challenge for processes such as simplification, compression, and smoothing. We present an algorithm that removes singularities from nonmanifold sets of polygons to create manifold (optionally oriented) polygonal surfaces. We identify singular vertices and edges, <it>multiply</it> singular vertices, and <it>cut</it> through singular edges. In an optional <it>stitching</it> operation, we maintain the surface as a manifold while joining boundary edges. We present two different edge stitching strategies, called <it>pinching</it> and <it>snapping</it>. Our algorithm manipulates the surface topology and ignores physical coordinates. Except for the optional stitching, the algorithm has a linear complexity and requires no floating point operations. In addition to introducing new algorithms, we expose the complexity (and pitfalls) associated with stitching. Finally, several real-world examples are studied.</p>
INDEX TERMS
Polygonal surface, topological singularities, manifold, cutting, stitching.
CITATION
André Guéziec, Gabriel Taubin, Francis Lazarus, Bill Horn, "Cutting and Stitching: Converting Sets of Polygons to Manifold Surfaces", IEEE Transactions on Visualization & Computer Graphics, vol.7, no. 2, pp. 136-151, April-June 2001, doi:10.1109/2945.928166
16 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool