Seamless Parametrization with Arbitrarily Prescribed Cones
Marcel Campen, Hanxiao Shen, Jiaran Zhou, Denis Zorin

TL;DR
This paper proves the existence of seamless surface parametrizations with prescribed cones and introduces a constructive algorithm combining convex optimization and linear systems to compute such mappings.
Contribution
It establishes the universal existence of seamless parametrizations with arbitrary prescribed cones and provides a practical algorithm for their computation.
Findings
A constructive proof of the existence of seamless parametrizations with prescribed cones.
An algorithm combining convex conformal maps and linear modifications for computing these parametrizations.
The method enables initialization for distortion optimization in geometry processing applications.
Abstract
Seamless global parametrization of surfaces is a key operation in geometry processing, e.g. for high-quality quad mesh generation. A common approach is to prescribe the parametric domain structure, in particular the locations of parametrization singularities (cones), and solve a non-convex optimization problem minimizing a distortion measure, with local injectivity imposed through either constraints or barrier terms. In both cases, an initial valid parametrization is essential to serve as feasible starting point for obtaining an optimized solution. While convexified versions of the constraints eliminate this initialization requirement, they narrow the range of solutions, causing some problem instances that actually do have a solution to become infeasible. We demonstrate that for arbitrary given sets of topologically admissible parametric cones with prescribed curvature, a global…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
