Discrete geodesic graph (DGG) for computing geodesic distances on polyhedral surfaces

DOI10.1016/J.CAGD.2017.03.010MaRDI QIDQ2357709zbMATH OpenOpenAlexFDO

Authors Zheng Fang, Jiajun Wu, Ying He, Xiao-Ning Wang, Shiqing Xin

Publication date 14 June 2017

Published in Computer Aided Geometric Design (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/10220/44328

zbMATH Keywords

discrete geodesic graphgeodesic distancesmanifold triangle meshnumerical examplespolyhedral surfacessaddle vertex graph

Mathematics Subject Classification ID

Geodesics in global differential geometry (53C22) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Recommendations

• The Discrete Geodesic Problem
• Computing geodesic paths on manifolds
• Approximating geodesic distances on 2-manifolds in image R^3
• Geodesic methods in computer vision and graphics
• Efficient computation of geodesic shortest paths

Cites work

• A fast iterative method for solving the eikonal equation on triangulated surfaces
• A fast marching level set method for monotonically advancing fronts.
• A note on two problems in connexion with graphs
• An efficient solution to the eikonal equation on parametric manifolds
• An optimal-time algorithm for shortest paths on a convex polytope in three dimensions
• An optimal-time algorithm for shortest paths on realistic polyhedra
• An ε — Approximation algorithm for weighted shortest paths on polyhedral surfaces
• Approximating shortest paths on a convex polytope in three dimensions
• Approximating shortest paths on a nonconvex polyhedron
• Computing geodesic paths on manifolds
• Diffusion processes in a small time interval
• Earth mover's distances on discrete surfaces
• Efficient algorithms for globally optimal trajectories
• Fast computation of weighted distance functions and geodesics on implicit hyper-surfaces
• Fast methods for the Eikonal and related Hamilton– Jacobi equations on unstructured meshes
• scientific article; zbMATH DE number 1239298 (Why is no real title available?)
• scientific article; zbMATH DE number 910902 (Why is no real title available?)
• Parallel Chen-Han (PCH) algorithm for discrete geodesics
• The Discrete Geodesic Problem

Cited in

(3)

• Connecting pairwise geodesic spheres by depth: DCOPS
• Parallel Chen-Han (PCH) algorithm for discrete geodesics
• Geodesic distance approximation using a surface finite element method for the p-Laplacian

This page was built for publication: Discrete geodesic graph (DGG) for computing geodesic distances on polyhedral surfaces

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2357709)