SearcharxivSearch

arXiv · 2502.19088

A Nonlinear Extension of the Variable Projection (VarPro) Method for NURBS-based Conformal Surface Flattening

Abstract

In the field of computer graphics, conformal surface flattening has been widely studied for tasks such as texture mapping, geometry processing, and mesh generation. Typically, existing methods aim to flatten a given input geometry while preserving conformality as much as possible, meaning the result is only as conformal as possible. By contrast, this study focuses on surfaces that can be flattened conformally without singularities, making the process a coupled problem: the input (or target) surface must be recursively refined while its flattening is computed. Although the uniformization theorem or the Riemann mapping theorem guarantees the existence of a conformal flattening for any simply connected, orientable surface, those theorems permit singularities in the flattening. If singularities are not allowed, only a special class of surfaces can be conformally flattened-though many practical surfaces do fall into this class. To address this, we develop a NURBS-based approach in which both the input surface and its flattening are refined in tandem, ensuring mutual conformality. Because NURBS surfaces cannot represent singularities, the resulting pair of surfaces is naturally singularity-free. Our work is inspired by the form-finding method by [Miki and Mitchell 2022, 2024], which solves bilinear PDEs by iteratively refining two surfaces together. Building on their demonstration of the effectiveness of variable projection (VarPro), we adopt a similar strategy: VarPro alternates between a linear projection and a nonlinear iteration, leveraging a partially linear (separable) problem structure. However, since our conformal condition separates into two nonlinear subproblems, we introduce a nonlinear extension of VarPro. Although this significantly increases computational cost, the quality of the results is noteworthy.

Explore related subjects

Keep this discovery

BibTeXRIS

Masaaki Miki. 2025-02-26. A Nonlinear Extension of the Variable Projection (VarPro) Method for NURBS-based Conformal Surface Flattening. https://arxiv.org/abs/2502.19088

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Almost Linear Universal Point Sets for Planar Graphs

A point set is universal for planar graphs on $n$ vertices if every such graph has a straight-line drawing without crossings whose vertices belong to the set. We construct universal point sets of size $n^{1+o(1)}$, improving the previous quadratic upper bound. Our construction uses the reduction of Bannister, Cheng, Devanny, and Eppstein from universal point sets to superpatterns for $213$-avoiding permutations. We represent these permutations by ordered rooted forests and construct a small family of intervals containing every such forest. The result follows from a straightforward bound on the size of the family of intervals. GPT-6 Astra assisted in developing the construction and proof.

cs.CG

Some results on Archdeacon's conjecture for rotation systems

A rotation system on $n$ elements assigns to each element a cyclic order of the other $n-1$ elements. A four-element subset is non-planar if its induced rotation system cannot be realized by a crossing-free drawing of $K_4$. As a combinatorial strengthening of Hill's conjecture on the crossing number of the complete graph, Archdeacon conjectured that every rotation system on $n$ elements has at least $H(n)=\frac{1}{4} \lfloor\frac {n}{2}\rfloor \lfloor\frac{n-1}{2}\rfloor \lfloor\frac{n-2}{2}\rfloor \lfloor\frac{n-3}{2}\rfloor$ non-planar four-element subsets. We computationally verify Archdeacon's conjecture for $n\leq 10$ and show that every extremal rotation system in these orders is realizable by a simple drawing. With computer assistance, we prove that every rotation system on $n$ elements has at least $(8/9 - o(1)) H(n)$ non-planar four-element subsets. We also present a proof by hand for a weaker lower bound of $(2/3-o(1)) H(n)$. Finally, extending recent work of Felsner on antipodal pairs in drawings, we show that Archdeacon's conjecture holds for antipodally shellable rotation systems.

cs.CG

The Hyperbolic Surface Distance, Diameter, and Dirichlet Problems

Despite the prominence of hyperbolic surfaces in mathematics, basic algorithmic questions about them, even computing the distance between two points, have remained open, leaving many features of these surfaces inaccessible. The classical machinery assumes a polyhedral structure absent on a smooth surface. We remove these obstacles. We begin with an efficient $O(g^2)$ algorithm for the distance between two points, where $g$ is the genus of the surface. Building on it, we obtain an $O(g^2 \log g)$ method for answering distance queries from a fixed source and, as a consequence, for recentering a Dirichlet domain around an arbitrary point. This understanding of distances on the surface then lets us approximate the diameter to within any $\eps$ in time $O(g^3 \log g / \eps^2)$. We further show that the diameter, a single real number encoding a great deal about the surface, is exactly computable. Its hyperbolic cosine is an algebraic number over the field encoding the coefficients of the hyperbolic isometries defining the surface.

cs.CG