See this document in CiteSeerX!

On Local Transformation of Polygons with Visibility Properties (2002)  (Make Corrections)  (4 citations)
Carmen Hernando, Michael E. Houle, Ferran Hurtado



  Home/Search   Context   Related

 
View or download:
ma2.upc.es/~hurtado/wev.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  ma2.upc.es/~hurtado/flipcorner (more)
Homepages:  F.Hurtado  

Rate this article: (best)
  Comment on this article  
(Enter summary)

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... (Update)

Cited by:   More
VC-dimension of Exterior Visibility - Isler, Kannan, Daniilidis, Valtr   (Correct)
Algorithms for Distributed and Mobile Sensing - Isler (2004)   (Correct)
Graphs of Triangulations and Perfect Matchings - Houle, Hurtado, Noy..   (Correct)

Active bibliography (related documents):   More   All
0.5:   Bier Spheres and Posets - Björner, Paffenholz, Sjöstrand.. (2004)   (Correct)
0.4:   Computing the Face Lattice of a Polytope from its.. - Kaibel, Pfetsch (2001)   (Correct)
0.3:   On the Cocircuit Graph of an Oriented Matroid - Cordovil, Fukuda, de Oliveira (2000)   (Correct)

Similar documents based on text:   More   All
0.5:   Graphs of Non-crossing Perfect Matchings - Hernando, Hurtado, Noy (2002)   (Correct)
0.4:   Implicit Convex Polygons - Gomez, Hurtado, Ramaswami.. (2000)   (Correct)
0.4:   On the Number of Triangulations Every Planar Point Set Must .. - Aichholzer, Hurtado, Noy (2001)   (Correct)

Related documents from co-citation:   More   All
3:   Almost optimal set covers in finite VC-dimension (context) - Bronnimann, Goodrich - 1994
3:   Separation and approximation of polyhedral surfaces (context) - Mitchell, Suri - 1992
3:   A tight analysis of the greedy algorithm for set cover - Slavik - 1996

BibTeX entry:   (Update)

C. Hernando, M. Houle and F. Hurtado, On Local Transformation of Polygons with Visibility Properties, Theoretical Computer Science 289 (2) (2002), 919--937. http://citeseer.ist.psu.edu/hernando02local.html   More

@inproceedings{ hernando00local,
    author = "Carmen Hernando and Michael E. Houle and Ferran Hurtado",
    title = "On Local Transformation of Polygons with Visibility Properties",
    series = "Lecture Notes in Computer Science",
    volume = "1858",
    pages = "54+",
    year = "2000",
    url = "citeseer.ist.psu.edu/hernando02local.html" }
Citations (may not include all citations):
151   Every planar map is four colorable (context) - Appel, Haken - 1976
125   Art Gallery Theorems and Algorithms (context) - O'Rourke - 1987
74   A pivoting algorithm for convex hulls and vertex enumeration.. (context) - Avis, Fukuda - 1992
54   Voronoi diagrams and Delaunay triangulations - Fortune - 1992
38   Construction of three-dimensional Delaunay triangulations us.. (context) - Joe - 1991
34   Reverse search for enumeration - Avis, Fukuda - 1996
29   An optimal algorithm for determining the visibility of a pol.. - Avis, Toussaint - 1981
15   Computing the visibility graph via pseudo-triangulations - Pocchiola, Vegter - 1995
13   Transforming triangulations (context) - Lawson - 1972
12   A new proof of the four colour theorem - Robertson, Sanders et al. - 1996
11   Incremental topological ipping works for regular triangulati.. (context) - Edelsbrunner, Shah - 1996
11   Flipping edges in triangulations - Hurtado, Noy et al. - 1999
10   Combinatorial face enumeration in convex polytopes (context) - Fukuda, Rosta - 1994
7   Graphs of triangulations of a convex polygon and tree of tri.. (context) - Hurtado, Noy - 1999
6   Geometric tree graphs of points in convex position (context) - Hernando, Hurtado et al. - 1999
6   Finding the visibility graph of a simple polygon in time pro.. (context) - Hershberger - 1989
4   Generating random polygons with given vertices - Zhu, Sundaram et al. - 1996
3   Combinatorial face enumeration in arrangements and oriented .. (context) - Fukuda, Saito et al. - 1991
2   Triangulated Manifolds with Few Vertices and Vertex-Transiti.. (context) - Lutz - 1999
1   R(4; 5) = 25 (context) - McKay, Radziszowski - 1995
1   Graphs of non-crossing matchings (context) - Hernando, Hurtado et al. - 1999
1   On local transformations of simple polygons (context) - Houle - 1996

Documents on the same site (http://www-ma2.upc.es/~hurtado/flipcorner.html):
Graphs of Non-crossing Perfect Matchings - Hernando, Hurtado, Noy (2002)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC