On the approximation of shortest escape paths

DOI10.1016/j.comgeo.2020.101709zbMath1468.68266OpenAlexW3081701091MaRDI QIDQ827333

Elmar Langetepe, David Kübel

Publication date: 7 January 2021

Published in: Computational Geometry (Search for Journal in Brave)

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

zbMATH Keywords

approximationcompetitive analysisescape pathspiral search

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25) Inequalities and extremum problems in real or complex geometry (51M16)

Related Items (1)

Maximal distortion of geodesic diameters in polygonal domains

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Searching in the plane
• Besicovitch triangles cover unit arcs
• A question of Bellman
• Universale Rettungskurven. I. (Universal rescue curves. I)
• Problems, problems, problems
• The Shortest Planar Arc of Width 1
• Lost in a Forest
• Competitive Online Approximation of the Optimal Search Ratio
• Hyperbolic Dovetailing
• On Arcs that Cannot be Covered by an Open Equilateral Triangle of Side 1
• Minimum covers for arcs of constant length

This page was built for publication: On the approximation of shortest escape paths