A Constructive Algorithm for Disk Conformal Parameterizations

Surface parameterization is a fundamental issue widely studied and applied in various image and geometry processing tasks, such as surface registration, remeshing, and texture mapping. In this paper, we propose an efficient constructive algorithm for the computation of disk conformal parameterizatio...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Journal of scientific computing Ročník 92; číslo 2; s. 40
Hlavní autoři: Liao, Wei-Hung, Yueh, Mei-Heng
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York Springer US 01.08.2022
Springer Nature B.V
Témata:
Algorithms
Computational Mathematics and Numerical Analysis
Mapping
Mathematical and Computational Engineering
Mathematical and Computational Physics
Mathematics
Mathematics and Statistics
Methods
Original Research
Parameterization
Spherical harmonics
Surface layers
Texture mapping
Theoretical
Conformal parameterization
Geodesic algorithm
Laplace–Beltrami operator
Triangular mesh
52C26
15B48
Double covering
68U05
65F05
65D18
ISSN:0885-7474, 1573-7691
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Surface parameterization is a fundamental issue widely studied and applied in various image and geometry processing tasks, such as surface registration, remeshing, and texture mapping. In this paper, we propose an efficient constructive algorithm for the computation of disk conformal parameterizations of simply connected open surfaces by combining the spherical harmonic mapping of the doubly covered surface and the geodesic algorithm. In addition, we prove the number of unknowns involved in the computation of the spherical harmonic mapping of the doubly covered surface can be reduced by roughly half. Numerical experiments indicate that the efficiency of the proposed algorithm is improved while the accuracy remains similar or even slightly better compared to the other state-of-the-art algorithms.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0885-7474
1573-7691
DOI:10.1007/s10915-022-01898-5