Quad Mesh Quantization Without a T‐Mesh

Coudert‐Osmont, Yoann; Desobry, David; Heistermann, Martin; Bommes, David; Ray, Nicolas; Sokolov, Dmitry (2023). Quad Mesh Quantization Without a T‐Mesh. Computer graphics forum, 43(1) Wiley 10.1111/cgf.14928

Text Computer_Graphics_Forum_-_2023_-_Coudert_Osmont_-_Quad_Mesh_Quantization_Without_a_T_Mesh.pdf - Published Version Restricted to registered users only Available under License Publisher holds Copyright. Download (5MB) | Request a copy

Grid preserving maps of triangulated surfaces were introduced for quad meshing because the 2D unit grid in such maps corresponds to a sub-division of the surface into quad-shaped charts. These maps can be obtained by solving a mixed integer optimization problem: Real variables define the geometry of the charts and integer variables define the combinatorial structure of the decomposition. To make this optimization problem tractable, a common strategy is to ignore integer constraints at first, then to enforce them in a so-called quantization step. Actual quantization algorithms exploit the geometric interpretation of integer variables to solve an equivalent problem: They consider that the final quad mesh is a sub-division of a T-mesh embedded in the surface, and optimize the number of sub-divisions for each edge of this T-mesh. We propose to operate on a decimated version of the original surface instead of the T-mesh. It is easier to implement and to adapt to constraints such as free boundaries, complex feature curves network etc.

Interest & Impact

Downloads

1 since deposited on 25 Jan 2024
1 in the past 12 months

Citations

5 Citations in Web of Science ®
6 Citations in Scopus

Search

in Google Scholar™

Services

Actions (login required)

Edit item

Actions (login required)

Edit item