Abstract
Polygon cover problems arise in computational geometry and in a number of applied areas, such as material layout, layered manufacturing, radiation therapy and radiosurgery, etc. In this paper, we study three optimal polygon cover problems: monotone polygon cover with obstacles, star-shaped polygon cover with obstacles, and rectangular cover. Based on useful geometric observations, we develop efficient algorithms for solving these problems. Either our algorithms improve the quality of the previously best known solutions for these polygon cover problems, or our complexity bounds are comparable to those of the previously best known algorithms for simpler cases of the problems.
Cite
CITATION STYLE
Chen, D. Z., Hu, X. S., & Wu, X. (2000). Optimal polygon cover problems and applications. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1969, pp. 564–576). Springer Verlag. https://doi.org/10.1007/3-540-40996-3_48
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
