论文信息 - Closed-form Quadrangulation of N-Sided Patches

Closed-form Quadrangulation of N-Sided Patches

We analyze the problem of quadrangulating a n-sided patch, each side at its boundary subdivided into a given number of edges, using a single irregular vertex (or none, when n = 4) that breaks the otherwise fully regular lattice. We derive, in an analytical closed-form, (1) the necessary and sufficient conditions that a patch must meet to admit this quadrangulation, and (2) a full description of the resulting tessellation(s).

Marco Tarini | M. Tarini

[1] Bruno Lévy,et al. Quad‐Mesh Generation and Processing: A Survey , 2013, Comput. Graph. Forum.

[2] Elaine Cohen,et al. Quadrilateral mesh simplification , 2008, SIGGRAPH Asia '08.

[3] D. Zorin,et al. DEF: Deep Estimation of Sharp Geometric Features in 3D Shapes , 2021 .

[4] Kenshi Takayama,et al. Robust and Controllable Quadrangulation of Triangular and Rectangular Regions , 2013 .

[5] Marcel Campen,et al. Partitioning Surfaces Into Quadrilateral Patches: A Survey , 2017, Comput. Graph. Forum.

[6] Kenshi Takayama,et al. Pattern‐Based Quadrangulation for N‐Sided Patches , 2014, Comput. Graph. Forum.

[7] Eugene Zhang,et al. Connectivity editing for quadrilateral meshes , 2011, ACM Trans. Graph..

[8] E. Catmull,et al. Recursively generated B-spline surfaces on arbitrary topological meshes , 1978 .

[9] Kenshi Takayama,et al. Data-driven interactive quadrangulation , 2015, ACM Trans. Graph..

[10] Daniele Panozzo,et al. Practical quad mesh simplification , 2010, Comput. Graph. Forum.

[11] Daniele Panozzo,et al. Automatic Construction of Quad-Based Subdivision Surfaces Using Fitmaps , 2011, IEEE Transactions on Visualization and Computer Graphics.