Efficient and robust discrete conformal equivalence with boundary

Abstract

We describe an efficient algorithm to compute a discrete metric with prescribed Gaussian curvature at all interior vertices and prescribed geodesic curvature along the boundary of a mesh. The metric is (discretely) conformally equivalent to the input metric. Its construction is based on theory developed in [Gu et al. 2018b] and [Springborn 2020], relying on results on hyperbolic ideal Delaunay triangulations. Generality is achieved by considering the surface's intrinsic triangulation as a degree of freedom, and particular attention is paid to the proper treatment of surface boundaries. While via a double cover approach the case with boundary can be reduced to the case without boundary quite naturally, the implied symmetry of the setting causes additional challenges related to stable Delaunay-critical configurations that we address explicitly. We furthermore explore the numerical limits of the approach and derive continuous maps from the discrete metrics.

The 3D Motorcycle Complex for Structured Volume Decomposition

“…Remark : The motorcycle complex is well‐defined only for valid seamless parametrizations in general. Their fully robust generation in 3D is a problem under broad investigation, following recent advances regarding the analogous 2D problem [ZTZC20, CSZZ19, CCS ∗ 21]. In particular because our algorithm operates on generic continuous rather than special quantized parametrizations, it was easy, though, to yield valid input parametrizations for 15 out of 19 models from [LZC ∗ 18] already with the above simple best‐effort approach following [NRP11].…”

Hex-Mesh Generation and Processing: a Survey

“…The use of reduced coordinates to represent and manipulate meshes (e.g. via curvature or edge lengths) is a broad topic and has been widely studied, especially for the surface case [Campen et al 2021;Crane et al 2011]. Specifically, the aforementioned paper shows that any input polycube segmentation can be translated into a set of prescribed dihedral angles that encode the change of normal orientation along the surface.…”

“…While there are heuristics [Lyon et al 2016] to recover a valid hexahedral mesh even from some invalid integer-grid maps with flips, no general guarantees are available. In the 2D setting, aiming at quadrilateral mesh generation, a stream of recent work has shown ways to reliably generate flip-free maps with prescribed singularities (for instance implied by frame fields) and boundary alignment [Campen et al 2021[Campen et al , 2019Campen and Zorin 2017;Gillespie et al 2021]. It is based on phrasing the problem as a constrained metric computation problem; in a specific discrete conformal setting and formulated in per-vertex scale variables, the problem becomes convex and can be solved reliably.…”

TinyAD: Automatic Differentiation in Geometry Processing Made Simple

“…Examples of custom solver details implemented in geometry processing works include manifold optimization [RS15], problem‐specific pre‐conditioning [KGL16, CBSS17, SBCK19], varying problem size [JSP17], varying variable representation [SCBK20], varying objective functions [LYNF18], alternating optimization [ESBC19], derivative manipulation and transport [SCBK20], custom line search strategies (e.g. involving mesh modifications) [CCS∗21, SCBK20], and many more. Common optimization libraries (e.g.…”