Remeshing triangulated surfaces with optimal parameterizations

Citation
K. Hormann et al., Remeshing triangulated surfaces with optimal parameterizations, COMPUT AID, 33(11), 2001, pp. 779-788
Citations number
24
Categorie Soggetti
Computer Science & Engineering
Journal title
COMPUTER-AIDED DESIGN
ISSN journal
00104485 → ACNP
Volume
33
Issue
11
Year of publication
2001
Pages
779 - 788
Database
ISI
SICI code
0010-4485(200109)33:11<779:RTSWOP>2.0.ZU;2-O
Abstract
The use of polygonal meshes, especially triangle meshes, is manifold, but a lot of algorithms require the mesh to be structured in a certain way and c annot be applied to an arbitrarily structured mesh. The process of replacin g an arbitrarily structured mesh by a structured one is called remeshing an d the most important class of structured meshes are triangle meshes with su bdivision connectivity. In this paper, we present an algorithm for remeshin g triangle meshes with boundary that is based on parameterizing the mesh ov er a planar domain. We discuss what kind of parameterizations are optimal f or the purpose of remeshing and show the advantages of our approach in a se ries of examples. (C) 2001 Elsevier Science Ltd. All rights reserved.