Optimal covering and hitting of line segments by two axis-parallel squares

DOI10.1007/978-3-319-62389-4_38zbMath1434.68616OpenAlexW2727037002MaRDI QIDQ2412429

Suchismita Roy, Subhas C. Nandy, Sanjib Sadhu, Sasanka Roy

Publication date: 23 October 2017

Full work available at URL: https://doi.org/10.1007/978-3-319-62389-4_38

zbMATH Keywords

computational geometrytwo-center problemcovering line segments by squarestwo-pass algorithm

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (1)

Efficient algorithms for computing one or two discrete centers hitting a set of line segments

This page was built for publication: Optimal covering and hitting of line segments by two axis-parallel squares