A fast algorithm for the alpha-connected two-center decision problem

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)

zbMATH Keywords

computational geometry\(k\)-center problemalpha-connected two-center decision problemcenter-hulltwo-center decision problem

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (5)

An efficient algorithm for the proximity connected two center problem ⋮ The discrete and mixed minimax 2-center problems ⋮ 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

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

This page was built for publication: A fast algorithm for the alpha-connected two-center decision problem