Paper by Erik D. Demaine

Reference:

Hayley N. Iben, James F. O'Brien, and Erik D. Demaine, “Refolding Planar Polygons”, in Technical Sketchs of the 31st International Conference on Computer Graphics and Interactive Techniques (SIGGRAPH 2004), Los Angeles, California, August 8–12, 2004.

BibTeX

@InProceedings{Refolding_SIGGRAPH2004,
  AUTHOR        = {Hayley N. Iben and James F. O'Brien and Erik D. Demaine},
  TITLE         = {Refolding Planar Polygons},
  BOOKTITLE     = {Technical Sketchs of the 31st International Conference on
                   Computer Graphics and Interactive Techniques
                   (SIGGRAPH 2004)},
  ADDRESS       = {Los Angeles, California},
  MONTH         = {August 8--12},
  YEAR          = 2004,

  papers        = {Refolding_SoCG2006; ForceLinkage_SoCG2004},
  doi           = {https://dx.doi.org/10.1145/1186223.1186341},
  dblp          = {https://dblp.org/rec/conf/siggraph/IbenOD04},
  comments      = {See also
                   <A HREF="http://www.cs.berkeley.edu/b-cam/Papers/Iben-2006-RPP/">animations</A> of this algorithm. This paper is also available from <A HREF="https://doi.org/10.1145/1186223.1186341">ACM</A>.},
  paperkind     = {technical sketch},
  length        = {1 page},
  unrefereed    = 1,
}

Comments:

See also animations of this algorithm. This paper is also available from ACM.

Length:

The technical sketch is 1 page.

Availability:

The technical sketch is available in PDF (67k).

See information on file formats.

[Google Scholar search]

Related papers:

Refolding_SoCG2006 (Refolding Planar Polygons)

ForceLinkage_SoCG2004 (An Energy-Driven Approach to Linkage Unfolding)