Path planning with divergence-based distance functions

DOI10.1016/J.CAGD.2018.09.002zbMath1505.65119arXiv1708.02845OpenAlexW2964272817WikidataQ129271681 ScholiaQ129271681MaRDI QIDQ668992

Craig Gotsman, Renjie Chen, Kai Hormann

Publication date: 20 March 2019

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

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

zbMATH Keywords

divergencepath planningdistance functionpotential function

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items (1)

A spectral approach to the shortest path problem

Uses Software

• Triangle

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• A survey of motion planning algorithms from the perspective of autonomous UAV guidance
• Robotic motion using harmonic functions and finite elements
• The extremal length of a network
• Diffusion maps
• Harmonic Function Theory
• Ricci Flow for Shape Analysis and Surface Registration
• The applications of harmonic functions to robotics
• Computing Discrete Minimal Surfaces and Their Conjugates
• Diffusion processes in a small time interval
• On Information and Sufficiency

This page was built for publication: Path planning with divergence-based distance functions