The 2-center problem with obstacles

DOI10.1006/JAGM.2001.1194MaRDI QIDQ2777608zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Ken Goldberg, Dan Halperin, Micha Sharir

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

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• The discrete 2-center problem
• Covering and piercing disks with two centers
• Efficient planar two-center algorithms
• More planar two-center algorithms
• Covering and piercing disks with two centers

Cited in

(18)

• Parametric search: three new applications
• Minimal containment under homothetics: a simple cutting plane approach
• New algorithms for \(k\)-center and extensions
• New Algorithms for k-Center and Extensions
• An algorithmic framework for solving geometric covering problems -- with applications
• Constrained \(k\)-center problem on a convex polygon
• Optimal algorithm for the planar two-center problem
• An incremental version of the \(k\)-center problem on boundary of a convex polygon
• A simple linear algorithm for computing rectilinear 3-centers
• Covering and piercing disks with two centers
• Intersecting disks using two congruent disks
• Intersecting disks using two congruent disks
• Optimal algorithm for the planar two-center problem
• A Scheme for Computing Minimum Covers within Simple Regions
• An approximation algorithm for k-center problem on a convex polygon
• On the planar two-center problem and circular hulls
• Improved approximation bounds for the minimum constraint removal problem
• A scheme for computing minimum covers within simple regions

Describes a project that uses

Uses Software

• AdeptRAPID

This page was built for publication: The 2-center problem with obstacles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2777608)