Rectilinear link diameter and radius in a rectilinear polygonal domain
From MaRDI portal
Publication:5091051
DOI10.4230/LIPIcs.ISAAC.2018.58OpenAlexW3041740069MaRDI QIDQ5091051
André van Renssen, Marcel Roeloffzen, Aleksandar Markovic, Man-Kwun Chiu, Aurélien Ooms, Yoshio Okamoto, Elena Arseneva, Matias Korman
Publication date: 21 July 2022
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2018/10006/pdf/LIPIcs-ISAAC-2018-58.pdf
Cites Work
- 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
- 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
- All-pairs shortest paths in geometric intersection graphs
- Minimum-link paths revisited
- Optimal dynamic vertical ray shooting in rectilinear planar subdivisions
- Powers of tensors and fast matrix multiplication
- An Optimal Algorithm for Euclidean Shortest Paths in the Plane
- Matrix Searching with the Shortest-Path Metric
This page was built for publication: Rectilinear link diameter and radius in a rectilinear polygonal domain
