-
Günter Rote, Francisco Santos and Ileana Streinu
Pseudo-triangulations - a Survey
Accepted, to appear in
Discrete Computational Geometry
special issue for 20 Years anniversary issue
(J.E. Goodman, J. Pach and R. Pollack, eds.).
From Math arXiv
-
Ileana Streinu and Louis Theran
Sparsity-certifying Graph Decompositions
From Math arXiv
-
Ileana Streinu and Louis Theran
Sparse Hypergraphs and Pebble Game Algorithms
Accepted, to appear in
European Journal of Combinatorics
special issue for Oriented Matroids'05 (R. Cordovil, M. Las Vergnas and J. Ramirez-Alfonsin, eds.).
From Math arXiv
-
Ruth Haas, Audrey Lee, Ileana Streinu and Louis Theran
Characterizing
Sparse Graphs by Map Decompositions
Accepted, to appear in
Journal of Combinatorial Mathematics and Combinatorial Computing (JCMCC)
, vol. 62, 2007.
From Math arXiv
-
David Avis, Naoki Katoh, Makoto Ohsaki, Ileana Streinu and Shin-ichi
Tanigawa
Enumerating Non-crossing Minimally Rigid Frameworks,
Proc. 12th Annual International Computing and Combinatorics Conference COCOON 2006, Taipei,
Taiwan, 15-18 Aug. 2006. Lecture Notes in Computer Science 4112, 2006, pp. 205 - 215, DOI:10.1007/11809678_23.
From arXiv
-
Audrey Lee, Ileana Streinu and Oliver Brock
A Methodology for Efficiently Sampling the Conformation Space
of Molecular Structures
In
Physical Biology
2, SPECIAL FOCUS: Flexibility in biomolecules,
Nov. 2005, S108-S115, doi:10.1088/1478-3975/2/4/S05
-
Audrey Lee, Ileana Streinu
and Louis Theran
Finding and Maintaining Rigid Components
in
Proc.
17th Canadian
Conference on Computational Geometry
Univ. of Windsor,
Ontario, Canada, Aug. 10-12, 2005.
-
Jack Snoeyink
and Ileana Streinu
Computing Rigid Components of Pseudo-triangulation Mechanisms
in Linear Time
in
Proc.
17th Canadian
Conference on Computational Geometry
Univ. of Windsor,
Ontario, Canada, Aug. 10-12, 2005.
-
Audrey Lee and Ileana Streinu
Pebble Game Algorithms and Sparse Graphs
EuroComb 2005
, Sept. 2005. Full paper to appear, Discrete mathematics, 2007.
From arXiv
-
Ileana Streinu
Parallel Redrawing Mechanisms, Pseudo-Triangulations and Kinetic Planar Graphs
in: Patrick Healy, Nikola S. Nikolov (editors)
Proc.
Graph Drawing 2005
, Limerick, Ireland, 12-14 Sept. 2005.
Springer
LNCS, Volume 3843, pp. 421 - 433, 2006. DOI: 10.1007/11618058_38
-
Ciprian Borcea and
Ileana Streinu
Singularities of Hinge Structures
in
Efficient Methods in Algebraic Geometry (MEGA'05)
,
Porto Conte, Sardinia, Italy, May 2005.
pdf
-
Ileana Streinu and Walter Whiteley
Single-Vertex Origami and Spherical Expansive Motions
Proc.
Japan Conf. on Discrete and Comp. Geometry
Tokai University, Tokyo, Oct. 8-11 2004.
Lecture Notes in Computer Science 3742, pp. 161-173, Springer 2005.
Pre-publication version pdf
-
Greg Aloupis, Erik Demaine, Stefan Langerman, Pat Morin, Joseph O'Rourke, Ileana Streinu and Godfried Toussaint
Edge-Unfolding Nested Polyhedral Bands
Journal version submitted for publication (invited) to a special issue of
Computational Geometry, Theory and Applications
[pdf]
A preliminary version appeared as
Unfolding Polyhedral Bands
in Proc.
16th Canadian Conference on Computational Geometry
(CCCG'04) , Concordia
University,
Montreal, August 9-11, 2004.
CCCG abstract ps.
-
Ileana Streinu
Pseudo-Triangulations, Rigidity and Motion Planning
in
Discrete and Computational Geometry
, vol. 34, no. 4, pp. 587-635, Nov. 2005.
ps
-
Harry A. Schmitt, Don E. Waagen, George Barbastathis,
and Ileana Streinu
Computational origami for sensor configuration and control
in
Conference Record of the Thirty-Eighth Asilomar Conference on
Signals, Systems and Computers
,
7-10 Nov. 2004, pp. 811- 815 Vol.1
From ieee site.
-
Harry A. Schmitt, D.L. Barker, N.N. Shah, R. D. Rosenwald, D. E. Waagen, George Barbastathis, S.M. Jurga. C.H. Hidrovo-Chavez, T. Buchner
and Ileana Streinu
Cognitive micro-systems: geometry of computation and sensing
in
Fifth
Asian Control Conference
,
20-23 July 2004, Melbourne, Australia.
From conference site.
-
Oswin Aichholzer, Günter Rote, Bettina Speckmann and Ileana Streinu
The Zigzag Path of a Pseudo-Triangulation
in
Proc.
8th International Workshop on Algorithms and Data Structures (WADS)
, Ottawa, Canada,
pp. 377-388, Lecture Notes in Computer Science 2748, Springer Verlag, 2003.
pdf
-
Ruth Haas, David Orden, Günter Rote, Francisco Santos, Brigitte Servatius,
Herman Servatius, Diane
Souvaine, Ileana Streinu and Walter Whiteley
Planar Minimally Rigid Graphs and Pseudo-triangulations
Computational Geometry, Theory and Applications
, vol. 31, issue 1-2, pp. 31-61, May 2005.
A preliminary version appeared in
Proc.
ACM Symp. Comp. Geometry (SoCG)
San Diego, California, June 2003, pp. 154-163.
http://www.arxiv.org/abs/math.CO/0307347 |
ACM Portal |
pdf |
SoCG pdf |
arXiv
-
Ileana Streinu and Sue Whitesides
Rectangle Visibility Graphs:
Characterization, Construction and Compaction
in
Proc. of the 20th Annual
Symposium on Theoretical Aspects of Computer Science (STACS 2003)
Berlin, Germany, Feb. 28-March 1, 2003, H.
Alt and M. Habib (eds.), Springer-Verlag LNCS Series, vol.
2607, pp. 26-37.
Retrieve from
Springer.
-
Jürgen Bokowski, Simon King, Susanne Mock and Ileana Streinu
A
Topological Representation Theorem for Oriented Matroids
Discrete and Computational Geometry
, vol. 33, nr. 4, pp. 645-668, April 2005.
From publisher
From arXiv
http://arXiv.org/abs/math/0209364
-
Greg Aloupis, Erik Demaine, Vida Dujmovic, Jeff
Erickson, Stefan Langerman, Henk Meijer, Joseph O'Rourke, Mark
Overmars, Michael Soss, Ileana Streinu and Godfried Toussaint
Flat state
Connectivity of Linkages under Dihedral Motions
in
Proc.
13th Annual Internat. Symp. Algorithms and Computation
(ISAAC'02)
Vancouver, Nov. 20-23, 2002, pp. 369-380.
-
Ileana Streinu and Elif Tosun
Camera Position Reconstruction and Tight
Direction Networks
in
Michael Goodrich and Stephen
Kobourov (eds.),
Proc.
Graph Drawing'02
Aug. 26-28, 2002,
Irvine, CA, Lecture Notes in Computer Science, Springer Verlag
2002.
-
Greg Aloupis, Erik Demaine, Henk Meijer, Joseph O'Rourke, Ileana Streinu
and Godfried Toussaint
Flat state connectedness of Fixed Angle
Chains: Special Acute Chains
in
Proc.
14th Canadian
Conference on Computational Geometry
Univ. of Lethbridge,
Alberta, Canada, Aug. 12-14, 2002.
-
Ciprian Borcea and Ileana Streinu
On the Number of Embeddings of
Minimally Rigid Graphs
Discrete and Computational Geometry
31, nr. 2, Feb. 2004, pp. 287-303.
A preliminary version appeared in
Proc.
ACM Symp. Computational Geometry
(SoCG)
Barcelona, June 5-7, 2002.
[pdf]
[http://arxiv.org/abs/math.MG/0207126]
[BibTex]
-
Ileana Streinu
Combinatorial Roadmaps in Configuration Spaces of Simple
Planar Polygons
in
Saugata Basu and
Laureano Gonzalez-Vega (eds.)
Proceedings of the
DIMACS
Workshop on on Algorithmic and Quantitative Aspects of Real
Algebraic Geometry in Mathematics and Computer Science
, DIMACS, 2003, pp. 181-206.
[pdf]
-
Günter Rote, Francisco Santos and Ileana Streinu
Expansive Motions
and the Polytope of Pointed Pseudo-Triangulations
in
Boris Aronov, Saugata Basu, Janos Pach and
Micha Sharir (eds.)
Discrete and Computational Geometry -
The Goodman-Pollack Festschrift
in the series: Algorithms and
Combinatorics, Springer Verlag, Berlin, 2003, pp. 699-736.
[pdf]
[http://arxiv.org/abs/math.CO/0206027]
-
Eynat Rafalin, Diane Souvaine and Ileana Streinu
Topological Sweep
for Degenerate Point Sets
in
D. Mount and C. Stein (eds.)
4th Workshop on Algorithm Engineering and Experiments (ALENEX'02)
San Francisco, Jan. 4-5, 2002, Lecture Notes in Computer
Science, Springer Verlag, 2002.
[ps]
-
Jürgen Bokowski, Susanne Mock and Ileana Streinu
The Folkman-Lawrence
Topological Representation Theorem for Oriented Matroids - an
elementary proof in rank 3
European Journal of
Combinatorics
vol. 22, no. 5, pp. 601-615, July 2001.
[ps]
-
Kim Miller, Suneeta Ramaswami, Peter Rousseeuw, Diane
Souvaine, Toni Sellares, Ileana Streinu and Anja Struyf
Efficient computation of
location depth contours by methods of computational geometry
Statistics and Computing
, 13, pp. 153-162, 2003.
A preliminary version
Fast Implementation of
Depth Contours using Topological Sweep
appeared in
Proc.
11th
SIAM-ACM Symp. on Discrete Algorithms (SODA)
2001, Washington, DC,
Jan. 7-9, 2001, pp. 690-699.
[ps]
-
Ileana Streinu
A Combinatorial Approach to Planar Non-Colliding Robot Arm Motion
Planning
in
Proc.
41st ACM Annual Symposium on Foundations
of Computer Science (FOCS)
Redondo Beach, CA, Nov. 12-14, 2000, pp. 443-453.
[ps.gz]
[FOCS]
-
Stefan Felsner, Ferran Hurtado, Marc Noy and Ileana Streinu
Hamiltonicity and Colorings of Arrangement Graphs
Discrete Applied Mathematics
Volume 154, Issue 17, 15 November 2006, Pages 2470-2483
A preliminary version appeared in
Proc.
11th ACM-SIAM Symposium on Discrete Algorithms (SODA)
San Francisco, Jan. 9-11 2000, pp. 155-164.
[ps]
-
Ileana Streinu
Non-Stretchable Pseudo-Visibility Graphs
Computational Geometry: Theory and Applications
31, pp. 195-206, 2005.
A preliminary version appeared in
Proc.
11th
Canadian Conf. on Computational Geometry
Vancouver, August 1999,
pp. 22-25.
[ps]
-
Ileana Streinu
Stretchability of Star-like Pseudo-Visibility Graphs
in
Proc.
ACM Symposium on Computational Geometry (SoCG)
Miami Beach, June
1999, pp. 274-280.
[ps]
-
Therese Biedl, Erik Demaine, Martin Demaine, Sylvain
Lazard,
Anna Lubiw,
Joseph O'Rourke, Mark Overmars, Steve Robbins, Ileana Streinu, Godfried Toussaint and Sue Whitesides
Locked and Unlocked Polygonal Chains in Three Dimensions
Discrete and Computational Geometry
, 26, pp. 269-281, 2001.
A preliminary version
appeared in
Proc.
10th ACM-SIAM
Symposyum on Discrete Algorithms (SODA)
Jan. 1999, pp. S866-7.
-
Therese Biedl, Erik Demaine, Martin Demaine, Sylvain Lazard, Anna Lubiw,
Joseph O'Rourke, Steve Robbins, Ileana Streinu, Godfried Toussaint and Sue Whitesides
On
Reconfiguring Tree Linkages: Trees can Lock
Discrete
Applied Math.
117 (2002) pp. 293-297.
A preliminary version
appeared in
Proc.
10th Canadian Conference on Computational Geometry
Montreal, Aug. 1998. abs:4-5.
-
William Steiger and Ileana Streinu
Illumination by Floodlights
Computational Geometry: Theory and Applications
10, pp. 57-70, 1998.
A preliminary version
Positive and Negative Results on the
Floodlight Problem
appeared in
Proc.
6th Canadian Conference on
Computational Geometry
Saskatoon, Aug. 1994, pp. 87-96.
-
Joseph O'Rourke and Ileana Streinu
The vertex-edge visibility graph of a
polygon
Computational Geometry: Theory and Applications
10, pp. 105-120, 1998.
[ps]
-
Joseph O'Rourke and Ileana Streinu
Pseudo-Visibility Vertex-Edge
Visibility Graphs: Characterization and Recognition
in
Proc.
ACM Symposium on Computational Geometry (SoCG)
Nice, France, June 1997, pp. 439-441.
[ps]
-
Ileana Streinu
Clusters of Stars
in
Proc.
ACM Symposium on Computational Geometry (SoCG)
Nice, France, June 1997, pp. 439-441.
[ps]
-
Joseph O'Rourke, Tom Shermer and Ileana Streinu
Illuminating convex
polygons with vertex floodlights
in
Proc.
7th Canadian Conference
on Computational Geometry
Quebec City, aug. 1995, pp. 151-156.
[ps]
-
William Steiger and Ileana Streinu
A pseudo-algorithmic separation of lines
and pseudo-lines
Inf.Proc.Letters
53, pp. 295-299, 1995.
A preliminary version appeared in
Proc.
6th Canadian Conference on
Computational Geometry
Saskatoon, aug. 1994, pp. 7-11.
[ps]
-
Ileana Streinu
A Gödel-like Independent Sentence in a Theory of Pure
LISP Programs
Recursive Function Theory Newsletter
no.33,
June 1985.
-
Ileana Streinu
Grammar Directed Gödel Numberings
Internat. Jour. Computer
Mathematics
vol.19, no.3-4, 1983, pp.223-237.
-
Ileana Streinu
Learning by Grammatical Inference
Revue Roumaine de
Linguistique
tome XXVI, no.5, 1981, pp.435-454.
-
Ileana Streinu
Darboux Property for the Hierarchy of
LL(k) languages (in Romanian),
Studii si Cercetari Matematice
Bucharest, tome 30,
no.5,1978, pp.579-593.
-
Ileana Streinu
LL(k) Languages are closed under union
with finite ones
in
Proc.
4th Internat. Coll. Automata, Languages and Programming (ICALP)
Turku, Finland, Springer Lecture Notes in Computer Science LNCS 53,
1977, pp.504-508.
[BibTex]
|