Abstract:
This work presents a new and efficient algorithm for the decomposition of 3D arbitrary triangle meshes into surface patches. The algorithm is based on the curvature tenso...Show MoreMetadata
Abstract:
This work presents a new and efficient algorithm for the decomposition of 3D arbitrary triangle meshes into surface patches. The algorithm is based on the curvature tensor field analysis and presents two distinct complementary steps: a region based segmentation, which is an improvement of that presented by [G. Lavoue et al., (2004)] and which decomposes the object into known and near constant curvature patches, and a boundary rectification based on curvature tensor directions, which corrects boundaries by suppressing their artifacts or discontinuities. Experiments were conducted on various models including both CAD and natural objects, results are satisfactory. Resulting segmented patches, by virtue of their properties (known curvature, clean boundaries) are particularly adapted to computer graphics tasks like parametric or subdivision surface fitting in an adaptive compression objective.
Published in: Proceedings Computer Graphics International, 2004.
Date of Conference: 19-19 June 2004
Date Added to IEEE Xplore: 06 July 2004
Print ISBN:0-7695-2171-1
Print ISSN: 1530-1052