Covering point sets with two disjoint disks or squares

DOI10.1016/j.comgeo.2007.10.001zbMath1143.65015MaRDI QIDQ929745

Elsie Sterbin Gottlieb

Publication date: 18 June 2008

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2007.10.001

zbMATH Keywords

facility location; geometric optimization

Mathematics Subject Classification ID

65D18: Numerical aspects of computer graphics, image analysis, and computational geometry

52C15: Packing and covering in (2) dimensions (aspects of discrete geometry)

05B40: Combinatorial aspects of packing and covering

Related Items

Covering many or few points with unit disks, Covering point sets with two disjoint disks or squares

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Covering point sets with two disjoint disks or squares
• On a circle placement problem
• Applications of a semi-dynamic convex hull algorithm
• Planar maximum box problem
• On a class of \(O(n^ 2)\) problems in computational geometry
• Improved algorithms for placing undesirable facilities
• Euclidean push--pull partial covering problems
• Note—On a Modified One-Center Model
• Printer graphics for clustering
• An Expander-Based Approach to Geometric Optimization
• Covering Many or Few Points with Unit Disks
• AVOIDING CANNIBALISATION AND/OR COMPETITOR REACTION IN PLANAR SINGLE FACILITY LOCATION