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.

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


See also other papers by Erik Demaine.
These pages are generated automagically from a BibTeX file.
Last updated November 16, 2017 by Erik Demaine.