Parallel chen-han (PCH) algorithm for discrete geodesics

DOI10.1145/2534161zbMath1288.68235arXiv1305.1293OpenAlexW1999484884MaRDI QIDQ5419165

Xiang Ying, Ying He, Shi-Qing Xin

Publication date: 5 June 2014

Published in: ACM Transactions on Graphics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1305.1293

zbMATH Keywords

parallel computationGPUdiscrete geodesicwindow propagation

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Geodesics in global differential geometry (53C22) Approximation algorithms (68W25)

Related Items (3)

Discrete geodesic graph (DGG) for computing geodesic distances on polyhedral surfaces ⋮ On different topological classes of spherical geodesic paths and circles in \(\mathbb{Z}^3\) ⋮ Craniofacial reconstruction evaluation by geodesic network

Uses Software

• CUDA
• Thrust

Cites Work

• Unnamed Item
• Unnamed Item
• Convergence of geodesics on triangulations
• The Discrete Geodesic Problem
• On Shortest Paths in Polyhedral Spaces
• Computing geodesic paths on manifolds
• A fast marching level set method for monotonically advancing fronts.
• Distance Functions and Geodesics on Submanifolds of $\R^d$ and Point Clouds
• Fast computation of weighted distance functions and geodesics on implicit hyper-surfaces

This page was built for publication: Parallel chen-han (PCH) algorithm for discrete geodesics