The Coverage Problem by Aligned Disks

DOI10.1142/s0218195922410023OpenAlexW4311353849MaRDI QIDQ6173214

Shin-ichi Nakano

Publication date: 21 July 2023

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218195922410023

zbMATH Keywords

algorithmdisk coverage problem

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Efficient algorithms for the one-dimensional \(k\)-center problem
• New algorithms for facility location problems on the real line
• Improved complexity bounds for location problems on the real line
• Some variations on constrained minimum enclosing circle problem
• A note on minimum-sum coverage by aligned disks
• Polynomial time approximation schemes for base station coverage with minimum total radii
• Line-Constrained k-Median, k-Means, and k-Center Problems in the Plane
• THE ALIGNED K-CENTER PROBLEM
• On the Complexity of Some Common Geometric Location Problems
• New Results on the Complexity of p-Centre Problems
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The Coverage Problem by Aligned Disks