Approximating the discrete center line segment in linear time

DOI10.1007/978-3-031-38906-1_44OpenAlexW4385367561MaRDI QIDQ6139050FDOQ6139050

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

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

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)