scientific article; zbMATH DE number 7650244

DOI10.4230/LIPICS.ISAAC.2019.11MaRDI QIDQ5875571zbMATH OpenFDO

Authors Rajasekhar Inkulu, Sanjiv Kapoor

Publication date 3 February 2023

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

zbMATH Keywords

approximation algorithmscomputational geometrygeometric shortest paths

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(11)

• Efficiently approximating polygonal paths in three and higher dimensions
• Approximate Shortest Paths in Polygons with Violations
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
• scientific article; zbMATH DE number 7151640 (Why is no real title available?)
• Shortest Path in a Polygon using Sublinear Space.
• Euclidean TSP in narrow strips
• Routing among convex polygonal obstacles in the plane
• A divide-and-conquer based preprocessing for routing in a simple polygon
• Routing among convex polygonal obstacles in the plane using a simplified domain
• Area-preserving approximations of polygonal paths
• Distance-preserving approximations of polygonal paths

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 Q5875571)