Discrete and mixed two-center problems for line segments

DOI10.1016/j.ipl.2023.106451OpenAlexW4387614389MaRDI QIDQ6121433

Sukanya Maji, Sanjib Sadhu

Publication date: 26 March 2024

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2023.106451

zbMATH Keywords

computational geometryfarthest point Voronoi diagramstabbingdiscrete two-center problemmixed two-center problem

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Minimum enclosing circle of a set of fixed points and a mobile point
• A faster algorithm for the two-center decision problem
• Farthest line segment Voronoi diagrams
• Stabbing line segments
• The discrete 2-center problem
• The mixed center location problem
• Linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares
• Stabbing circles for sets of segments in the plane
• Optimizing squares covering a set of points
• More planar two-center algorithms
• Discrete rectilinear 2-center problems
• Corrigendum to: ``Linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares
• Simple \(O(n \log^{2} n)\) algorithms for the planar 2-center problem
• Efficient algorithms for computing one or two discrete centers hitting a set of line segments
• COVERING A POINT SET BY TWO DISJOINT RECTANGLES
• Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
• On the rectangularp-center problem