Paper by Erik D. Demaine

Reference:

Greg Aloupis, Prosenjit Bose, Erik D. Demaine, Stefan Langerman, Henk Meijer, Mark Overmars, and Godfried T. Toussaint, “Computing Signed Permutations of Polygons”, International Journal of Computational Geometry and Applications, volume 21, number 1, 2011, pages 87–100.

BibTeX

@Article{PermutingPolygons_IJCGA,
  AUTHOR        = {Greg Aloupis and Prosenjit Bose and Erik D. Demaine and
                   Stefan Langerman and Henk Meijer and Mark Overmars and
                   Godfried T. Toussaint},
  TITLE         = {Computing Signed Permutations of Polygons},
  JOURNAL       = {International Journal of Computational Geometry and
                   Applications},
  journalurl    = {http://www.worldscinet.com/ijcga/ijcga.shtml},
  VOLUME        = 21,
  NUMBER        = 1,
  YEAR          = 2011,
  PAGES         = {87--100},

  doi           = {https://dx.doi.org/10.1142/S0218195911003561},
  dblp          = {https://dblp.org/rec/journals/ijcga/AloupisBDLMOT11},
  comments      = {This paper is also available from <A HREF="http://dx.doi.org/10.1142/S0218195911003561">WorldSciNet</A>.},
  replaces      = {PermutingPolygons_CCCG2002},
  papers        = {PermutingPolygons_CCCG2002},
}

Comments:

This paper is also available from WorldSciNet.

Availability:

Currently unavailable. If you are in a rush for copies, contact me.

[Google Scholar search]

Related papers:

PermutingPolygons_CCCG2002 (Computing Signed Permutations of Polygons)