Approximating minimum bending energy path in a simple corridor

DOI10.1016/J.COMGEO.2013.09.001MaRDI QIDQ390148zbMATH OpenOpenAlexFDO

Authors Jinhui Xu, Lei Xu

Publication date 22 January 2014

Published in Computational Geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.comgeo.2013.09.001

zbMATH Keywords

approximation algorithmbounded curvaturecorridorminimum bending energy path problemoptimal curve

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Review text

The authors propose a novel approach based on a mix of geometric and approximation algorithm techniques for the minimum bending energy path (MinBEP) problem. They show how to lower bound the bending energy of an optimal curve with bounded curvature, and then use this lower bound to design a \((1+\epsilon)\)-approximation algorithm for this restricted version of the MinBEP problem.

Recommendations

• Approximating minimum bending energy path in a simple corridor
• A Complete Approximation Algorithm for Shortest Bounded-Curvature Paths
• Approximation algorithms for curvature-constrained shortest paths
• scientific article; zbMATH DE number 871939
• An algorithm for computing a convex and simple path of bounded curvature in a simple polygon

Cited in

(1)

• Approximating minimum bending energy path in a simple corridor

This page was built for publication: Approximating minimum bending energy path in a simple corridor

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