Chapter

Computing and Combinatorics

Volume 1858 of the series Lecture Notes in Computer Science pp 54-63

Date:

On Local Transformation of Polygons with Visibility Properties

  • Carmen HernandoAffiliated withDepartament de Matemàtica Aplicada I, Universitat Politècnica de Catalunya(UPC)
  • , Michael E. HouleAffiliated withBasser Dept. of Computer Science, The University of Sydney
  • , Ferran HurtadoAffiliated withDepartament de Matemàtica Aplicada II, Universitat Politècnica de Catalunya(UPC)

* Final gross prices may vary according to local VAT.

Get Access

Abstract

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.