Approximating the discrete center line segment in linear time

DOI10.1007/978-3-031-38906-1_44MaRDI QIDQ6139050zbMATH OpenOpenAlexFDO

Authors Joachim Gudmundsson, Yuan Sha

Publication date 16 January 2024

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-031-38906-1_44

Mathematics Subject Classification ID

Data structures (68P05) Algorithms in computer science (68Wxx)

Cites work

• APPROXIMATING THE DIAMETER, WIDTH, SMALLEST ENCLOSING CYLINDER, AND MINIMUM-WIDTH ANNULUS
• Approximation algorithms for convex hulls
• Farthest-point queries with geometric and combinatorial constraints
• Finding tailored partitions
• On the Complexity of Some Common Geometric Location Problems
• Optimal packing and covering in the plane are NP-complete
• The discrete 2-center problem

This page was built for publication: Approximating the discrete center line segment in linear time

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