Covering a Set of Points with a Minimum Number of Lines
From MaRDI portal
Publication:3434538
DOI10.1007/11758471_4zbMath1183.68660OpenAlexW2139246421MaRDI QIDQ3434538
Magdalene Grantson, Christos Levcopoulos
Publication date: 2 May 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11758471_4
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)
Related Items (4)
A parameterized algorithm for the hyperplane-cover problem ⋮ Improved parameterized algorithms for minimum link-length rectilinear spanning path problem ⋮ Digital Straightness, Circularity, and Their Applications to Image Analysis ⋮ Slightly Superexponential Parameterized Problems
This page was built for publication: Covering a Set of Points with a Minimum Number of Lines
