Semi-Regular Triangle Remeshing: A Comprehensive Study

Semi‐regular triangle remeshing algorithms convert irregular surface meshes into semi‐regular ones. Especially in the field of computer graphics, semi‐regularity is an interesting property because it makes meshes highly suitable for multi‐resolution analysis. In this paper, we survey the numerous re...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Computer graphics forum Ročník 34; číslo 1; s. 86 - 102
Hlavní autoři:	Payan, F., Roudet, C., Sauvage, B.
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Oxford Blackwell Publishing Ltd 01.02.2015 Wiley
Témata:	Algorithms Analysis Classification Classifications Computer graphics Computer Science curves & surfaces modeling Engineering Sciences I.3.5 [Computer Graphics]: Computational Geometry and Object Modelling-Curve surface I.3.5 [Computer Graphics]: Computational Geometry and Object Modelling—Curve surface, solid—and object representations mesh generation modeling Obstacles Signal and Image Processing solid-and object representations Studies subdivision surface modeling Triangles
ISSN:	0167-7055, 1467-8659
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Popis
Shrnutí:	Semi‐regular triangle remeshing algorithms convert irregular surface meshes into semi‐regular ones. Especially in the field of computer graphics, semi‐regularity is an interesting property because it makes meshes highly suitable for multi‐resolution analysis. In this paper, we survey the numerous remeshing algorithms that have been developed over the past two decades. We propose different classifications to give new and comprehensible insights into both existing methods and issues. We describe how considerable obstacles have already been overcome, and discuss promising perspectives. Semi‐regular triangle remeshing algorithms convert irregular surface meshes into semi‐regular ones. Especially in the field of computer graphics, semi‐regularity is an interesting property because it makes meshes highly suitable for multiresolution analysis.In this paper, we survey the numerous remeshing algorithms that have been developed over the past two decades.We propose different classifications to give new and comprehensible insights into both existing methods and issues. We describe how considerable obstacles have already been overcome, and discuss promising perspectives.
Bibliografie:	ArticleID:CGF12461 istex:85D3C84A1C19829FEB44BF0A58DD7AA86EE61822 ark:/67375/WNG-HPKQ8PR9-M SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 ObjectType-Article-1 ObjectType-Feature-2 content type line 23
ISSN:	0167-7055 1467-8659
DOI:	10.1111/cgf.12461