Premium
Para‐Graph: Graph‐Based Parameterization of Triangle Meshes with Arbitrary Genus
Author(s) -
Patanè Giuseppe,
Spagnuolo Michela,
Falcidieno Bianca
Publication year - 2004
Publication title -
computer graphics forum
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.578
H-Index - 120
eISSN - 1467-8659
pISSN - 0167-7055
DOI - 10.1111/j.1467-8659.2004.00808.x
Subject(s) - polygon mesh , adjacency list , parameterized complexity , graph , computer science , chart , conical surface , barycentric coordinate system , isosurface , mathematics , algorithm , data structure , topology (electrical circuits) , combinatorics , theoretical computer science , geometry , visualization , artificial intelligence , statistics , programming language
This paper describes a novel approach to the parameterization of triangle meshes representing 2‐manifolds with an arbitrary genus. A topology‐based decomposition of the shape is computed and used to segment the shape into primitives, which define a chart decomposition of the mesh. Then, each chart is parameterized using an extension of the barycentric coordinates method. The charts are all 0‐genus and can be of three types only, depending on the number of boundary components. The chart decomposition and the parameterization are used to define a shape graph where each node represents one primitive and the arcs code the adjacency relationships between the primitives. Conical and cylindrical primitives are coded together with their skeletal lines that are computed from and aligned with their parameterization. The application of the parameterization approach to remeshing guarantees that extraordinary vertices are localized only where two patches share a boundary and they are not scattered on the whole surface.