Automata, Languages and Programming
From MaRDI portal
Publication:5716760
DOI10.1007/11523468zbMath1081.68729OpenAlexW2940595899WikidataQ56656999 ScholiaQ56656999MaRDI QIDQ5716760
Publication date: 10 January 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11523468
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)
Related Items (6)
Maximizing the guarded boundary of an Art Gallery is APX-complete ⋮ Polygon guarding with orientation ⋮ On guarding the vertices of rectilinear domains ⋮ Approximation algorithms for art gallery problems in polygons ⋮ Finding minimum hidden guard sets in polygons --- tight approximability results ⋮ The art gallery theorem for polyominoes
This page was built for publication: Automata, Languages and Programming
