The discrete 2-center problem

DOI10.1007/PL00009387MaRDI QIDQ1272957zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Emo Welzl, Pankaj K. Agarwal, Micha Sharir

Publication date 19 April 1999

Published in Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/pl00009387

zbMATH Keywords

discrete 2-center

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• A near-linear algorithm for the planar 2-center problem
• More planar two-center algorithms
• Efficient planar two-center algorithms
• A faster algorithm for the two-center decision problem

Cited in

(37)

• The most points connected-covering problem with two disks
• A polynomial-time optimization algorithm for a rectilinear partitioning problem with applications in VLSI design automation.
• Parametric search: three new applications
• The 2-center problem in three dimensions
• A faster algorithm for the two-center decision problem
• A fast deterministic smallest enclosing disk approximation algorithm
• A (\(1+{\varepsilon}\))-approximation algorithm for 2-line-center
• Efficient planar two-center algorithms
• Approximating the discrete center line segment in linear time
• A FAST IMPLEMENTATION OF THE ISODATA CLUSTERING ALGORITHM
• Facility location and the geometric minimum-diameter spanning tree.
• scientific article; zbMATH DE number 1696646 (Why is no real title available?)
• The mixed center location problem
• Base station placement on boundary of a convex polygon
• On clustering to minimize the sum of radii
• A geometric proof of the combinatorial bounds for the number of optimal solutions for the Euclidean 2-center problem
• scientific article; zbMATH DE number 970602 (Why is no real title available?)
• Syzygies in the two center problem
• Minimum-sum dipolar spanning tree in \(\mathbb R^3\)
• A sweepline algorithm to solve the two-center problem
• Time-dependent green Weber problem
• The Mixed Center Location Problem
• Efficient algorithms for computing one or two discrete centers hitting a set of line segments
• A simple linear algorithm for computing rectilinear 3-centers
• The 2-center problem with obstacles
• Computing a Segment Center for a Planar Point Set
• An Efficient Algorithm for 2D Euclidean 2-Center with Outliers
• Covering and piercing disks with two centers
• The 2-center problem in three dimensions
• The discrete and mixed minimax 2-center problem
• COMPUTING A DOUBLE-RAY CENTER FOR A PLANAR POINT SET
• scientific article; zbMATH DE number 1588326 (Why is no real title available?)
• On the planar two-center problem and circular hulls
• Computing the line-constrained \(k\)-center in the plane for small \(k\)
• Discrete and mixed two-center problems for line segments
• A fast algorithm for the alpha-connected two-center decision problem
• The discrete and mixed minimax 2-center problems

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

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