.png){kind=icon}
Return
Efficient Cone Singularity Construction for Conformal Parameterizations
.png){kind=icon}
PRE
AI
DOI：10.1145/3618407.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We propose an efficient method to construct sparse cone singularities under distortion-bounded constraints for conformal parameterizations. Central to our algorithm is using the technique of shape derivatives to move cones for distortion reduction without changing the number of cones. In particular, the supernodal sparse Cholesky update significantly accelerates this movement process. To satisfy the distortion-bounded constraint, we alternately move cones and add cones. The capability and feasibility of our approach are demonstrated over a data set containing 3885 models. Compared with the state-of-the-art method, we achieve an average acceleration of 15 times and slightly fewer cones for the same amount of distortion.
Keywords:
Conformal parameterizations
cone singularities
moving cones
adding cones
distortion-bounded constraints
Journal
IF:
9.5
Papers:
4.8K
Citations:
3.6W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSave
View more