A simple linear algorithm for computing rectilinear 3-centers
DOI10.1016/J.COMGEO.2004.12.002zbMATH Open1115.68156OpenAlexW2087653366MaRDI QIDQ2486079FDOQ2486079
Authors: Yanyan Li 
Publication date: 5 August 2005
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2004.12.002
Recommendations
- A linear-time algorithm for the geodesic center of a simple polygon
- scientific article; zbMATH DE number 6789192
- Approximation algorithms for orthogonal line centers
- Approximation algorithms for orthogonal line centers
- Computing a centerpoint of a finite planar set of points in linear time
- A near-linear algorithm for the planar segment-center problem
- scientific article; zbMATH DE number 1003238
- An optimal algorithm for the rectilinear link center of a rectilinear polygon
- scientific article; zbMATH DE number 177553
- A near-linear algorithm for the planar 2-center problem
Combinatorial optimization (90C27) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational aspects related to convexity (52B55) Discrete location and assignment (90B80)
Cites Work
- The Weighted Euclidean 1-Center Problem
- Linear Programming in Linear Time When the Dimension Is Fixed
- The Capacitated K-Center Problem
- A near-linear algorithm for the planar 2-center problem
- A subexponential bound for linear programming
- Generalized Selection and Ranking: Sorted Matrices
- On the rectangularp-center problem
- Title not available (Why is that?)
- Exact and approximation algorithms for clustering
- On the Complexity of Some Common Geometric Location Problems
- Finding kth paths and p-centers by generating and searching good data structures
- An optimal approximation algorithm for the rectilinear m-center problem
- The computational geometry algorithms library CGAL
- On piercing sets of axis-parallel rectangles and rings
- Time bounds for selection
- More planar two-center algorithms
- The discrete 2-center problem
- An O(nlogn) randomizing algorithm for the weighted euclidean 1-center problem
- On a Multidimensional Search Technique and Its Application to the Euclidean One-Centre Problem
- Title not available (Why is that?)
- The 2-center problem with obstacles
- Discrete rectilinear 2-center problems
- On weighted rectilinear 2-center and 3-center problems
- Linear time algorithms for the weighted tailored 2-partition problem and the weighted 2-center problem under \(l_ \infty\)-distance
- Title not available (Why is that?)
- 3-PIERCING OF d-DIMENSIONAL BOXES AND HOMOTHETIC TRIANGLES
Cited In (10)
- New Algorithms for k-Center and Extensions
- New algorithms for \(k\)-center and extensions
- Linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares
- An optimal approximation algorithm for the rectilinear m-center problem
- Computing the rectilinear center of uncertain points in the plane
- Rectilinear covering for imprecise input points (extended abstract)
- Efficient algorithms for computing one or two discrete centers hitting a set of line segments
- Title not available (Why is that?)
- Computing the line-constrained \(k\)-center in the plane for small \(k\)
- The \(p\)-center problem under locational uncertainty of demand points
Uses Software
This page was built for publication: A simple linear algorithm for computing rectilinear 3-centers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2486079)
