I. Streinu

Publications
Influence

A combinatorial approach to planar non-colliding robot arm motion planning

I. Streinu
Mathematics, Computer Science
Proceedings 41st Annual Symposium on Foundations…
12 November 2000

We propose a combinatorial approach to plan noncolliding motions for a polygonal bar-and-joint framework. Expand

Pebble game algorithms and sparse graphs

A. L. John, I. Streinu
Mathematics, Computer Science
Discret. Math.
5 February 2007

A multi-graph $G$ on n vertices is $(k,l)$-sparse if every subset of $n'≤n$ vertices spans at most $kn'-l$ edges, $0 ≤l < 2k$ is tight if, in addition, it has exactly $kn - l$ edges. Expand

Periodic frameworks and flexibility

C. Borcea, I. Streinu
Mathematics
Proceedings of the Royal Society A: Mathematical…
8 September 2010

We formulate a concise deformation theory for periodic bar-and-joint frameworks in Rd and illustrate our algebraic–geometric approach on frameworks related to various crystalline structures.… Expand

Expansive Motions and the Polytope of Pointed Pseudo-Triangulations

G. Rote, F. Santos, I. Streinu
Mathematics
4 June 2002

We introduce the polytope of pointed pseudo-triangulations of a point set in the plane, defined as the polytope of infinitesimal expansive motions of the points subject to certain constraints on the… Expand

On the number of embeddings of minimally rigid graphs

C. Borcea, I. Streinu
Mathematics, Computer Science
SCG '02
5 June 2002

We study first the number of distinct planar embeddings of rigid graphs with n vertices. Expand

KINARI-Web: a server for protein rigidity analysis

N. Fox, F. Jagodzinski, Yang Li, I. Streinu
Biology, Computer Science
Nucleic Acids Res.
21 June 2011

KINARI-Web is an interactive web server for performing rigidity analysis and visually exploring rigidity properties of proteins. Expand

Illumination by floodlights

W. Steiger, I. Streinu
Mathematics, Computer Science
Comput. Geom.
1 April 1998

We consider three problems about the illumination of planar regions with floodlights of prescribed angles. Expand

Pseudo-Triangulations - a Survey

G. Rote, F. Santos, I. Streinu
Mathematics
21 December 2006

A pseudo-triangle is a simple polygon with three convex vertices, and a pseudo-triangulation is a face-to-face tiling of a planar region into pseudo-triangles. Pseudo-triangulations appear as data… Expand

Single-Vertex Origami and Spherical Expansive Motions

I. Streinu, W. Whiteley
Mathematics, Computer Science
JCDCG
8 October 2004

We prove that all single-vertex origami shapes are reachable from the open flat state via simple, non-crossing motions. Expand

Slider-Pinning Rigidity: a Maxwell–Laman-Type Theorem

I. Streinu, Louis Theran
Mathematics, Computer Science
Discret. Comput. Geom.
1 December 2007

We define and study slider-pinning rigidity, giving a complete combinatorial characterization of planar sliderpinning in the general setting. Expand

Recommended Authors