Computational Polygonal Entanglement Theory

@inproceedings{Toussaint1999ComputationalPE,
  title={Computational Polygonal Entanglement Theory},
  author={Godfried T. Toussaint},
  year={1999}
}
In this paper we are concerned with motions for untangling polygonal linkages (chains, polygons and trees) in 2 and 3 dimensions. We say that an open, simple polygonal chain can be straightened if it can be continuously reconngured to a sequence of collinear segments in such a way that the rigidity and length of each link and the simplicity of the entire chain are maintained throughout the motion. For a closed chain (simple polygon) untangling means convexiication: reconnguration to a convex… CONTINUE READING

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 24 references

Reconfigurating Closed Polygonal Chains in Euclidean d-Space

Discrete & Computational Geometry • 1995
View 8 Excerpts
Highly Influenced

Solution of problem 3763

B ela Nagy
American Mathematical Monthly, • 1939
View 7 Excerpts
Highly Influenced

The Embedding Space of Hexagonal

KnotsJorge Alberto Calvo
1999
View 3 Excerpts
Highly Influenced

Knotting of regular polygons in 3-space

K. Millet
Journal of Knot Theory and its Rami ca- tions, • 1994
View 4 Excerpts
Highly Influenced

A counterexample(?) to the carpenter's ruler conjecture

Joe Mitchell
Internal Report, • 1999
View 1 Excerpt

A new class of stuck unknots in Pol6

G. T. Toussaint
Technical Report SOCS-99.1, • 1999
View 1 Excerpt

Similar Papers

Loading similar papers…