The 2-center problem in three dimensions

DOI10.1016/j.comgeo.2012.11.005zbMath1273.65032OpenAlexW2206965857MaRDI QIDQ1947989

Micha Sharir, Pankaj K. Agarwal, Rinat Ben-Avraham

Publication date: 29 April 2013

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2012.11.005

zbMATH Keywords

randomized optimization2-center problemcongruent balls intersection

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items (3)

Covering convex polygons by two congruent disks ⋮ Intersecting disks using two congruent disks ⋮ Covering convex polygons by two congruent disks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• New algorithms for \(k\)-center and extensions
• Clustering to minimize the maximum intercluster distance
• Cutting hyperplanes for divide-and-conquer
• A near-linear algorithm for the planar 2-center problem
• Exact and approximation algorithms for clustering
• Geometric applications of a randomized optimization technique
• Applications of random sampling in computational geometry. II
• On a class of \(O(n^ 2)\) problems in computational geometry
• A subexponential bound for linear programming
• More planar two-center algorithms
• Selecting distances in the plane
• On the complexity of some geometric problems in unbounded dimension
• Finding tailored partitions
• Approximate clustering via core-sets
• Batched dynamic solutions to decomposable searching problems
• On Linear-Time Deterministic Algorithms for Optimization Problems in Fixed Dimension
• Las Vegas algorithms for linear and integer programming when the dimension is small
• Linear programming — Randomization and abstract frameworks
• Linear Optimization Queries
• Vertical Decomposition of Shallow Levels in 3-Dimensional Arrangements and Its Applications

This page was built for publication: The 2-center problem in three dimensions