A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Estimating the Maximum Hidden Vertex Set in Polygons
2008
2008 International Conference on Computational Sciences and Its Applications
It is known that the MAXIMUM HIDDEN VERTEX SET problem on a given simple polygon is , therefore we focused on the development of approximation algorithms to tackle it. We propose four strategies to solve this problem, the first two (based on greedy constructive search) are designed specifically to solve it, and the other two are based on the general metaheuristics Simulated Annealing and Genetic Algorithms. We conclude, through experimentation, that our best approximate algorithm is the one
doi:10.1109/iccsa.2008.19
dblp:conf/iccsa/BajuelosCHM08
fatcat:nhctvvtjkreezk2focbspdiw24