#### Filter Results:

- Full text PDF available (38)

#### Publication Year

1975

2017

- This year (4)
- Last 5 years (10)
- Last 10 years (20)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Method

Learn More

- Robert Connelly
- Discrete & Computational Geometry
- 2005

Suppose a finite configuration of labeled points p = (p1, . . . , pn) inEd is given along with certain pairs of those points determined by a graph G such that the coordinates of the points of p areâ€¦ (More)

- Robert Connelly
- Applied Geometry And Discrete Mathematics
- 1990

Suppose one holds two sticks in the form of a cross in one hand, and places a rubber band in tension around the four ends. When it is released, it comes to rest in the shape of a convex quadrilateralâ€¦ (More)

- Esther M. Arkin, Robert Connelly, Joseph S. B. Mitchell
- Symposium on Computational Geometry
- 1989

We study the class of problems associated with the detection and computation of monotone paths among a set of disjoint obstacles. We give an <italic>&Ogr;</italic>(<italic>nE</italic>) algorithm forâ€¦ (More)

- Robert Connelly, Walter Whiteley
- SIAM J. Discrete Math.
- 1996

This paper defines two concepts of rigidity for tensegrity frameworks (frameworks with cables, bars, and struts): prestress stability and second-order rigidity. We demonstrate a hierarchy ofâ€¦ (More)

Consider a planar linkage, consisting of disjoint polygonal arcs and cycles of rigid bars joined at incident endpoints (polygonal chains), with the property that no cycle surrounds another arc orâ€¦ (More)

- Aleksandar Donev, Ibrahim I Cisse, +5 authors Paul M Chaikin
- Science
- 2004

Packing problems, such as how densely objects can fill a volume, are among the most ancient and persistent problems in mathematics and science. For equal spheres, it has only recently been provedâ€¦ (More)

- Maria Belk, Robert Connelly
- Discrete & Computational Geometry
- 2007

A graph is d-realizable if, for every configuration of its vertices in E N , there exists a another corresponding configuration in Ed with the same edge lengths. A graph is 2-realizable if and onlyâ€¦ (More)

Jamming in hard-particle packings has been the subject of considerable interest in recent years. In a paper by Torquato and Stillinger [J.Phys.Chem. B, 105 (2001)], a classification scheme of jammedâ€¦ (More)

- Robert Connelly, Walter Whiteley
- Discrete & Computational Geometry
- 2010

Recent results have confirmed that the global rigidity of bar and joint frameworks on a graph G is a generic property in Euclidean spaces of all dimensions, although it is not known if there is aâ€¦ (More)