On optimal disc covers and a new characterization of the Steiner center (original) (raw)
Related papers
Packing and Covering with Centrally Symmetric Convex Disks
Discrete & Computational Geometry, 2014
Minimum-cost coverage of point sets by disks
Proceedings of the …, 2006
Optimal Cover of Points by Disks in a Simple Polygon
SIAM Journal on Computing, 2011
An Optimal Algorithm for the Minimum Disc Cover Problem
Algorithmica, 2007
On the geometry of the smallest circle enclosing a finite set of points
Journal of the Franklin Institute, 2007
The Set of Packing and Covering Densities of Convex Disks
Discrete & Computational Geometry, 2013
On covering of any point configuration by disjoint unit disks
2011
Covering the plane with copies of a convex disk
Discrete & Computational Geometry, 1998
Covering point sets with two disjoint disks or squares
Computational Geometry, 2008
Worst-Case Optimal Covering of Rectangles by Disks
2020
Covering and piercing disks with two centers
Computational Geometry, 2013
On the Covering Densities of Quarter-Convex Disks
Discrete & Computational Geometry, 2015
The Most Points Connected-Covering Problem with Two Disks
Minimum Weight Convex Steiner Partitions
Algorithmica, 2009
Covering Convex Polygons by Two Congruent Disks
Lecture Notes in Computer Science, 2021
The Steiner Problem on Narrow and Wide Cones
2010
Covering moving points with anchored disks
2012
Assigning weights to minimize the covering radius in the plane
Computational Geometry
A dual algorithm for the minimum covering ball problem in
Operations Research Letters, 2009
Planar Point Sets with Large Minimum Convex Partitions
2006
Information Processing Letters, 2008
A note on the Covering Steiner Problem
Finding k Points with Minimum Diameter and Related Problems
Journal of Algorithms, 1991
A Generalization of the Convex Kakeya Problem
Algorithmica, 2013
Optimal Geometric Disks Covering using Tessellable Regular Polygons
Journal of Mathematics Research, 2016
The visible perimeter of an arrangement of disks
Computational Geometry, 2014
Capacitated Covering Problems in Geometric Spaces
Discrete and Computational Geometry, 2019
Circle packings into convex domains of the Euclidean and hyperbolic plane and the sphere
Geometriae Dedicata, 1986
On the Lattice Packings and Coverings of the Plane with Convex Quadrilaterals
arXiv (Cornell University), 2014
Optimal Placement of Convex Polygons to Maximize Point Containment
1996