Angle‐Based Metric Adaptation for Quadrangulation

Abstract We present an angle‐based metric optimization method for feature‐aware quadrangulation. Unlike existing methods that optimize symmetric positive definite tensors directly, our approach uses triangle angles as the primary optimization variables. This choice has two immediate advantages. First, the constraints for local flatness (a necessary condition for local integrability), sharp features, and corners can be formulated linearly. Second, the positive orientation of the frame (a necessary condition for local injectivity) can be reduced to a simple box constraint on the angles. Moreover, the formulation naturally supports metric customization tasks, including sizing control, conformality, isometric regularization, and singularity specification. The final optimization problem consists of mostly convex terms and can be solved robustly and efficiently. Experiments on CAD models demonstrate improved frame‐field integrability and greater parameterization robustness compared with existing approaches.

Authors

Institutions

Publication Details

Journal
Computer Graphics Forum
Published
2026-11-13
DOI
https://doi.org/10.1111/cgf.70613
Primary Topic
Computational Geometry and Mesh Generation
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

Angle‐Based Metric Adaptation for Quadrangulation

Hujun Bao, Shuang Wu, Jin Huang, Yijun Xu
2 links
Computer Graphics Forum
Computational Geometry and Mesh Generation
article

Angle‐Based Metric Adaptation for Quadrangulation

Hujun Bao, Shuang Wu, Jin Huang, Yijun Xu
article en

Abstract

Abstract We present an angle‐based metric optimization method for feature‐aware quadrangulation. Unlike existing methods that optimize symmetric positive definite tensors directly, our approach uses triangle angles as the primary optimization variables. This choice has two immediate advantages. First, the constraints for local flatness (a necessary condition for local integrability), sharp features, and corners can be formulated linearly. Second, the positive orientation of the frame (a necessary condition for local injectivity) can be reduced to a simple box constraint on the angles. Moreover, the formulation naturally supports metric customization tasks, including sizing control, conformality, isometric regularization, and singularity specification. The final optimization problem consists of mostly convex terms and can be solved robustly and efficiently. Experiments on CAD models demonstrate improved frame‐field integrability and greater parameterization robustness compared with existing approaches.

Computer Graphics Forum
Zhejiang University (CN)
National Natural Science Foundation of China
Computational Geometry and Mesh Generation
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon