Ileana Streinu

from Wikipedia, the free encyclopedia
Ileana Streinu in Limerick

Ileana Streinu (* in Bucharest ) is a Romanian - American mathematician and computer scientist , dedicated to discrete and computer-based geometry (especially rigidity problems), and combinatorics deals.

Streinu received his PhD in 1994 from the University of Bucharest with Solomon Marcus ( Some Positive and Negative Results in Computational Geometry ) and in the same year from Rutgers University in Computer Science with William L. Steiger ( Grammatical inference ). She is a professor of mathematics and computer science at Smith College in Northampton , where she has been since 1994. She is also an Adjunct Professor at the University of Massachusetts Amherst .

Among other things, she was visiting professor and researcher at the TU Berlin (visiting professor 2006), at the Euler Institute in Saint Petersburg, at the École normal supérieure in Paris, at Stanford University , at the Catalan Polytechnic University in Barcelona, ​​at the Technical University of Kyoto and at the University of Hamburg .

In 2010 she won the David P. Robbins Prize of the American Mathematical Society , of which she is a fellow, for her solution to Carpenter's Rule Problem (first solved by Robert Connelly et al.), Which involves a flat polygon with rigid edges without self-intersection to bring them into a convex shape through continuous transformations. The problem has applications in the motion planning of robotic arms.

In 2006 she and Ciprian Borcea received the Grigore Moisil Prize of the Romanian Academy of Sciences for her proof that minimal rigid graphs (Laman graphs) with n vertices have at most different embeddings in the Euclidean plane.

Web links

Individual evidence

  1. ^ Mathematics Genealogy Project
  2. Streinu Pseudo-triangulations, Rigidity and Motion Planning, Discrete & Computational Geometry, Volume 34, 2005, pp. 587-635
  3. ^ Streinu A combinatorial approach to planar non-colliding robot arm motion planning , Proceedings of the 41st Annual Symposium on Foundations of Computer Science, IEEE Computer Society, 2000, pp. 443-453
  4. Borcea, Streinu The number of embeddings of minimally rigid graphs , Discrete and Computational Geometry, Volume 31, 2004, pp. 287-303