How to cover a point set with a \(V\)-shape of minimum width

DOI10.1016/j.comgeo.2012.09.006zbMath1267.65023arXiv1108.2063OpenAlexW1937106639MaRDI QIDQ1931276

Muriel Dulieu, Boris Aronov

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

zbMATH Keywords

approximation algorithmfittinggeometric optimizationcurve reconstructioncomputational metrology

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Approximation algorithms (68W25)

Related Items (1)

The most points connected-covering problem with two disks

This page was built for publication: How to cover a point set with a \(V\)-shape of minimum width