On a circle placement problem
From MaRDI portal
Publication:1062430
DOI10.1007/BF02238188zbMath0572.65051MaRDI QIDQ1062430
Publication date: 1986
Published in: Computing (Search for Journal in Brave)
Related Items
COMPUTING A DOUBLE-RAY CENTER FOR A PLANAR POINT SET, FINDING PLANAR REGIONS IN A TERRAIN – IN PRACTICE AND WITH A GUARANTEE, A faster algorithm for the two-center decision problem, On \(k\)-sets in arrangements of curves and surfaces, Arrangements of curves in the plane --- topology, combinatorics, and algorithms, Optimal placement of convex polygons to maximize point containment, Polynomial algorithms for parametric minquantile and maxcovering planar location problems with locational constraints, Iterated nearest neighbors and finding minimal polytopes, Computing large planar regions in terrains, with an application to fracture surfaces, A unified algorithm for finding maximum and minimum object enclosing rectangles and cuboids, Selecting distances in the plane