- Folding Polygons to Convex Polyhedra Joseph O'Rourke
- Computational Geometry Column 48 Joseph O'Rourke
- MINIMAL GUARD 9.1. INTRODUCTION
- Unfolding Well-Separated Orthotrees Mirela Damian
- MISCELLANEOUS SHAPES 4.1. INTRODUCTION
- arXiv:cs.CG/0405034v17May2004 Computational Geometry Column 45
- Contemporary Mathematics Unfolding Orthogonal Polyhedra
- CCCG 2011, Toronto ON, August 1012, 2011 Development of Curves on Polyhedra
- CCCG 2008, Montreal, Quebec, August 1315, 2008 Isometric Morphing of Triangular Meshes
- December 29, 2010 22:33 WSPC/Guidelines Y4Spanner International Journal of Computational Geometry & Applications
- The Continuous Hexachordal Theorem Brad Ballinger1
- CCCG 2007, Ottawa, Ontario, August 2022, 2007 Unfolding Polyhedra via Cut-Tree Truncation
- Computational Geometry Column 46 Joseph O'Rourke
- Sasha Berkoff, Caitlin Brady, Joseph O'Rourke, Sonya Nikolova The 23 Foldings of the Latin Cross
- ART GALLERY THEOREMS AND ALGORITHMS THE INTERNATIONAL SERIES OF
- POLYGON PARTITIONS 1.1. INTRODUCTION
- MOBILE GUARDS 3.1. INTRODUCTION
- XIV Spanish Meeting on Computational Geometry, 2730 June 2011 String-wrapped Rotating Disks
- Convex Polyhedra Realizing Given Face Areas Joseph O'Rourke
- CCCG 2010, Winnipeg MB, August 911, 2010 Sweeping Minimum Perimeter Enclosing Parallelograms
- CCCG 2008, Montreal, Quebec, August 1315, 2008 A Class of Convex Polyhedra
- Edge-Unfolding Medial Axis Polyhedra Joseph O'Rourke
- Unfolding Restricted Convex Caps Joseph O'Rourke
- Unfolding Orthogonal Terrains Joseph O'Rourke
- arXiv:cs.CG/0212050v221Jun2003 Open Problems from CCCG 2002
- Coloring Objects Built From Bricks Suzanne Gallagher
- Common Edge-Unzippings for Tetrahedra Joseph O'Rourke
- International Journal of Computational Geometry & Applications fl World Scientific Publishing Company
- Computational Geometry Column 31 Joseph O'Rourke \Lambda
- How Much Precision Is Needed to Compare Two Sums of Square Roots? 1
- arXiv:cs.CG/0010039 Computational Geometry Column 40
- Computational Geometry Column 50 Joseph O'Rourke
- CCCG 2008, Montreal, Quebec, August 1315, 2008 Draining a Polygon
- A Note on Solid Coloring of Pure Simplicial Complexes
- Computational Geometry Column 49 Joseph O'Rourke
- Folding and Unfolding in Computational Geometry
- in G corresponds to a line tangent to two concave chains, passing through a vertex of each; see Fig. 5. This bounds X by the number of such common tangents. The number of these
- 5.1. INTRODUCTION One of the major open problems in the field of art gallery theorems is to
- Some Properties of Yao Y4 Subgraphs Joseph O'Rourke
- Polygonal Chains: from Pocket Flipping to Protein Folding
- arXiv:cs.CG/9908005 Polygonal Chains Cannot Lock in 4D
- ORTHOGONAL POLYGONS 2.1. INTRODUCTION
- The Foldings of a Square to Convex Polyhedra Rebecca Alexander, Heather Dyson, and Joseph O'Rourke
- The Open Problems Project edited by Erik D. Demaine Joseph S. B. Mitchell
- Computational Geometry Column 51 Joseph O'Rourke
- arXiv:cs.CG/0006035v43Aug2006 On the Development of the Intersection
- CCCG 2008, Montreal, Quebec, August 1315, 2008 A Pumping Lemma for Homometric Rhythms
- Vertex -Lights for Monotone Mountains Joseph O'Rourke
- Discrete Comput Geom (2010) 44: 3554 DOI 10.1007/s00454-009-9223-x
- Flat Zipper-Unfolding Pairs for Platonic Solids Joseph O'Rourke
- The Open Problems Project edited by Erik D. Demaine Joseph S. B. Mitchell
- The Structure of Optimal Partitions of Orthogonal Polygons
- Coloring Objects Built From Bricks Suzanne Gallagher # Joseph O'Rourke +
- arXiv:cs.CG/0304025v118Apr2003 Computational Geometry Column 44
- arXiv:cs.CG/0407063v25Oct2004 Unfolding Smooth Primsatoids
- Epsilon-Unfolding Orthogonal Polyhedra Mirela Damian1
- arXiv:cs.CG/0108021 Computational Geometry Column 42
- arXiv:cs.CG/0110059 Nonorthogonal Polyhedra
- arXiv:cs.CG/0102004 Computational Geometry Column 41
- An Extension of Cauchy's Arm Lemma with Application to Curve Development
- PushPush is NPhard in 3D Joseph O'Rourke \Lambda
- On the Development of the Intersection of a Plane with a Polytope
- arXiv:cs.CG/0007042 Computational Geometry Column 39
- Interlocked Open and Closed Linkages with Few Joints
- On Corners of Objects Built from Parallelepiped Bricks Mirela Damian
- An Implementation of Chen & Han's Shortest Paths Algorithm
- On the Maximum Span of Fixed-Angle Chains Nadia Benbernou
- VISIBILITY GRAPHS 7.1. INTRODUCTION
- CONNECTING POLYGONIZATIONS VIA STRETCHES AND TWANGS MIRELA DAMIAN 1
- Source Unfoldings of Convex Polyhedra with respect to Certain Closed Polygonal Curves
- Unfolding Convex Polyhedra via Quasigeodesics Jin-ichi Itoh
- [GM91] S. K. Ghosh and D. M. Mount. An outputsensitive algorithm for computing visibility graphs. SIAM J. Comput., 20:888--910, 1991.
- Joseph O'Rourke http://cs.smith.edu/ orourke/
- arXiv:cs.CG/0410052v120Oct2004 A 2-CHAIN CAN INTERLOCK WITH A k-CHAIN
- 17th Fall Workshop on Computational Geometry, 2007 A New Lower Bound on Guard Placement for Wireless Localization
- Interlocked Open Linkages with Few Joints Erik D. Demaine
- Efficient Constant-Velocity Reconfiguration of Crystalline Robots
- THREE DIMENSIONS AND 10.1. INTRODUCTION
- 1 Introduction 1 2 Linkages 2
- On Flat Polyhedra deriving from Alexandrov's Theorem
- Unfolding Manhattan Towers 1 Mirela Damian a
- [1] J. Abello and K. Kumar. Visibility graphs and oriented matroids. In R. Tamassia and I. G. Tollis, editors, Graph Drawing (Proc. GD '94), volume 894 of Lecture Notes
- The Open Problems Project edited by Erik D. Demaine Joseph S. B. Mitchell
- Partitioning Orthogonal Polygons into Fat Rectangles Joseph O'Rourke \Lambda Irena Pashchenko \Lambda Geetika Tewari \Lambda
- Narrowing Light Rays with Mirrors Joseph O'Rourke \Lambda Octavia Petrovici \Lambda
- EXTERIOR VISIBILITY 6.1. INTRODUCTION
- Computational Geometry Column 36 Joseph O'Rourke \Lambda
- STAR UNFOLDING OF A POLYTOPE WITH APPLICATIONS \Lambda PANKAJ K. AGARWAL y , BORIS ARONOV z , JOSEPH O'ROURKE x , AND
- arXiv:cs.CG/0001025 Computational Geometry Column 38
- Computational Geometry Column 35 Joseph O'Rourke \Lambda
- ZeroParity Stabbing Information Joseph O'Rourke and Irena Pashchenko \Lambda
- VISIBILITY ALGORITHMS 8.1. INTRODUCTION
- Band Unfoldings and Prismatoids: A Counterexample
- Computational Geometry Column 30 Joseph O'Rourke \Lambda
- Vertex Lights for Monotone Mountains Joseph O'Rourke \Lambda
- Conical Existence of Closed Curves on Convex Polyhedra
- Grid Vertex-Unfolding Orthogonal Polyhedra Mirela Damian
- Computational Geometry Column 47 Joseph O'Rourke
- Source Unfoldings of Convex Polyhedra via Certain Closed Curves$
- Algorithmica manuscript No. (will be inserted by the editor)
- Cauchy's Arm Lemma on a Growing Sphere Zachary Abel
- Computational Geometry Column 34 Pankaj K. Agarwal \Lambda
- Unfolding Polyhedra Joseph O'Rourke
- A 2-CHAIN CAN INTERLOCK WITH AN OPEN 11-CHAIN
- CCCG 2011, Toronto ON, August 1012, 2011 Edge-guarding Orthogonal Polyhedra
- (TR # 011) 07/26/91 TECHNICAL REPORT
- EuroCG 2012, Assisi, Italy, March 1921, 2012 Refold Rigidity of Convex Polyhedra
