scientific article; zbMATH DE number 177559

MaRDI QIDQ4037430zbMATH OpenFDO

Authors Jack Snoeyink, John Hershberger

Publication date 18 May 1993

zbMATH Keywords

linear-time algorithmsconvex distance functionssimple polygonsshortest path treeseuclidean metricslink metricsminimum link paths

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
• Sensitivity computations in higher order continuation methods
• scientific article; zbMATH DE number 227225 (Why is no real title available?)
• Invariants for homology classes with application to optimal search and planning problem in robotics
• Efficient piecewise-linear function approximation using the uniform metric

This page was built for publication:

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