Convex Quadratic Programming for Computing Geodesic Distances on Triangle Meshes
Querying the geodesic distance field on a given smooth surface is a fundamental research pursuit in computer graphics. Both accuracy and smoothness serve as common indicators for evaluating geodesic algorithms. In this study, we argue that ensuring that the norm of the triangle-wise estimated gradie...
| Główni autorzy: | , , , , |
|---|---|
| Format: | Artykuł |
| Język: | English |
| Wydane: |
MDPI AG
2024-03-01
|
| Seria: | Mathematics |
| Hasła przedmiotowe: | |
| Dostęp online: | https://www.mdpi.com/2227-7390/12/7/993 |