\(L_1\) geodesic farthest neighbors in a simple polygon and related problems

DOI10.1007/s00454-019-00110-0zbMath1466.68069OpenAlexW2951530714MaRDI QIDQ2334499

Sang Won Bae

Publication date: 7 November 2019

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00454-019-00110-0

zbMATH Keywords

centerdiameterradiussimple polygontwo-centerfarthest neighbor\(L_1\) geodesic distance

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (2)

Covering convex polygons by two congruent disks ⋮ Covering convex polygons by two congruent disks

Cites Work

• Unnamed Item
• Unnamed Item
• A linear-time algorithm for the geodesic center of a simple polygon
• Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
• The furthest-site geodesic Voronoi diagram
• Computing minimum length paths of a given homotopy class
• The geodesic 2-center problem in a simple polygon
• Optimal shortest path queries in a simple polygon
• More planar two-center algorithms
• Computing a geodesic two-center of points in a simple polygon
• Computing the \(L_1\) geodesic diameter and center of a simple polygon in linear time
• The farthest-point geodesic Voronoi diagram of points on the boundary of a simple polygon
• Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
• Matrix Searching with the Shortest-Path Metric
• On the rectangularp-center problem

This page was built for publication: \(L_1\) geodesic farthest neighbors in a simple polygon and related problems