Simple \(O(n \log^{2} n)\) algorithms for the planar 2-center problem

DOI10.1007/978-3-319-62389-4_40zbMath1434.68618OpenAlexW2724164387MaRDI QIDQ2412430

Xue-Hou Tan, Bo Jiang

Publication date: 23 October 2017

Full work available at URL: https://doi.org/10.1007/978-3-319-62389-4_40

zbMATH Keywords

convex polygonscomputational geometrysmallest enclosing circle problemplanar 2-center problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (4)

Discrete and mixed two-center problems for line segments ⋮ Efficient planar two-center algorithms ⋮ Linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares ⋮ On the planar two-center problem and circular hulls

This page was built for publication: Simple \(O(n \log^{2} n)\) algorithms for the planar 2-center problem