2008
A Class of Convex Polyhedra with Few Edge Unfoldings, Alex Benton and Joseph O'Rourke
Extremal Configurations of Hinge Structures, Ciprian Borcea and Ileana Streinu
Singularities of Hinge Structures, Ciprian Borcea and Ileana Streinu
Isometric Morphing of Triangular Meshes, Prosenjit Bose, Joseph O'Rourke, Chang Shu, and Stefanie Wuhrer
Aesthetic Journeys, Johanna Brewer, Scott Mainwaring, and Paul Dourish
On-Line Distributed Traffic Grooming, R. Jordan Crouser, Brian Rice, Adrian Sampson, and Ran Libeskind-Hadas
Grid Vertex-Unfolding Orthogonal Polyhedra, Mirela Damian
Unfolding Manhattan Towers, Mirela Damian, Robin Flatland, and Joseph O'Rourke
On Corners of Objects Built from Parallelepiped Bricks, Mirela Damian and Joseph O'Rourke
A Hidden Markov Model for Alphabet-Soup Word Recognition, Shaolei Feng, Nicholas Howe, and R. Manmatha
Evaluating Recognition-Based Motion Capture on HumanEva II Test Data, Nicholas Howe
Unfolding Convex Polyhedra via Quasigeodesic Star Unfoldings, Jin-ichi Itoh, Joseph O'Rourke, and Costin Vîlcu
Pebble Game Algorithms and Sparse Graphs, Audrey Lee and Ileana Streinu
Analyzing Rigidity with Pebble Games, Audrey Lee, Ileana Streinu, and Louis Theran
A Pumping Lemma for Homometric Rhythms, Joseph O'Rourke, Perouz Taslakian, and Godfried Toussaint
Combinatorial Genericity and Minimal Rigidity, Ileana Streinu and Louis Theran
2007
Vertex Pops and Popturns, Greg Aloupis, Brad Ballinger, Prosenjit Bose, Mirela Damian, Erik D. Demaine, Martin L. Demaine, Robin Flatland, Ferran Hurtado, Stefan Langerman, Joseph O'Rourke, Perouz Taslakian, and Godfried Toussaint
In-Between Theory and Practice: Dialogues in Design Research, Arianna Bassoli, Johanna Brewer, and Karen Martin
Unfolding Polyhedra Via Cut-Tree Truncation, Alex Benton and Joseph O'Rourke
Epsilon-Unfolding Orthogonal Polyhedra, Mirela Damian, Robin Flatland, and Joseph O'Rourke
A New Lower Bound on Guard Placement for Wireless Localization, Mirela Damian, Robin Flatland, Joseph O'Rourke, and Suneeta Ramswami
Connecting Polygonizations via Stretches and Twangs, Mirela Damian, Robin Flatland, Joseph O'Rourke, and Suneeta Ramswami
Characterizing Sparse Graphs by Map Decompositions, Ruth Haas, Audrey Lee, Ileana Streinu, and Louis Theran
Recognition-Based Motion Capture and the HumanEva II Test Data, Nicholas Howe
Graded Sparse Graphs and Matroids, Audrey Lee, Ileana Streinu, and Louis Theran
The Slider-Pinning Problem, Audrey Lee, Ileana Streinu, and Louis Theran
Band Unfoldings and Prismatoids: A Counterexample, Joseph O'Rourke
Unfolding Orthogonal Terrains, Joseph O'Rourke
Unfolding Restricted Convex Caps, Joseph O'Rourke
2006
On the Maximum Span of Fixed-Angle Chains, Nadia Benbernou and Joseph O’Rourke
Sexual Interactions: Why We Should Talk About Sex in HCI, Johanna Brewer, Joseph Jofish Kaye, Amanda Williams, and Susan Wyche
Polygons Flip Finitely: Flaws and a Fix, Erik D. Demaine, Blaise Gassend, Joseph O’Rourke, and Godfried T. Toussaint
Geometric Restrictions on Producible Polygonal Protein Chains, Erik D. Demaine, Stefan Langerman, and Joseph O'Rourke
Hamiltonicity and Colorings of Arrangement Graphs, Stefan Felsner, Ferran Hurtado, Marc Noy, and Ileana Streinu
Hamiltonicity and Colorings of Arrangement Graphs, Stefan Felsner, Ferran Hurtado, Marc Noy, and Ileana Streinu
Boundary Fragment Matching and Articulated Pose Under Occlusion, Nicholas Howe
Evaluating Lookup-Based Monocular Human Pose Tracking on the HumanEva Test Data, Nicholas Howe
2005
A Topological Representation Theorem for Oriented Matroids, Jürgen Bokowski, Simon King, Sussane Mock, and Ileana Streinu
Flow Lookup and Biological Motion Perception, Nicholas Howe
Boosted Decision Trees for Word Recognition in Handwritten Document Retrieval, Nicholas Howe, Toni M. Rath, and R. Manmatha
A Methodology for Efficiently Sampling the Conformation Space of Molecular Structures, Audrey Lee, Ileana Streinu, and Oliver Brock
Finding and Maintaining Rigid Components, Audrey Lee, Ileana Streinu, and Louis Theran
Computing Rigid Components of Pseudo-Triangulation Mechanisms in Linear Time, Jack Snoeyink and Ileana Streinu
Non-Stretchable Pseudo-Visibility Graphs, Ileana Streinu
Pseudo-Triangulations, Rigidity and Motion Planning, Ileana Streinu
2004
Unfolding Smooth Prismatoids, Nadia Benbernou, Patricia Cahn, and Joseph O'Rourke
On the Number of Embeddings of Minimally Rigid Graphs, Ciprian Borcea and Ileana Streinu
Partitioning Regular Polygons Into Circular Pieces II: Nonconvex Partitions, Mirela Damian and Joseph O'Rourke
A 2-Chain Can Interlock With a k-Chain, Julie Glass, Stefan Langerman, Joseph O'Rourke, Jack Snoeyink, and Jianyuan K. Zhong
Silhouette Lookup for Automatic Pose Tracking, Nicholas Howe
Better Foreground Segmentation Through Graph Cuts, Nicholas Howe and Alexandra Deschamps
Improving the Boosted Correlogram, Nicholas Howe and Amanda Ricketson
Computational Geometry Column 45, Joseph O'Rourke
The Structure of Optimal Partitions of Orthogonal Polygons into Fat Rectangles, Joseph O'Rourke and Geetika Tewari
2003
The Zigzag Path of a Pseudo-Triangulation, Oswin Aichholzer, Günter Rote, Bettina Speckmann, and Ileana Streinu
The Zigzag Path of a Pseudo-Triangulation, Oswin Aichholzer, Günter Rote, Bettina Speckmann, and Ileana Streinu
The Foldings of a Square to Convex Polyhedra, Rebecca Alexander, Heather Dyson, and Joseph O'Rourke
Partitioning Regular Polygons into Circular Pieces I: Convex Partitions, Mirela Damian and Joseph O'Rourke
Pushing Blocks is Hard, Erik D. Demaine, Martin L. Demaine, Michael Hoffmann, and Joseph O'Rourke
Geometric Restrictions on Producible Polygonal Protein Chains, Erik D. Demaine, Stefan Langerman, and Joseph O'Rourke
Interlocked Open and Closed Linkages with Few Joints, Erik D. Demaine, Stefan Langerman, Joseph O'Rourke, and Jack Snoeyink
Open Problems from CCCG 2002, Erik D. Demaine and Joseph O'Rourke
Planar Minimally Rigid Graphs and Pseudo-Triangulations, Ruth Haas, David Orden, Günter Rote, Francisco Santos, Herman Servatius, Diane Souvaine, Ileana Streinu, and Walter Whiteley
A Closer Look at Boosted Image Retrieval, Nicholas Howe
Efficient Computation of Location Depth Contours by Methods of Computational Geometry, Kim Miller, Suneeta Ramaswami, Peter Rousseeuw, J. Antoni Sellarès, Diane Souvaine, Ileana Streinu, and Anja Struyf
Computational Geometry Column 44, Joseph O'Rourke
On the Development of the Intersection of a Plane With a Polytope, Joseph O'Rourke
2002
Flat-State Connectivity of Linkages Under Dihedral Motions, Greg Aloupis, Erik D. Demaine, Vida Dujmović, Jeff Erickson, Stefan Langerman, Henk Meijer, Joseph O'Rourke, Mark Overmars, Michael Soss, Ileana Streinu, and Godfried T. Toussaint
Enumerating Foldings and Unfoldings Between Polygons and Polytopes, Erik D. Demaine, Martin L. Demaine, Anna Lubiw, and Joseph O'Rourke
Vertex-Unfoldings of Simplicial Manifolds, Erik D. Demaine, David Eppstein, Jeff Erickson, George W. Hart, and Joseph O'Rourke
Interlocked Open Linkages with Few Joints, Erik D. Demaine, Stefan Langerman, Joseph O'Rourke, and Jack Snoeyink
Nonorthogonal Polyhedra Built from Rectangles, Melody Donoso and Joseph O'Rourke
Boosted Image Classification: An Empirical Study, Nicholas Howe
Computational Geometry Column 43, Joseph O'Rourke
Topological Sweep in Degenerate Cases, Eynat Rafalin, Diane Souvaine, and Ileana Streinu
2001
On the Folkman-Lawrence Topological Representation Theorem for Oriented Matroids of Rank 3, Jürgen Bokowski, Susanne Mock, and Ileana Streinu
Polygonal Chains Cannot Lock in 4D, Roxana Cocan and Joseph O'Rourke
Fast Implementation of Depth Contours Using Topological Sweep, Kim Miller, Suneeta Ramaswami, Peter Rousseeuw, Toni Sellarès, Diane Souvaine, Ileana Streinu, and Anja Struyf
Computational Geometry Column 42, Joseph S. B. Mitchell and Joseph O'Rourke
Computational Geometry Column 41, Joseph O'Rourke
2000
On Reconfiguring Tree Linkages: Trees Can Lock, Therese Biedl, Erik D. Demaine, Martin L. Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Steve Robbins, Ileana Streinu, Godfried Toussaint, and Sue Whitesides
Examples, Counterexamples, and Enumeration Results for Foldings and Unfoldings between Polygons and Polytopes, Erik D. Demaine, Martin L. Demaine, Anna Lubiw, and Joseph O'Rourke
PushPush and Push-1 are NP-Hard in 2D, Erik D. Demaine, Martin L. Demaine, and Joseph O'Rourke
PushPush is NP-Hard in 2D, Erik D. Demaine, Martin L. Demaine, and Joseph O'Rourke
Computational Geometry Column 37, Erik D. Demaine and Joseph O'Rourke
Data as Ensembles of Records: Representation and Comparison, Nicholas Howe
Using Artificial Queries to Evaluate Image Retrieval, Nicholas Howe
Integrating Color, Texture, and Geometry for Image Retrieval, Nicholas Howe and Daniel P. Huttenlocher
Bayesian Reconstruction of 3D Human Motion from Single-Camera Video, Nicholas Howe, Michael E. Leventon, and William T. Freeman
Computational Geometry Column 38, Joseph O'Rourke
Computational Geometry Column 39, Joseph O'Rourke
Computational Geometry Column 40, Joseph O'Rourke
Combinatorial Approach to Planar Non-Colliding Robot Arm Motion Planning, Ileana Streinu
1999
Locked and Unlocked Polygonal Chains in 3D, Therese Biedl, Erik D. Demaine, Martin L. Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Mark Overmars, Steve Robbins, Ileana Streinu, Godfried Toussaint, and Sue Whitesides
Embedded Training for Complex Information Systems, Brant A. Cheikes
Weighting Unusual Feature Types, Nicholas Howe and Claire Cardie
Computational Geometry Column 35, Joseph O'Rourke
Computational Geometry Column 36, Joseph O'Rourke
Zero-Parity Stabbing Information, Joseph O'Rourke and Irena Pashchenko
PushPush is NP-Hard in 3D, Joseph O'Rourke and The Smith Problem Solving Group