Paper by Erik D. Demaine

Reference:

Erik D. Demaine, Martin L. Demaine, Stefan Langerman, and Jérôme Vervier, “Locked Thick Chains”, in Abstracts from the 25th European Workshop on Computational Geometry (EuroCG 2009), Brussels, Belgium, March 16–18, 2009, pages 65–68.

BibTeX

@InProceedings{ThickChain_EuroCG2009,
  AUTHOR        = {Erik D. Demaine and Martin L. Demaine and Stefan Langerman
                   and J{\'e}r{\^o}me Vervier},
  TITLE         = {Locked Thick Chains},
  BOOKTITLE     = {Abstracts from the 25th European Workshop on Computational
                   Geometry (EuroCG 2009)},
  bookurl       = {http://2009.eurocg.org/},
  ADDRESS       = {Brussels, Belgium},
  MONTH         = {March 16--18},
  YEAR          = 2009,
  PAGES         = {65--68},

  paperkind     = {abstract},
  length        = {4 pages},
  unrefereed    = 1,
}

Abstract:

We investigate when thick 3D polygonal chains are locked, i.e., have a disconnected configuration space. In particular, we show that thick 4-chains are never locked, and we exhibit a class of locked thick 5-chains whose ratio of maximum edge length to minimum edge length is strictly less than 3 (the best known ratio for nonthick chains).

Length:

The abstract is 4 pages.

Availability:

The abstract is available in PDF (374k).

See information on file formats.

[Google Scholar search]