COVERING CONVEX RECTILINEAR POLYGONS IN LINEAR TIME

DOI10.1142/S0218195991000128zbMath0735.68086OpenAlexW2140652748MaRDI QIDQ3986399

W. T. Liou, Richard Chia-Tung Lee, Chuan Yi Tang

Publication date: 27 June 1992

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218195991000128

zbMATH Keywords

optimal covering problemconvex rectilinear polygon

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (1)

Lower bounds for approximate polygon decomposition and minimum gap

This page was built for publication: COVERING CONVEX RECTILINEAR POLYGONS IN LINEAR TIME