Synchronizing Fields with Singularities
Natalia Pacheco-Tallaj, Mattéo Couplet, Edward Chien, David R. Palmer
Abstract
A variety of problems in geometry processing boil down to finding the most parallel field relative to a connection. Instances of this prototypical problem show up in computing direction fields and stripe patterns, quadrilateral meshing, and visualization of fluid flows. When the class of allowed fields includes those with topological defects, a relaxation is required to make the problem well-posed. We observe that these problems can be viewed as synchronization problems, which admit a natural semidefinite relaxation. We propose a unified method of solving all these problems via the efficient Burer-Monteiro factorization method. Geometrically, this amounts to lifting the field values to a higher-dimensional manifold, naturally resolving the singular nature of defects. Practically, we show that our convex relaxation method achieves better and more reliable optima than previous work employing alternative relaxations.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext c893bf2b-be93-46a9-92ec-cbf8cb20914aBuilds on4
- Polynomial time guarantees for the Burer-Monteiro methodDiego Cifuentes, Ankur MoitraNeurIPS 2022 · 40 citations
- Differentiable Stripe Patterns for Inverse Design of Structured SurfacesJuan Montes Maestre, Yinwei Du, Ronan Hinchet, Stelian Coros et al.SIGGRAPH 2023 · 14 citations
- Lifting Directional Fields to Minimal SectionsDavid R. Palmer, Albert Chern, Justin SolomonSIGGRAPH 2024 · 9 citations
- Curl Quantization for Automatic Placement of Knit SingularitiesRahul Mitra, Mattéo Couplet, Tongtong Wang, Megan Hofmann et al.SIGGRAPH 2025 · 7 citations
Related papers
- Semidefinite Programming versus Burer-Monteiro Factorization for Matrix SensingBaturalp Yalçin, Ziye Ma, Javad Lavaei, Somayeh SojoudiAAAI 2023 · 8 citations
- Fast linking numbers for topology verification of loopy structuresAnte Qu, Doug L. JamesSIGGRAPH 2021 · 17 citations
- Scaling Convex Neural Networks with Burer-Monteiro FactorizationArda Sahiner, Tolga Ergen, Batu Ozturkler, John M. Pauly et al.ICLR 2024 · 4 citations
- Developability of heightfields via rank minimizationSilvia Sellán, Noam Aigerman, Alec JacobsonSIGGRAPH 2020 · 30 citations
- Over-parametrization via Lifting for Low-rank Matrix Sensing: Conversion of Spurious Solutions to Strict Saddle PointsZiye Ma, Igor Molybog, Javad Lavaei, Somayeh SojoudiICML 2023 · 5 citations
