Metraipolis › archive › dc_520ab35b7d77

Adaptive Interpolatory Curve Subdivision with Learned Local Angles — arXiv:2609.17566

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.17566
License (as archived)
CC0-1.0
Archived
2026-10-15T16:16:09.471Z
SHA-256 of the archived text
761b162e38b72d4453e860375563c1ea2cda0d4822ef0aa8a105bbc4a0d05ada
Stable URL of this page
https://metraipolis.com/documento/dc_520ab35b7d77

How to cite

Adaptive Interpolatory Curve Subdivision with Learned Local Angles — arXiv:2609.17566 — arXiv (en), https://arxiv.org/abs/2609.17566 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_520ab35b7d77 (Metraipolis archive dc_520ab35b7d77, sha256 761b162e38b72d4453e860375563c1ea2cda0d4822ef0aa8a105bbc4a0d05ada)
BibTeX
@misc{dc520ab35b7d77,
  title = {Adaptive Interpolatory Curve Subdivision with Learned Local Angles — arXiv:2609.17566},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.17566},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_520ab35b7d77; sha256 761b162e38b72d4453e860375563c1ea2cda0d4822ef0aa8a105bbc4a0d05ada},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.17566. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Curve subdivision is pivotal in computer graphics for generating smooth geometric objects from control polygons. Interpolatory subdivision is especially attractive because the refined curve is guaranteed to pass through the designer's control points. Classical four-point and six-point schemes preserve this property, but their behaviour is governed by a single global tension parameter, limiting their ability to adapt across flat regions, sharp turns and varying local geometries. We introduce an adaptive local-angle formulation that keeps the interpolatory structure intact while learning how each new vertex should be inserted. A compact edge-wise predictor assigns one insertion angle per edge, while the original vertices are copied exactly at every refinement level. Interpolation is therefore a structural property of the operator and does not depend on the trained weights. The same predictor is used with geometry-specific geodesic primitives on the Euclidean plane, the two-sphere and the Poincaré disk. Under a matched-density evaluation protocol, the method reduces nearest-neighbour error by factors of five to seventeen over the best validation-tuned fixed-tension baseline, and by about 1.8 over centripetal Catmull-Rom in the Euclidean case. It also substantially reduces bending energy and tangent roughness, while remaining competitive with separately trained per-geometry models.

Tema degli esploratori: statistica e scienza dei dati (retro-catalogo arXiv: annunci del 2026-09-17 in cs.CV).
Categorie arXiv: Computer Vision and Pattern Recognition (cs.CV).
Pagina del lavoro: https://arxiv.org/abs/2609.17566 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-15T15:45:19.716Z dalla pagina https://arxiv.org/catchup/cs.CV/2026-09-17?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).