• Publications
  • Influence
A combinatorial approach to planar non-colliding robot arm motion planning
  • I. Streinu
  • Computer Science
  • Proceedings 41st Annual Symposium on Foundations…
  • 12 November 2000
TLDR
We propose a combinatorial approach to plan noncolliding motions for a polygonal bar-and-joint framework. Expand
  • 173
  • 19
  • PDF
Pebble game algorithms and sparse graphs
TLDR
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
  • 192
  • 18
  • PDF
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
  • 80
  • 8
  • PDF
Expansive Motions and the Polytope of Pointed Pseudo-Triangulations
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 theExpand
  • 109
  • 6
  • PDF
KINARI-Web: a server for protein rigidity analysis
TLDR
KINARI-Web is an interactive web server for performing rigidity analysis and visually exploring rigidity properties of proteins. Expand
  • 59
  • 5
  • PDF
On the number of embeddings of minimally rigid graphs
TLDR
We study first the number of distinct planar embeddings of rigid graphs with n vertices. Expand
  • 43
  • 5
  • PDF
Illumination by floodlights
TLDR
We consider three problems about the illumination of planar regions with floodlights of prescribed angles. Expand
  • 14
  • 5
Pseudo-Triangulations - a Survey
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 dataExpand
  • 80
  • 4
  • PDF
Single-Vertex Origami and Spherical Expansive Motions
TLDR
We prove that all single-vertex origami shapes are reachable from the open flat state via simple, non-crossing motions. Expand
  • 48
  • 4
Slider-Pinning Rigidity: a Maxwell–Laman-Type Theorem
TLDR
We define and study slider-pinning rigidity, giving a complete combinatorial characterization of planar sliderpinning in the general setting. Expand
  • 23
  • 3
  • PDF