More planar two-center algorithms
From MaRDI portal
Publication:1961384
DOI10.1016/S0925-7721(99)00019-XzbMath0948.68196OpenAlexW2046812523MaRDI QIDQ1961384
Publication date: 17 January 2000
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0925-7721(99)00019-x
Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (46)
The geodesic 2-center problem in a simple polygon ⋮ Improved algorithms for the bichromatic two-center problem for pairs of points ⋮ The mixed center location problem ⋮ New algorithms for \(k\)-center and extensions ⋮ The Discrete and Mixed Minimax 2-Center Problem ⋮ Computing the Rectilinear Center of Uncertain Points in the Plane ⋮ An efficient algorithm for the proximity connected two center problem ⋮ Topological stability of kinetic \(k\)-centers ⋮ COMPUTING k CENTERS OVER STREAMING DATA FOR SMALL k ⋮ Streaming with minimum space: an algorithm for covering by two congruent balls ⋮ Streaming Algorithms for Smallest Intersecting Ball of Disjoint Balls ⋮ Minimizing Maximum Unmet Demand by Transportations Between Adjacent Nodes Characterized by Supplies and Demands ⋮ Discrete and mixed two-center problems for line segments ⋮ The Mixed Center Location Problem ⋮ Efficient algorithms for computing one or two discrete centers hitting a set of line segments ⋮ The discrete and mixed minimax 2-center problems ⋮ Covering moving points with anchored disks ⋮ The two-center problem of uncertain points on a real line ⋮ The \(p\)-center problem under locational uncertainty of demand points ⋮ Efficient \(k\)-center algorithms for planar points in convex position ⋮ Some variations on constrained minimum enclosing circle problem ⋮ The 2-center problem in three dimensions ⋮ BOUNDED-VELOCITY APPROXIMATION OF MOBILE EUCLIDEAN 2-CENTRES ⋮ Base station placement on boundary of a convex polygon ⋮ Covering points with convex sets of minimum size ⋮ VARIATIONS OF BASE-STATION PLACEMENT PROBLEM ON THE BOUNDARY OF A CONVEX REGION ⋮ Efficient planar two-center algorithms ⋮ Linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares ⋮ A streaming algorithm for 2-center with outliers in high dimensions ⋮ A simple linear algorithm for computing rectilinear 3-centers ⋮ Modelling gateway placement in wireless networks: geometric \(k\)-centres of unit disc graphs ⋮ Bichromatic 2-center of pairs of points ⋮ Parametric search: three new applications ⋮ Covering Points with Convex Sets of Minimum Size ⋮ Minimum perimeter-sum partitions in the plane ⋮ Covering convex polygons by two congruent disks ⋮ Intersecting disks using two congruent disks ⋮ A fast algorithm for the alpha-connected two-center decision problem ⋮ Intersecting disks using two congruent disks ⋮ Computing the Line-Constrained k-center in the Plane for Small k ⋮ Computing a geodesic two-center of points in a simple polygon ⋮ An O(n log n)-Time Algorithm for the k-Center Problem in Trees ⋮ New Algorithms for k-Center and Extensions ⋮ \(L_1\) geodesic farthest neighbors in a simple polygon and related problems ⋮ Covering convex polygons by two congruent disks ⋮ On the planar two-center problem and circular hulls
This page was built for publication: More planar two-center algorithms
