On the vertex-oriented triangle propagation (VTP) algorithm : parallelization and approximation

Computing geodesic distances on polyhedral surfaces is a fundamental problem in digital geometry processing and computer-aided design. Most of the existing exact algorithms partition mesh edges into intervals, called windows, and propagate one window at a time. The state-of-the-art, Vertex-oriented...

Full description

Saved in:
Bibliographic Details
Main Authors: Du, Jie, He, Ying, Fang, Zheng, Meng, Wenlong, Xin, Shi-Qing
Other Authors: School of Computer Science and Engineering
Format: Article
Language:English
Published: 2021
Subjects:
Online Access:https://hdl.handle.net/10356/152296
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Nanyang Technological University
Language: English