A near-linear algorithm for the planar 2-center problem
From MaRDI portal
Publication:1364134
DOI10.1007/PL00009311zbMath0878.68131MaRDI QIDQ1364134
Publication date: 24 August 1997
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
Related Items
COMPUTING A DOUBLE-RAY CENTER FOR A PLANAR POINT SET, Base station placement on boundary of a convex polygon, A local search approximation algorithm for \(k\)-means clustering, Pose estimation and object identification using complex algebraic representations, Parametric search: three new applications, A simple linear algorithm for computing rectilinear 3-centers, OBNOXIOUS FACILITY LOCATION: COMPLETE SERVICE WITH MINIMAL HARM, A FAST IMPLEMENTATION OF THE ISODATA CLUSTERING ALGORITHM, BOUNDED-VELOCITY APPROXIMATION OF MOBILE EUCLIDEAN 2-CENTRES, VARIATIONS OF BASE-STATION PLACEMENT PROBLEM ON THE BOUNDARY OF A CONVEX REGION