L₁ geodesic farthest neighbors in a simple polygon and related problems
From MaRDI portal
Publication:2334499
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
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
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- Title not available (Why is that?)
- On the rectangularp-center problem
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
- The furthest-site geodesic Voronoi diagram
- Optimal shortest path queries in a simple polygon
- Matrix Searching with the Shortest-Path Metric
- More planar two-center algorithms
- Computing minimum length paths of a given homotopy class
- Computing the \(L_1\) geodesic diameter and center of a simple polygon in linear time
- The geodesic 2-center problem in a simple polygon
- Computing a geodesic two-center of points in a simple polygon
- A linear-time algorithm for the geodesic center of a simple polygon
- The farthest-point geodesic Voronoi diagram of points on the boundary of a simple polygon
- Title not available (Why is that?)
Cited In (5)
- Covering convex polygons by two congruent disks
- Covering convex polygons by two congruent disks
- Farthest neighbors and center points in the presence of rectangular obstacles
- Computing geodesic furthest neighbors in simple polygons
- \(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)
