On a circle placement problem
From MaRDI portal
Publication:1062430
DOI10.1007/BF02238188zbMath0572.65051OpenAlexW77353308MaRDI QIDQ1062430
Publication date: 1986
Published in: Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02238188
Related Items (35)
Iterated nearest neighbors and finding minimal polytopes ⋮ Selecting distances in the plane ⋮ Covering many or few points with unit disks ⋮ A unified algorithm for finding maximum and minimum object enclosing rectangles and cuboids ⋮ Linear Time Approximation Schemes for Geometric Maximum Coverage ⋮ AN ALGORITHMIC FRAMEWORK FOR SOLVING GEOMETRIC COVERING PROBLEMS — WITH APPLICATIONS ⋮ Uniform fourth order difference scheme for a singular perturbation problem ⋮ Four Soviets walk the dog: improved bounds for computing the Fréchet distance ⋮ Location Problems with Cutoff ⋮ FINDING PLANAR REGIONS IN A TERRAIN – IN PRACTICE AND WITH A GUARANTEE ⋮ Covering point sets with two disjoint disks or squares ⋮ On \(k\)-sets in arrangements of curves and surfaces ⋮ Arrangements of curves in the plane --- topology, combinatorics, and algorithms ⋮ A greedy clustering algorithm based on interval pattern concepts and the problem of optimal box positioning ⋮ Near-linear time approximation schemes for geometric maximum coverage ⋮ Optimizing squares covering a set of points ⋮ A faster algorithm for the two-center decision problem ⋮ Computing Large Planar Regions in Terrains ⋮ A LOWER BOUND ON THE AREA OF A 3-COLOURED DISK PACKING ⋮ An improved approximation algorithm for the most points covering problem ⋮ Modelling gateway placement in wireless networks: geometric \(k\)-centres of unit disc graphs ⋮ Generalized coverage: new developments in covering location models ⋮ Enclosing weighted points with an almost-unit ball ⋮ Covering problems with polyellipsoids: a location analysis perspective ⋮ Placing Two Axis-Parallel Squares to Maximize the Number of Enclosed Points ⋮ New exact algorithms for planar maximum covering location by ellipses problems ⋮ In-place algorithms for computing a largest clique in geometric intersection graphs ⋮ Optimal placement of convex polygons to maximize point containment ⋮ Minimizing Sum of Truncated Convex Functions and Its Applications ⋮ Computing large planar regions in terrains, with an application to fracture surfaces ⋮ Polynomial algorithms for parametric minquantile and maxcovering planar location problems with locational constraints ⋮ The most points connected-covering problem with two disks ⋮ An elliptical cover problem in drone delivery network design and its solution algorithms ⋮ Experiments with unit disk cover algorithms for covering massive pointsets ⋮ COMPUTING A DOUBLE-RAY CENTER FOR A PLANAR POINT SET
Cites Work
This page was built for publication: On a circle placement problem
