Computing minimum length paths of a given homotopy class. (Extended abstract)

DOI10.1007/BFB0028273MaRDI QIDQ4037430zbMATH OpenFDO

Authors Jack Snoeyink, John Hershberger

Publication date 18 May 1993

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BFB0028273

zbMATH Keywords

convex distance functionseuclidean metricslinear-time algorithmslink metricsminimum link pathsshortest path treessimple polygons

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Computing minimum length paths of a given homotopy class
• Computing homotopic shortest paths in the plane
• scientific article; zbMATH DE number 2079391
• scientific article; zbMATH DE number 1947410
• Computing homotopic shortest paths efficiently

Cited in

(5)

• Computing minimum length paths of a given homotopy class
• Efficient piecewise-linear function approximation using the uniform metric
• Sensitivity computations in higher order continuation methods
• Invariants for homology classes with application to optimal search and planning problem in robotics
• scientific article; zbMATH DE number 227225 (Why is no real title available?)

This page was built for publication: Computing minimum length paths of a given homotopy class. (Extended abstract)

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