Curvature tensor Based Triangle Mesh Segmentation with Boudary Rectification

Abstract : This paper 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 in Lavoue et al. [Lavoue G, Dupont F, Baskurt A. Constant curvature region decomposition of 3D-meshes by a mixed approach vertex-triangle, J WSCG 2004;12(2):245–52] 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.
Document type :
Conference papers
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01528124
Contributor : Équipe Gestionnaire Des Publications Si Liris <>
Submitted on : Saturday, May 27, 2017 - 2:09:09 PM
Last modification on : Monday, December 10, 2018 - 5:47:47 PM

Identifiers

Citation

Guillaume Lavoué, Florent Dupont, Atilla Baskurt. Curvature tensor Based Triangle Mesh Segmentation with Boudary Rectification. IEEE Computer Graphics International, Jun 2004, Crete, Greece, Greece. pp.10-18, ⟨10.1109/CGI.2004.1309187⟩. ⟨hal-01528124⟩

Share

Metrics

Record views

497