Computing smooth quasi-geodesic distance field (QGDF) with quadratic programming
Computing geodesic distances on polyhedral surfaces is an important task in digital geometry processing. Speed and accuracy are two commonly-used measurements of evaluating a discrete geodesic algorithm. In applications, such as parametrization and shape analysis, a smooth distance field is often pr...
Saved in:
Main Authors: | Cao, Luming, Zhao, Junhao, Xu, Jian, Chen, Shuangmin, Liu, Guozhu, Xin, Shiqing, Zhou, Yuanfeng, He, Ying |
---|---|
Other Authors: | School of Computer Science and Engineering |
Format: | Article |
Language: | English |
Published: |
2021
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/152284 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
Lightweight preprocessing and fast query of geodesic distance via proximity graph
by: Xin, Shiqing, et al.
Published: (2019) -
Discrete geodesic graph (DGG) for computing geodesic distances on polyhedral surfaces
by: Wang, Xiaoning, et al.
Published: (2018) -
An optimization-driven approach for computing geodesic paths on triangle meshes
by: Liu, Bangquan, et al.
Published: (2018) -
Fast wavefront propagation (FWP) for computing exact geodesic distances on meshes
by: Xu, Chunxu, et al.
Published: (2018) -
A learned generalized geodesic distance function-based approach for node feature augmentation on graphs
by: AZAD, Amitoz, et al.
Published: (2024)