Approximation algorithms for geometrical distance problems that are not solvable exactly

MaRDI QIDQ3191958zbMATH OpenFDO

Authors Christian Scheffer

Publication date 26 September 2014

zbMATH Keywords

algorithmscomputational geometryEuclidean distanceFréchet distancegeodesic distancesgeometrical distance functionsmedial axis approximationshortest path lengths computations

Mathematics Subject Classification ID

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

Recommendations

• Fréchet Distance for Curves, Revisited
• scientific article; zbMATH DE number 176499
• Approximating the integral Fréchet distance
• Fréchet distance problems in weighted regions
• Fréchet distance problems in weighted regions

Cited in

(7)

• A geometric buildup algorithm for the solution of the distance geometry problem using least-squares approximation
• Not all insertion methods yield constant approximate tours in the Euclidean plane
• ALGORITHMS FOR DISTANCE PROBLEMS IN PLANAR COMPLEXES OF GLOBAL NONPOSITIVE CURVATURE
• Approximating geodesic distances on 2-manifolds in image R^3
• scientific article; zbMATH DE number 2081090 (Why is no real title available?)
• New methods for the distance geometry problem
• scientific article; zbMATH DE number 7053310 (Why is no real title available?)

This page was built for publication: Approximation algorithms for geometrical distance problems that are not solvable exactly

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