Rectilinear link diameter and radius in a rectilinear polygonal domain
From MaRDI portal
Publication:827313
DOI10.1016/j.comgeo.2020.101685zbMath1477.68457arXiv1712.05538OpenAlexW2963853266MaRDI QIDQ827313
Aleksandar Markovic, Man-Kwun Chiu, André van Renssen, Matias Korman, Marcel Roeloffzen, Yoshio Okamoto, Aurélien Ooms, Elena Arseneva
Publication date: 7 January 2021
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1712.05538
Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Artificial intelligence for robotics (68T40)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The geodesic diameter of polygonal domains
- Computing the \(L_1\) geodesic diameter and center of a polygonal domain
- A linear-time algorithm for the geodesic center of a simple polygon
- \(L_ 1\) shortest paths among polygonal obstacles in the plane
- An \(O(n\log n)\) algorithm for computing the link center of a simple polygon
- An optimal algorithm for minimum-link rectilinear paths in triangulated rectilinear domains
- Computing geodesic furthest neighbors in simple polygons
- An optimal algorithm for the rectilinear link center of a rectilinear polygon
- Computing the \(L_1\) geodesic diameter and center of a simple polygon in linear time
- Minimum-link paths revisited
- Powers of tensors and fast matrix multiplication
- An Optimal Algorithm for Euclidean Shortest Paths in the Plane
- Matrix Searching with the Shortest-Path Metric
- Approximation and Fixed Parameter Subquadratic Algorithms for Radius and Diameter in Sparse Graphs
- All-pairs shortest paths in geometric intersection graphs
- Hardness of Easy Problems: Basing Hardness on Popular Conjectures such as the Strong Exponential Time Hypothesis (Invited Talk)
- Fast approximation algorithms for the diameter and radius of sparse graphs
This page was built for publication: Rectilinear link diameter and radius in a rectilinear polygonal domain
