L₁ geodesic farthest neighbors in a simple polygon and related problems

DOI10.1007/S00454-019-00110-0zbMATH Open1466.68069OpenAlexW2951530714MaRDI QIDQ2334499FDOQ2334499

Authors 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

diametercenterradiussimple polygontwo-center\(L_1\) geodesic distancefarthest neighbor

Mathematics Subject Classification ID

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

Recommendations

• \(L_1\) geodesic farthest neighbors in a simple polygon and related problems
• Computing geodesic furthest neighbors in simple polygons
• Computing the \(L _{1}\) geodesic diameter and center of a simple polygon in linear time
• Computing the \(L_1\) geodesic diameter and center of a polygonal domain
• Computing the \(L_1\) geodesic diameter and center of a polygonal domain

Cites work

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

Cited in

(5)

• Computing geodesic furthest neighbors in simple polygons
• Farthest neighbors and center points in the presence of rectangular obstacles
• Covering convex polygons by two congruent disks
• Covering convex polygons by two congruent disks
• \(L_1\) geodesic farthest neighbors in a simple polygon and related problems

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

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