Maximal distortion of geodesic diameters in polygonal domains

DOI10.1007/978-3-031-34347-6_17arXiv2304.03484OpenAlexW4379134829MaRDI QIDQ6182904

Csaba D. Tóth, Adrian Dumitrescu

Publication date: 22 December 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Discrete mathematics in relation to computer science (68Rxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The geodesic diameter of polygonal domains
• A linear-time algorithm for the geodesic center of a simple polygon
• On the approximation of shortest escape paths
• An efficient algorithm for Euclidean shortest paths among polygonal obstacles in the plane
• Computing the geodesic centers of a polygonal domain
• Optimal shortest path queries in a simple polygon
• Shortest path in a polygon using sublinear space
• Euclidean shortest paths in the presence of rectilinear barriers
• Lost in a Forest
• An Optimal Algorithm for Euclidean Shortest Paths in the Plane
• Matrix Searching with the Shortest-Path Metric
• Subquadratic Algorithms for the Diameter and the Sum of Pairwise Distances in Planar Graphs
• Fast approximation algorithms for the diameter and radius of sparse graphs
• SHORTEST PATHS AMONG OBSTACLES IN THE PLANE
• Voronoi Diagrams on Planar Graphs, and Computing the Diameter in Deterministic $\tilde{O}(n^{5/3})$ Time
• A new algorithm for Euclidean shortest paths in the plane

This page was built for publication: Maximal distortion of geodesic diameters in polygonal domains