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.

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)