Discrete and mixed two-center problems for line segments

DOI10.1016/J.IPL.2023.106451MaRDI QIDQ6121433zbMATH OpenOpenAlexFDO

Authors 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 geometrydiscrete two-center problemfarthest point Voronoi diagrammixed two-center problemstabbing

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A faster algorithm for the two-center decision problem
• Corrigendum to: ``Linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares
• Covering a point set by two disjoint rectangles
• Discrete rectilinear 2-center problems
• Efficient algorithms for computing one or two discrete centers hitting a set of line segments
• Farthest line segment Voronoi diagrams
• scientific article; zbMATH DE number 1696646 (Why is no real title available?)
• scientific article; zbMATH DE number 6472586 (Why is no real title available?)
• Linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares
• Linear-Time Algorithms for Linear Programming in R^3 and Related Problems
• Minimum enclosing circle of a set of fixed points and a mobile point
• More planar two-center algorithms
• On the rectangularp-center problem
• Optimizing squares covering a set of points
• Simple \(O(n \log^{2} n)\) algorithms for the planar 2-center problem
• Stabbing circles for sets of segments in the plane
• Stabbing line segments
• The discrete 2-center problem
• The mixed center location problem

This page was built for publication: Discrete and mixed two-center problems for line segments

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