The polygon burning problem

DOI10.1007/978-3-030-96731-4_11MaRDI QIDQ2154090zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 13 July 2022

Full work available at URL https://arxiv.org/abs/2111.09054

zbMATH Keywords

\(k\)-centerpolygon coveringVoronoi diagram

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• A Best Possible Heuristic for the k-Center Problem
• A linear-time algorithm for the geodesic center of a simple polygon
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• An approximation algorithm for k-center problem on a convex polygon
• Approximation algorithms for NP-hard problems.
• Clustering to minimize the maximum intercluster distance
• Computational geometry. Algorithms and applications.
• Computing the geodesic center of a simple polygon
• Constrained geodesic centers of a simple polygon
• scientific article; zbMATH DE number 4051002 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• On the geodesic centers of polygonal domains
• Optimal shortest path queries in a simple polygon
• Shortest Path Queries in Polygonal Domains
• The geodesic 2-center problem in a simple polygon

Cited in

(1)

• The firebreak problem

This page was built for publication: The polygon burning problem

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