The polygon burning problem
From MaRDI portal
Publication:2154090
DOI10.1007/978-3-030-96731-4_11OpenAlexW3214090100MaRDI QIDQ2154090
Publication date: 13 July 2022
Full work available at URL: https://arxiv.org/abs/2111.09054
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computing the geodesic center of a simple polygon
- A linear-time algorithm for the geodesic center of a simple polygon
- Clustering to minimize the maximum intercluster distance
- The geodesic 2-center problem in a simple polygon
- Optimal shortest path queries in a simple polygon
- An approximation algorithm for \(k\)-center problem on a convex polygon
- Shortest Path Queries in Polygonal Domains
- A Best Possible Heuristic for the k-Center Problem
- An Algorithmic Approach to Network Location Problems. I: Thep-Centers
- On the geodesic centers of polygonal domains
- Constrained Geodesic Centers of a Simple Polygon
This page was built for publication: The polygon burning problem
