Art gallery theorems and algorithms
Art gallery theorems and algorithms
Recognizing visibility graphs of spiral polygons
Journal of Algorithms
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
A note on the combinatorial structure of the visibility graph in simple polygons
Theoretical Computer Science - Special issue on design and analysis of geometrical algorithms for robot motion planning and vision
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
Hierarchical decomposition of polygons with applications
Hierarchical decomposition of polygons with applications
| Hi-index | 0.00 |
Recognizing and reconstructing simple polygons from their combinatorial visibility graphs remains one of the open problems in computational geometry. Although much work has been completed on restricted versions of the problem, very little is known about the nature of the general solution. In this paper, I consider the use of a genetic algorithm (GA) as a means of solving the general form of the visibility graph reconstruction problem. The concept of a blocking vertex visibility graph is introduced; and a GA is described which makes use of this structure to construct polygons satisfying certain visibility constraints.