Art gallery theorems and algorithms
Art gallery theorems and algorithms
Construction of three-dimensional Delaunay triangulations using local transformations
Computer Aided Geometric Design
Computing the visibility graph via pseudo-triangulations
Proceedings of the eleventh annual symposium on Computational geometry
Reverse search for enumeration
Discrete Applied Mathematics - Special volume: first international colloquium on graphs and optimization (GOI), 1992
Generating random polygons with given vertices
Computational Geometry: Theory and Applications
Geometric tree graphs of points in convex position
Discrete Applied Mathematics - Special issue on the 13th European workshop on computational geometry CG '97
Graph of triangulations of a convex polygon and tree of triangulations
Computational Geometry: Theory and Applications
Mental imagery in program design and visual programming
International Journal of Human-Computer Studies - Best of empirical studies of programmers 7
An Optimal Algorithm for Determining the Visibility of a Polygon from an Edge
IEEE Transactions on Computers
Enumerating constrained non-crossing geometric spanning trees
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
| Hi-index | 0.00 |
One strategy for the enumeration of a class of objects is local transformation, in which new objects of the class are produced by means of a small modification of a previously-visited object in the same class. When local transformation is possible, the operation can be used to generate objects of the class via random walks, and as the basis for such optimization heuristics as simulated annealing. For general simple polygons on fixed point sets, it is still not known whether the class of polygons on the set is connected via a constant-size local transformation. In this paper, we exhibit a simple local transformation for which the classes of (weakly) edge-visible and (weakly) externally visible polygons are connected. The latter class is particularly interesting as it is the most general polygon class known to be connected under local transformation.