The 2-Center Problem with Obstacles
From MaRDI portal
Publication:2777608
DOI10.1006/jagm.2001.1194zbMath0994.68185OpenAlexW2015795441WikidataQ57366153 ScholiaQ57366153MaRDI QIDQ2777608
Ken Goldberg, Micha Sharir, Dan Halperin
Publication date: 2 October 2002
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jagm.2001.1194
Combinatorial optimization (90C27) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (15)
New algorithms for \(k\)-center and extensions ⋮ A Scheme for Computing Minimum Covers within Simple Regions ⋮ AN ALGORITHMIC FRAMEWORK FOR SOLVING GEOMETRIC COVERING PROBLEMS — WITH APPLICATIONS ⋮ An incremental version of the \(k\)-center problem on boundary of a convex polygon ⋮ A scheme for computing minimum covers within simple regions ⋮ Minimal containment under homothetics: a simple cutting plane approach ⋮ A simple linear algorithm for computing rectilinear 3-centers ⋮ Parametric search: three new applications ⋮ An approximation algorithm for \(k\)-center problem on a convex polygon ⋮ Intersecting disks using two congruent disks ⋮ Intersecting disks using two congruent disks ⋮ Computing a geodesic two-center of points in a simple polygon ⋮ New Algorithms for k-Center and Extensions ⋮ Constrained k-Center Problem on a Convex Polygon ⋮ On the planar two-center problem and circular hulls
Uses Software
This page was built for publication: The 2-Center Problem with Obstacles
