Full metadata
Title
Connectivity control for quad-dominant meshes
Description
Quad-dominant (QD) meshes, i.e., three-dimensional, 2-manifold polygonal meshes comprising mostly four-sided faces (i.e., quads), are a popular choice for many applications such as polygonal shape modeling, computer animation, base meshes for spline and subdivision surface, simulation, and architectural design. This thesis investigates the topic of connectivity control, i.e., exploring different choices of mesh connectivity to represent the same 3D shape or surface. One key concept of QD mesh connectivity is the distinction between regular and irregular elements: a vertex with valence 4 is regular; otherwise, it is irregular. In a similar sense, a face with four sides is regular; otherwise, it is irregular. For QD meshes, the placement of irregular elements is especially important since it largely determines the achievable geometric quality of the final mesh.
Traditionally, the research on QD meshes focuses on the automatic generation of pure quadrilateral or QD meshes from a given surface. Explicit control of the placement of irregular elements can only be achieved indirectly. To fill this gap, in this thesis, we make the following contributions. First, we formulate the theoretical background about the fundamental combinatorial properties of irregular elements in QD meshes. Second, we develop algorithms for the explicit control of irregular elements and the exhaustive enumeration of QD mesh connectivities. Finally, we demonstrate the importance of connectivity control for QD meshes in a wide range of applications.
Traditionally, the research on QD meshes focuses on the automatic generation of pure quadrilateral or QD meshes from a given surface. Explicit control of the placement of irregular elements can only be achieved indirectly. To fill this gap, in this thesis, we make the following contributions. First, we formulate the theoretical background about the fundamental combinatorial properties of irregular elements in QD meshes. Second, we develop algorithms for the explicit control of irregular elements and the exhaustive enumeration of QD mesh connectivities. Finally, we demonstrate the importance of connectivity control for QD meshes in a wide range of applications.
Date Created
2014
Contributors
- Peng, Chi-Han (Author)
- Wonka, Peter (Thesis advisor)
- Maciejewski, Ross (Committee member)
- Farin, Gerald (Committee member)
- Razdan, Anshuman (Committee member)
- Arizona State University (Publisher)
Topical Subject
Resource Type
Extent
ix, 103 p. : col. ill
Language
eng
Copyright Statement
In Copyright
Primary Member of
Peer-reviewed
No
Open Access
No
Handle
https://hdl.handle.net/2286/R.I.26820
Statement of Responsibility
by Chi-Han Peng
Description Source
Viewed on January 14, 2015
Level of coding
full
Note
thesis
Partial requirement for: Ph.D., Arizona State University, 2014
bibliography
Includes bibliographical references (p. 97-102)
Field of study: Computer science
System Created
- 2014-12-01 07:01:36
System Modified
- 2021-08-30 01:32:23
- 3 years 2 months ago
Additional Formats