Paper by Erik D. Demaine

Reference:

Robert Connelly, Erik D. Demaine, and Günter Rote, “Every Polygon Can Be Untangled”, in Abstracts from the 16th European Workshop on Computational Geometry (EuroCG 2000), Eilat, Israel, March 13–15, 2000, pages 62–65.

BibTeX

@InProceedings{EuroCG2000,
  AUTHOR        = {Robert Connelly and Erik D. Demaine and G\"unter Rote},
  TITLE         = {Every Polygon Can Be Untangled},
  BOOKTITLE     = {Abstracts from the 16th European Workshop on Computational
                   Geometry (EuroCG 2000)},
  BOOKURL       = {http://www.cs.bgu.ac.il/~cg2000/},
  MONTH         = {March 13--15},
  YEAR          = 2000,
  ADDRESS       = {Eilat, Israel},
  PAGES         = {62--65},

  award         = {Invited to special issue of \emph{Computational Geometry: Theory and Applications}.},
  length        = {4 pages},
  paperkind     = {abstract},
  papers        = {Linkage; LinkageTR; FOCS2000a},
  webpages      = {linkage},
  dblp          = {https://dblp.org/rec/conf/ewcg/ConnellyDR00},
  comments      = {This abstract is also available from the
<A HREF="http://www.cs.bgu.ac.il/~cg2000/PS/CGSubmittedPS.html">electronic
                   abstracts</A> as
<A HREF="http://www.cs.bgu.ac.il/~cg2000/PS/27.ps">http://www.cs.bgu.ac.il/~cg2000/PS/27.ps</A>.},
  unrefereed    = 1,
}

Comments:

This abstract is also available from theelectronic abstracts ashttp://www.cs.bgu.ac.il/~cg2000/PS/27.ps.

Length:

The abstract is 4 pages.

Availability:

The abstract is available in PostScript (147k).

See information on file formats.

[Google Scholar search]

Related papers:

Linkage (Straightening Polygonal Arcs and Convexifying Polygonal Cycles)

LinkageTR (Straightening Polygonal Arcs and Convexifying Polygonal Cycles)

FOCS2000a (Straightening Polygonal Arcs and Convexifying Polygonal Cycles)

Related webpages:

Carpenter's Rule Theorem