How to cover a point set with a \(V\)-shape of minimum width
From MaRDI portal
Publication:1931276
DOI10.1016/j.comgeo.2012.09.006zbMath1267.65023arXiv1108.2063MaRDI QIDQ1931276
Publication date: 25 January 2013
Published in: Lecture Notes in Computer Science, Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1108.2063
approximation algorithm; fitting; geometric optimization; curve reconstruction; computational metrology
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
65D18: Numerical aspects of computer graphics, image analysis, and computational geometry
68W25: Approximation algorithms