Covering point sets with two disjoint disks or squares
From MaRDI portal
Publication:929745
DOI10.1016/j.comgeo.2007.10.001zbMath1143.65015OpenAlexW2123576412MaRDI QIDQ929745
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
Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15) Combinatorial aspects of packing and covering (05B40)
Related Items (11)
Optimizing some constructions with bars: new geometric knapsack problems ⋮ Covering many or few points with unit disks ⋮ Linear Time Approximation Schemes for Geometric Maximum Coverage ⋮ Optimizing Squares Covering a Set of Points ⋮ Variations of largest rectangle recognition amidst a bichromatic point set ⋮ Spherical coverage verification ⋮ Covering point sets with two disjoint disks or squares ⋮ Near-linear time approximation schemes for geometric maximum coverage ⋮ Optimizing squares covering a set of points ⋮ Placing Two Axis-Parallel Squares to Maximize the Number of Enclosed Points ⋮ The most points connected-covering problem with two disks
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
This page was built for publication: Covering point sets with two disjoint disks or squares
