Geodesics on point clouds

DOI10.1155/2014/860136MaRDI QIDQ1719261zbMATH OpenOpenAlexWikidataFDO

Authors Xianqiang Yang

Publication date 8 February 2019

Published in Mathematical Problems in Engineering (Search for Journal in Brave)

Copyright license Creative Commons Attribution 3.0 Unported

Full work available at URL https://doi.org/10.1155/2014/860136

Mathematics Subject Classification ID

Geodesics in global differential geometry (53C22) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Geodesy, mapping problems (86A30)

Review text

Summary: We present a novel framework to compute geodesics on implicit surfaces and point clouds. Our framework consists of three parts, particle based approximate geodesics on implicit surfaces, Cartesian grid based approximate geodesics on point clouds, and geodesic correction. The first two parts can effectively generate approximate geodesics on implicit surfaces and point clouds, respectively. By introducing the geodesic curvature flow, the third part produces smooth and accurate geodesic solutions. Differing from most of the existing methods, our algorithms can converge to a given tolerance. The presented computational framework is suitable for arbitrary implicit hypersurfaces or point clouds with high genus or high curvature.

Recommendations

• Distance Functions and Geodesics on Submanifolds of \R^d and Point Clouds
• Computing with Point Cloud Data
• Fast geodesics computation with the phase flow method
• Normal approximations of geodesics on smooth triangulated surfaces
• Approximating geodesic distances on 2-manifolds in image R^3

Cites work

• An optimal algorithm for approximate nearest neighbor searching fixed dimensions
• Fast computation of weighted distance functions and geodesics on implicit hyper-surfaces
• Geodesic active contours
• scientific article; zbMATH DE number 1302349 (Why is no real title available?)
• scientific article; zbMATH DE number 1305036 (Why is no real title available?)
• scientific article; zbMATH DE number 236854 (Why is no real title available?)
• Introduction to algorithms
• SHORTEST PATHS ON A POLYHEDRON, Part I: COMPUTING SHORTEST PATHS
• The Discrete Geodesic Problem

Cited in

(11)

• PCBC: quasiconformality of point cloud mappings
• The time scale calculus approach to the geodesic problem in 3D dynamic data sets
• Path planning and replanning for mobile robot navigation on 3D terrain: an approach based on geodesic
• Computing fundamental groups from point clouds
• Normal approximations of geodesics on smooth triangulated surfaces
• Geodesic computation on implicit surfaces
• Computing with Point Cloud Data
• A unified framework for computing geodesic distances on nonorientable manifold polyhedral surfaces
• Distance Functions and Geodesics on Submanifolds of \R^d and Point Clouds
• Parallel Chen-Han (PCH) algorithm for discrete geodesics
• Fast computation of weighted distance functions and geodesics on implicit hyper-surfaces

This page was built for publication: Geodesics on point clouds

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