A fast algorithm for the alpha-connected two-center decision problem
From MaRDI portal
Publication:1007526
DOI10.1016/S0020-0190(02)00402-7zbMath1173.68720MaRDI QIDQ1007526
Po-Hsueh Huang, Chuan Yi Tang, Yin Te Tsai
Publication date: 23 March 2009
Published in: Information Processing Letters (Search for Journal in Brave)
computational geometry; \(k\)-center problem; alpha-connected two-center decision problem; center-hull; two-center decision problem
68W05: Nonnumerical algorithms
68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
Related Items
The 1-Center and 1-Highway Problem, The 1-\textsc{Center} and 1-\textsc{Highway} problem revisited, The most points connected-covering problem with two disks, The discrete and mixed minimax 2-center problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A faster algorithm for the two-center decision problem
- Maintenance of configurations in the plane
- Randomized incremental construction of Delaunay and Voronoi diagrams
- The slab dividing approach to solve the Euclidean \(P\)-center problem
- A sweepline algorithm to solve the two-center problem
- More planar two-center algorithms
- Optimal Algorithms for the Intersection and the Minimum Distance Problems Between Planar Polygons
- Finding tailored partitions
- On the shape of a set of points in the plane
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
- Applying Parallel Computation Algorithms in the Design of Serial Algorithms
- Dynamic Three-Dimensional Linear Programming