.png){kind=icon}
Return
Computing Sparse Cones with Bounded Distortion for Conformal Parameterizations
.png){kind=icon}
PRE
AI
DOI：10.1145/3478513.3480526.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We propose a novel method to generate sparse cone singularities with bounded distortion constraints for conformal parameterizations. It is formulated as minimizing the l(0)-norm of Gaussian curvature of vertices with hard constraints of bounding the distortion that is measured by the l(2)-norm of the log conformal factor. We use the reweighted l(1)-norm to approximate the l(0)-norm and solve each convex weighted l(1) minimization subproblem by the Douglas-Rachford (DR) splitting scheme. To quickly generate sparse cones, we modify DR splitting by weighting the l(2)-norm of the proximal mapping to force the small Gaussian curvature to quickly approach zero. Accordingly, compared with the conventional DR splitting, the modified method performs one to two orders of magnitude faster. Besides, we perform variable substitution of log conformal factors to simplify the computation process for acceleration. Our algorithm is able to bound distortion to compute sparse cone singularities, so that the resulting conformal parameterizations achieve a favorable tradeoff between the area distortion and the number of cones. We demonstrate its effectiveness and feasibility on a large number of models.
Keywords:
conformal parameterizations
cone singularities
bounded distortion
l(0)-norm optimization
Journal
IF:
9.5
Papers:
4.8K
Citations:
3.6W
Organization
Cited Papers
.png){kind=icon}
ShareSave
ShareSaveShareSaveShareSaveShareSave
View more