Touring Polygons: An Approximation Algorithm

DOI10.1007/978-3-642-35926-2_13zbMath1293.68297OpenAlexW133420565MaRDI QIDQ2876565

Alireza Zarei, Amirhossein Mozafari

Publication date: 19 August 2014

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-35926-2_13

zbMATH Keywords

approximation algorithmcomputational geometrytouring polygonsminimum link path

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

This page was built for publication: Touring Polygons: An Approximation Algorithm