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