3. T. Schwartz and M. Sharir. On the '#piano movers" problem If: General techniques for computing topological properties of real algebraic manifolds. Adv. Appl. Math., 4:298-351, 1983.

Google Scholar

Cited By

View all

Wang WBalkcom D(2018)Knot grasping, folding, and re-graspingInternational Journal of Robotics Research10.1177/027836491875467637:2-3(378-399)Online publication date: 1-Feb-2018
https://dl.acm.org/doi/10.1177/0278364918754676
Arkin EFekete SMitchell J(2003)An algorithmic study of manufacturing paperclips and other folded structuresComputational Geometry: Theory and Applications10.1016/S0925-7721(02)00133-525:1-2(117-138)Online publication date: 1-May-2003
https://dl.acm.org/doi/10.1016/S0925-7721%2802%2900133-5
Demaine ELangerman SO'Rourke JSnoeyink JHurtado FSacristán VBajaj CSuri S(2002)Interlocked open linkages with few jointsProceedings of the eighteenth annual symposium on Computational geometry10.1145/513400.513424(189-198)Online publication date: 5-Jun-2002
https://dl.acm.org/doi/10.1145/513400.513424
Show More Cited By

Index Terms

Locked and unlocked polygonal chains in 3D
1. Mathematics of computing
  1. Discrete mathematics
2. Theory of computation
  1. Randomness, geometry and discrete structures
    1. Computational geometry

Recommendations

Locked and unlocked chains of planar shapes
SCG '06: Proceedings of the twenty-second annual symposium on Computational geometry

We extend linkage unfolding results from the well-studied case of polygonal linkages to the more general case of linkages of polygons. More precisely, we consider chains of nonoverlapping rigid planar shapes (Jordan regions) that are hinged together ...
Locked and Unlocked Chains of Planar Shapes

We extend linkage unfolding results from the well-studied case of polygonal linkages to the more general case of linkages of polygons. More precisely, we consider chains of nonoverlapping rigid planar shapes (Jordan regions) that are hinged together ...
Locked and Unlocked Polygonal Chains in Three Dimensions

This paper studies movements of polygonal chains in three dimensions whose links are not allowed to cross or change length. Our main result is an algorithmic proof that any simple closed chain that initially takes the form of a planar polygon can be ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

SODA '99: Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms

January 1999

992 pages

ISBN:0898714346

Publisher

Society for Industrial and Applied Mathematics

United States

Publication History

Published: 01 January 1999

Check for updates

Qualifiers

Article

Conference

SODA99

Sponsor:

SIGACT
SIAM

SODA99: 1999 10th Conference on Discrete Algorithms

January 17 - 19, 1999

Maryland, Baltimore, USA

Acceptance Rates

Overall Acceptance Rate 411 of 1,322 submissions, 31%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4
Total Citations
View Citations
36
Total Downloads

Downloads (Last 12 months)15
Downloads (Last 6 weeks)2

Reflects downloads up to 20 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Wang WBalkcom D(2018)Knot grasping, folding, and re-graspingInternational Journal of Robotics Research10.1177/027836491875467637:2-3(378-399)Online publication date: 1-Feb-2018
https://dl.acm.org/doi/10.1177/0278364918754676
Arkin EFekete SMitchell J(2003)An algorithmic study of manufacturing paperclips and other folded structuresComputational Geometry: Theory and Applications10.1016/S0925-7721(02)00133-525:1-2(117-138)Online publication date: 1-May-2003
https://dl.acm.org/doi/10.1016/S0925-7721%2802%2900133-5
Demaine ELangerman SO'Rourke JSnoeyink JHurtado FSacristán VBajaj CSuri S(2002)Interlocked open linkages with few jointsProceedings of the eighteenth annual symposium on Computational geometry10.1145/513400.513424(189-198)Online publication date: 5-Jun-2002
https://dl.acm.org/doi/10.1145/513400.513424
Song GAmato NLengauer T(2001)Using motion planning to study protein folding pathwaysProceedings of the fifth annual international conference on Computational biology10.1145/369133.369239(287-296)Online publication date: 22-Apr-2001
https://dl.acm.org/doi/10.1145/369133.369239

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Locked and unlocked chains of planar shapes

Locked and Unlocked Chains of Planar Shapes

Locked and Unlocked Polygonal Chains in Three Dimensions