2008 |
185 | | Alex Benton,
Joseph O'Rourke:
A Class of Convex Polyhedra with Few Edge Unfoldings.
CCCG 2008 |
184 | | Joseph O'Rourke,
Perouz Taslakian,
Godfried T. Toussaint:
A Pumping Lemma for Homometric Rhythms.
CCCG 2008 |
183 | | Greg Aloupis,
Jean Cardinal,
Sébastien Collette,
Ferran Hurtado,
Stefan Langerman,
Joseph O'Rourke:
Draining a Polygon - or - Rolling a Ball out of a Polygon.
CCCG 2008 |
182 | | Prosenjit Bose,
Joseph O'Rourke,
Chang Shu,
Stefanie Wuhrer:
Isometric Morphing of Triangular Meshes.
CCCG 2008 |
181 | EE | Mirela Damian,
Robin Y. Flatland,
Joseph O'Rourke,
Suneeta Ramaswami:
Connecting Polygonizations via Stretches and Twangs.
STACS 2008: 217-228 |
180 | EE | Nadia Benbernou,
Joseph O'Rourke:
On the Maximum Span of Fixed-Angle Chains
CoRR abs/0801.0258: (2008) |
179 | EE | Alex Benton,
Joseph O'Rourke:
A Class of Convex Polyhedra with Few Edge Unfoldings
CoRR abs/0801.4019: (2008) |
178 | EE | Zachary Abel,
David Charlton,
Sébastien Collette,
Erik D. Demaine,
Martin L. Demaine,
Stefan Langerman,
Joseph O'Rourke,
Val Pinciu,
Godfried T. Toussaint:
Cauchy's Arm Lemma on a Growing Sphere
CoRR abs/0804.0986: (2008) |
177 | EE | Stefanie Wuhrer,
Prosenjit Bose,
Chang Shu,
Joseph O'Rourke,
Alan Brunton:
Morphing of Triangular Meshes in Shape Space
CoRR abs/0805.0162: (2008) |
176 | EE | Greg Aloupis,
Jean Cardinal,
Sébastien Collette,
Ferran Hurtado,
Stefan Langerman,
Joseph O'Rourke,
Belén Palop:
Highway Hull Revisited
CoRR abs/0806.1416: (2008) |
175 | EE | Jin-ichi Itoh,
Joseph O'Rourke,
Costin Vîlcu:
Unfolding Convex Polyhedra via Quasigeodesic Star Unfoldings
CoRR abs/0812.2257: (2008) |
174 | EE | Greg Aloupis,
Erik D. Demaine,
Stefan Langerman,
Pat Morin,
Joseph O'Rourke,
Ileana Streinu,
Godfried T. Toussaint:
Edge-unfolding nested polyhedral bands.
Comput. Geom. 39(1): 30-42 (2008) |
173 | EE | Mirela Damian,
Joseph O'Rourke:
On corners of objects built from parallelepiped bricks.
Comput. Geom. 39(1): 43-54 (2008) |
172 | EE | Mirela Damian,
Robin Y. Flatland,
Joseph O'Rourke:
Unfolding Manhattan Towers.
Comput. Geom. 40(2): 102-114 (2008) |
171 | EE | Mirela Damian,
Robin Y. Flatland,
Joseph O'Rourke:
Grid Vertex-Unfolding Orthogonal Polyhedra.
Discrete & Computational Geometry 39(1-3): 213-238 (2008) |
170 | EE | Joseph O'Rourke:
Computational geometry column 50.
SIGACT News 39(1): 73-76 (2008) |
169 | EE | Joseph O'Rourke:
Computational geometry column 51.
SIGACT News 39(3): 58-62 (2008) |
2007 |
168 | | Greg Aloupis,
Brad Ballinger,
Prosenjit Bose,
Mirela Damian,
Erik D. Demaine,
Martin L. Demaine,
Robin Y. Flatland,
Ferran Hurtado,
Stefan Langerman,
Joseph O'Rourke,
Perouz Taslakian,
Godfried T. Toussaint:
Vertex Pops and Popturns.
CCCG 2007: 137-140 |
167 | | Erik D. Demaine,
Joseph O'Rourke:
Open Problems from CCCG 2006.
CCCG 2007: 277-280 |
166 | | Alex Benton,
Joseph O'Rourke:
Unfolding Polyhedra via Cut-Tree Truncation.
CCCG 2007: 77-80 |
165 | EE | Greg Aloupis,
Sébastien Collette,
Mirela Damian,
Erik D. Demaine,
Robin Y. Flatland,
Stefan Langerman,
Joseph O'Rourke,
Suneeta Ramaswami,
Vera Sacristán Adinolfi,
Stefanie Wuhrer:
Linear Reconfiguration of Cube-Style Modular Robots.
ISAAC 2007: 208-219 |
164 | EE | Mirela Damian,
Robin Y. Flatland,
Joseph O'Rourke:
Unfolding Manhattan Towers
CoRR abs/0705.1541: (2007) |
163 | EE | Joseph O'Rourke:
Unfolding Orthogonal Terrains
CoRR abs/0707.0610: (2007) |
162 | EE | Jin-ichi Itoh,
Joseph O'Rourke,
Costin Vîlcu:
Unfolding Convex Polyhedra via Quasigeodesics
CoRR abs/0707.4258: (2007) |
161 | EE | Joseph O'Rourke:
Unfolding Restricted Convex Caps
CoRR abs/0709.1647: (2007) |
160 | EE | Mirela Damian,
Robin Y. Flatland,
Joseph O'Rourke,
Suneeta Ramaswami:
Connecting Polygonizations via Stretches and Twangs
CoRR abs/0709.1942: (2007) |
159 | EE | Mirela Damian,
Robin Y. Flatland,
Joseph O'Rourke,
Suneeta Ramaswami:
A New Lower Bound on Guard Placement for Wireless Localization
CoRR abs/0709.3554: (2007) |
158 | EE | Joseph O'Rourke:
Band Unfoldings and Prismatoids: A Counterexample
CoRR abs/0710.0811: (2007) |
157 | EE | Joseph O'Rourke:
Computational Geometry Column 48.
Int. J. Comput. Geometry Appl. 17(4): 397-399 (2007) |
156 | EE | Joseph O'Rourke:
Computational geometry column 49.
SIGACT News 38(2): 51-55 (2007) |
2006 |
155 | EE | Nadia Benbernou,
Joseph O'Rourke:
On the Maximum Span of Fixed-Angle Chains.
CCCG 2006 |
154 | EE | Erik D. Demaine,
Joseph O'Rourke:
Open Problems: Open Problems from CCCG 2005.
CCCG 2006 |
153 | EE | Erik D. Demaine,
Blaise Gassend,
Joseph O'Rourke,
Godfried T. Toussaint:
Polygons Flip Finitely: Flaws and a Fix.
CCCG 2006 |
152 | EE | Mirela Damian,
Robin Y. Flatland,
Joseph O'Rourke:
Grid Vertex-Unfolding Orthogonal Polyhedra.
STACS 2006: 264-276 |
151 | EE | Erik D. Demaine,
Stefan Langerman,
Joseph O'Rourke:
Geometric Restrictions on Producible Polygonal Protein Chains.
Algorithmica 44(2): 167-181 (2006) |
150 | EE | Mirela Damian,
Robin Y. Flatland,
Joseph O'Rourke:
Epsilon-Unfolding Orthogonal Polyhedra
CoRR abs/cs/0602095: (2006) |
149 | EE | Joseph O'Rourke:
Computational Geometry Column 47.
Int. J. Comput. Geometry Appl. 16(4): 373-375 (2006) |
148 | EE | Joseph O'Rourke:
Computational geometry column 47.
SIGACT News 37(2): 47-49 (2006) |
147 | EE | Joseph O'Rourke:
Computational geometry column 48.
SIGACT News 37(3): 55-57 (2006) |
2005 |
146 | EE | Mirela Damian,
Robin Y. Flatland,
Joseph O'Rourke:
Unfolding Manhattan Towers.
CCCG 2005: 211-214 |
145 | EE | Mirela Damian,
Robin Y. Flatland,
Joseph O'Rourke:
Grid Vertex-Unfolding Orthogonal Polyhedra
CoRR abs/cs/0509054: (2005) |
2004 |
144 | EE | Mirela Damian,
Joseph O'Rourke:
On corners of objects built from parallelepiped bricks.
CCCG 2004: 20-23 |
143 | EE | Greg Aloupis,
Erik D. Demaine,
Stefan Langerman,
Pat Morin,
Joseph O'Rourke,
Ileana Streinu,
Godfried T. Toussaint:
Unfolding polyhedral bands.
CCCG 2004: 60-63 |
142 | EE | Erik D. Demaine,
Satyan L. Devadoss,
Joseph S. B. Mitchell,
Joseph O'Rourke:
Continuous foldability of polygonal paper.
CCCG 2004: 64-67 |
141 | EE | Mirela Damian,
Joseph O'Rourke:
Partitioning Regular Polygons into Circular Pieces II:Nonconvex Partitions
CoRR abs/cs/0412095: (2004) |
140 | EE | Joseph O'Rourke:
Computational Geometry Column 45
CoRR cs.CG/0405034: (2004) |
139 | EE | Nadia Benbernou,
Patricia Cahn,
Joseph O'Rourke:
Unfolding Smooth Primsatoids
CoRR cs.CG/0407063: (2004) |
138 | EE | Julie Glass,
Stefan Langerman,
Joseph O'Rourke,
Jack Snoeyink,
Jianyuan K. Zhong:
A 2-chain can interlock with a k-chain
CoRR cs.CG/0410052: (2004) |
137 | EE | Joseph O'Rourke,
Geetika Tewari:
The structure of optimal partitions of orthogonal polygons into fat rectangles.
Comput. Geom. 28(1): 49-71 (2004) |
136 | EE | Joseph O'Rourke:
Computational Geometry Column 45.
Int. J. Comput. Geometry Appl. 14(3): 227-229 (2004) |
135 | EE | Joseph O'Rourke:
Computational geometry column 46.
Int. J. Comput. Geometry Appl. 14(6): 475-478 (2004) |
134 | EE | Joseph O'Rourke:
Computational geometry column 45.
SIGACT News 35(2): 71-73 (2004) |
133 | EE | Joseph O'Rourke:
Computational geometry column 46.
SIGACT News 35(3): 42-45 (2004) |
2003 |
132 | | Mirela Damian-Iordache,
Joseph O'Rourke:
Partitioning Regular Polygons into Circular Pieces I: Convex Partitions.
CCCG 2003: 43-46 |
131 | | Suzanne Gallagher,
Joseph O'Rourke:
Coloring Objects Built From Bricks.
CCCG 2003: 56-59 |
130 | EE | Erik D. Demaine,
Stefan Langerman,
Joseph O'Rourke:
Geometric Restrictions on Producible Polygonal Protein Chains.
ISAAC 2003: 395-404 |
129 | EE | Mirela Damian-Iordache,
Joseph O'Rourke:
Partitioning Regular Polygons into Circular Pieces I: Convex Partitions
CoRR cs.CG/0304023: (2003) |
128 | EE | Joseph O'Rourke:
Computational Geometry Column 44
CoRR cs.CG/0304025: (2003) |
127 | EE | Mirela Damian-Iordache,
Joseph O'Rourke:
A Note on Objects Built From Bricks without Corners
CoRR cs.CG/0307042: (2003) |
126 | | Joseph O'Rourke:
On the development of the intersection of a plane with a polytope.
Comput. Geom. 24(1): 3-10 (2003) |
125 | EE | Erik D. Demaine,
Martin L. Demaine,
Michael Hoffmann,
Joseph O'Rourke:
Pushing blocks is hard.
Comput. Geom. 26(1): 21-36 (2003) |
124 | EE | Erik D. Demaine,
Stefan Langerman,
Joseph O'Rourke,
Jack Snoeyink:
Interlocked open and closed linkages with few joints.
Comput. Geom. 26(1): 37-45 (2003) |
123 | EE | Joseph O'Rourke:
Computational Geometry Column 44.
Int. J. Comput. Geometry Appl. 13(3): 273-275 (2003) |
2002 |
122 | EE | Melody Donoso,
Joseph O'Rourke:
Nonorthogonal polyhedra built from rectangles.
CCCG 2002: 101-104 |
121 | EE | Greg Aloupis,
Erik D. Demaine,
Henk Meijer,
Joseph O'Rourke,
Ileana Streinu,
Godfried T. Toussaint:
On flat-state connectivity of chains with fixed acute angles.
CCCG 2002: 27-30 |
120 | EE | Erik D. Demaine,
Joseph O'Rourke:
Open problems from cccg 2001.
CCCG 2002 |
119 | EE | Joseph O'Rourke,
Geetika Tewari:
Partitioning orthogonal polygons into fat rectangles in polynomial time.
CCCG 2002: 97-100 |
118 | EE | Greg Aloupis,
Erik D. Demaine,
Vida Dujmovic,
Jeff Erickson,
Stefan Langerman,
Henk Meijer,
Joseph O'Rourke,
Mark H. Overmars,
Michael A. Soss,
Ileana Streinu,
Godfried T. Toussaint:
Flat-State Connectivity of Linkages under Dihedral Motions.
ISAAC 2002: 369-380 |
117 | EE | Rebecca Alexander,
Heather Dyson,
Joseph O'Rourke:
The Foldings of a Square to Convex Polyhedra.
JCDCG 2002: 38-50 |
116 | EE | Erik D. Demaine,
Stefan Langerman,
Joseph O'Rourke,
Jack Snoeyink:
Interlocked open linkages with few joints.
Symposium on Computational Geometry 2002: 189-198 |
115 | EE | Erik D. Demaine,
David Eppstein,
Jeff Erickson,
George W. Hart,
Joseph O'Rourke:
Vertex-unfoldings of simplicial manifolds.
Symposium on Computational Geometry 2002: 237-243 |
114 | EE | Joseph O'Rourke:
Computational Geometry Column 43
CoRR cs.CG/0203008: (2002) |
113 | EE | Erik D. Demaine,
Joseph O'Rourke:
Open Problems from CCCG 2002
CoRR cs.CG/0212050: (2002) |
112 | | Therese C. Biedl,
Erik D. Demaine,
Martin L. Demaine,
Sylvain Lazard,
Anna Lubiw,
Joseph O'Rourke,
Steve Robbins,
Ileana Streinu,
Godfried T. Toussaint,
Sue Whitesides:
A note on reconfiguring tree linkages: trees can lock.
Discrete Applied Mathematics 117(1-3): 293-297 (2002) |
111 | EE | Erik D. Demaine,
Martin L. Demaine,
Anna Lubiw,
Joseph O'Rourke:
Enumerating Foldings and Unfoldings Between Polygons and Polytopes.
Graphs and Combinatorics 18(1): 93-104 (2002) |
110 | EE | Joseph O'Rourke:
Computational Geometry Column 43.
Int. J. Comput. Geometry Appl. 12(3): 263-266 (2002) |
2001 |
109 | EE | Joseph O'Rourke,
Irena Pashchenko,
Geetika Tewari:
Partitioning orthogonal polygons into fat rectangles.
CCCG 2001: 133-136 |
108 | EE | Joseph O'Rourke,
Octavia Petrovici:
Narrowing light rays with mirrors.
CCCG 2001: 137-140 |
107 | EE | Erik D. Demaine,
Joseph O'Rourke:
Open problems from cccg 2000.
CCCG 2001: 185-187 |
106 | EE | Erik D. Demaine,
Stefan Langerman,
Joseph O'Rourke:
Short interlocked linkages.
CCCG 2001: 69-72 |
105 | EE | Joseph O'Rourke:
Computational Geometry Column 41
CoRR cs.CG/0102004: (2001) |
104 | EE | Erik D. Demaine,
David Eppstein,
Jeff Erickson,
George W. Hart,
Joseph O'Rourke:
Vertex-Unfoldings of Simplicial Polyhedra
CoRR cs.CG/0107023: (2001) |
103 | EE | Erik D. Demaine,
Martin L. Demaine,
Anna Lubiw,
Joseph O'Rourke:
Enumerating Foldings and Unfoldings between Polygons and Polytopes
CoRR cs.CG/0107024: (2001) |
102 | EE | Joseph S. B. Mitchell,
Joseph O'Rourke:
Computational Geometry Column 42
CoRR cs.CG/0108021: (2001) |
101 | EE | Erik D. Demaine,
David Eppstein,
Jeff Erickson,
George W. Hart,
Joseph O'Rourke:
Vertex-Unfoldings of Simplicial Manifolds
CoRR cs.CG/0110054: (2001) |
100 | EE | Melody Donoso,
Joseph O'Rourke:
Nonorthogonal Polyhedra Built from Rectangles
CoRR cs.CG/0110059: (2001) |
99 | | Roxana Cocan,
Joseph O'Rourke:
Polygonal chains cannot lock in 4D.
Comput. Geom. 20(3): 105-129 (2001) |
98 | EE | Therese C. Biedl,
Erik D. Demaine,
Martin L. Demaine,
Sylvain Lazard,
Anna Lubiw,
Joseph O'Rourke,
Mark H. Overmars,
Steve Robbins,
Ileana Streinu,
Godfried T. Toussaint,
Sue Whitesides:
Locked and Unlocked Polygonal Chains in Three Dimensions.
Discrete & Computational Geometry 26(3): 269-281 (2001) |
97 | | Joseph O'Rourke:
Computational Geometry Column 41.
Int. J. Comput. Geometry Appl. 11(2): 239-242 (2001) |
96 | | Joseph S. B. Mitchell,
Joseph O'Rourke:
Computational Geometry Column 42.
Int. J. Comput. Geometry Appl. 11(5): 573-582 (2001) |
2000 |
95 | EE | Biliana Kaneva,
Joseph O'Rourke:
An Implementation of Chen & Han's Shortest Paths Algorithm.
CCCG 2000 |
94 | EE | Erik D. Demaine,
Martin L. Demaine,
Joseph O'Rourke:
PushPush and Push-1 are NP-hard in 2D.
CCCG 2000 |
93 | EE | Erik D. Demaine,
Joseph O'Rourke:
Session O1: Open Problems and Planning.
CCCG 2000 |
92 | EE | Joseph O'Rourke:
An Extension of Cauchy's Arm Lemma with Application to Curve Development.
JCDCG 2000: 280-291 |
91 | EE | Erik D. Demaine,
Martin L. Demaine,
Joseph O'Rourke:
PushPush is NP-hard in 2D
CoRR cs.CG/0001019: (2000) |
90 | EE | Joseph O'Rourke:
Computational Geometry Column 38
CoRR cs.CG/0001025: (2000) |
89 | EE | Joseph O'Rourke:
On the Development of the Intersection of a Plane with a Polytope
CoRR cs.CG/0006035: (2000) |
88 | EE | Erik D. Demaine,
Martin L. Demaine,
Anna Lubiw,
Joseph O'Rourke:
Examples, Counterexamples, and Enumeration Results for Foldings and Unfoldings between Polygons and Polytopes
CoRR cs.CG/0007019: (2000) |
87 | EE | Erik D. Demaine,
Martin L. Demaine,
Joseph O'Rourke:
PushPush and Push-1 are NP-hard in 2D
CoRR cs.CG/0007021: (2000) |
86 | EE | Joseph O'Rourke:
Computational Geometry Column 39
CoRR cs.CG/0007042: (2000) |
85 | EE | Joseph O'Rourke:
Computational Geometry Column 40
CoRR cs.CG/0010039: (2000) |
84 | | Erik D. Demaine,
Joseph O'Rourke:
Computational Geometry Column 37.
Int. J. Comput. Geometry Appl. 10(1): 103-107 (2000) |
83 | | Joseph O'Rourke:
Computational Geometry Column 38.
Int. J. Comput. Geometry Appl. 10(2): 221-223 (2000) |
82 | | Joseph O'Rourke:
Computational Geometry Column 39.
Int. J. Comput. Geometry Appl. 10(4): 441-444 (2000) |
81 | | Joseph O'Rourke:
Computational Geometry Column 40.
Int. J. Comput. Geometry Appl. 10(6): 649-651 (2000) |
1999 |
80 | EE | Roxana Cocan,
Joseph O'Rourke:
Polygonal chains cannot lock in 4d.
CCCG 1999 |
79 | EE | Therese C. Biedl,
Erik D. Demaine,
Martin L. Demaine,
Sylvain Lazard,
Anna Lubiw,
Joseph O'Rourke,
Mark H. Overmars,
Steve Robbins,
Ileana Streinu,
Godfried T. Toussaint,
Sue Whitesides:
Locked and Unlocked Polygonal Chains in 3D.
SODA 1999: 866-867 |
78 | EE | Erik D. Demaine,
Martin L. Demaine,
Anna Lubiw,
Joseph O'Rourke,
Irena Pashchenko:
Metamorphosis of the Cube.
Symposium on Computational Geometry 1999: 409-410 |
77 | EE | Joseph O'Rourke,
Irena Pashchenko:
Zero-Parity Stabbing Information
CoRR cs.CG/9906022: (1999) |
76 | EE | Joseph O'Rourke:
Computational Geometry Column 35
CoRR cs.CG/9906023: (1999) |
75 | EE | Roxana Cocan,
Joseph O'Rourke:
Polygonal Chains Cannot Lock in 4D
CoRR cs.CG/9908005: (1999) |
74 | EE | Joseph O'Rourke:
Computational Geometry Column 36
CoRR cs.CG/9908006: (1999) |
73 | EE | Erik D. Demaine,
Joseph O'Rourke:
Computational Geometry Column 37
CoRR cs.CG/9908007: (1999) |
72 | EE | Therese C. Biedl,
Erik D. Demaine,
Martin L. Demaine,
Sylvain Lazard,
Anna Lubiw,
Joseph O'Rourke,
Mark H. Overmars,
Steve Robbins,
Ileana Streinu,
Godfried T. Toussaint,
Sue Whitesides:
Locked and Unlocked Polygonal Chains in 3D
CoRR cs.CG/9910009: (1999) |
71 | EE | Therese C. Biedl,
Erik D. Demaine,
Martin L. Demaine,
Sylvain Lazard,
Anna Lubiw,
Joseph O'Rourke,
Steve Robbins,
Ileana Streinu,
Godfried T. Toussaint,
Sue Whitesides:
On Reconfiguring Tree Linkages: Trees can Lock
CoRR cs.CG/9910024: (1999) |
70 | EE | Joseph O'Rourke,
Beenish Chaudry,
Sorina Chircu,
Elizabeth F. Churchill,
Sasha Fedorova,
Judy A. Franklin,
Biliana Kaneva,
Halley Miller,
Anton Okmianski,
Irena Pashchenko,
Ileana Streinu,
Geetika Tewari,
Dominique Thiébaut,
Elif Tosun:
PushPush is NP-hard in 3D
CoRR cs.CG/9911013: (1999) |
69 | | Joseph O'Rourke:
Computational Geometry Column 35.
Int. J. Comput. Geometry Appl. 9(4/5): 513- (1999) |
68 | | Joseph O'Rourke:
Computational Geometry Column 36.
Int. J. Comput. Geometry Appl. 9(6): 615-618 (1999) |
67 | | Samir Khuller,
Pankaj K. Agarwal,
Joseph O'Rourke:
Open Problems Presented at SCG'98.
J. Algorithms 30(2): 449-453 (1999) |
1998 |
66 | EE | Therese C. Biedl,
Erik D. Demaine,
Martin L. Demaine,
Sylvain Lazard,
Anna Lubiw,
Joseph O'Rourke,
Steve Robbins,
Ileana Streinu,
Godfried T. Toussaint,
Sue Whitesides:
On reconfiguring tree linkages: Trees can lock.
CCCG 1998 |
65 | EE | Therese C. Biedl,
Erik D. Demaine,
Martin L. Demaine,
Anna Lubiw,
Mark H. Overmars,
Joseph O'Rourke,
Steve Robbins,
Sue Whitesides:
Unfolding some classes of orthogonal polyhedra.
CCCG 1998 |
64 | | Joseph O'Rourke:
Folding and Unfolding in Computational Geometry.
JCDCG 1998: 258-266 |
63 | EE | Pankaj K. Agarwal,
Joseph O'Rourke:
Computational Geometry Column 34
CoRR cs.CG/9808008: (1998) |
62 | EE | Joseph O'Rourke:
Computational Geometry Column 33
CoRR cs.CG/9810020: (1998) |
61 | EE | Joseph O'Rourke:
Computational Geometry Column 32
CoRR cs.CG/9810021: (1998) |
60 | EE | Therese C. Biedl,
Erik D. Demaine,
Martin L. Demaine,
Sylvain Lazard,
Anna Lubiw,
Joseph O'Rourke,
Mark H. Overmars,
Steve Robbins,
Ileana Streinu,
Godfried T. Toussaint,
Sue Whitesides:
Locked and Unlocked Polygonal Chains in 3D
CoRR cs.CG/9811019: (1998) |
59 | | Joseph O'Rourke,
Ileana Streinu:
The vertex-edge visibility graph of a polygon.
Comput. Geom. 10(2): 105-120 (1998) |
58 | | Joseph O'Rourke:
Computational geometry column 33.
Int. J. Comput. Geometry Appl. 8(3): 381-384 (1998) |
57 | | Pankaj K. Agarwal,
Joseph O'Rourke:
Computational Geometry Column 34.
Int. J. Comput. Geometry Appl. 8(5/6): 637- (1998) |
1997 |
56 | | Joseph O'Rourke:
Vertex pi-lights for monotone mountains.
CCCG 1997 |
55 | EE | Joseph O'Rourke,
Ileana Streinu:
Vertex-Edge Pseudo-Visibility Graphs: Characterization and Recognition.
Symposium on Computational Geometry 1997: 119-128 |
54 | | Joseph O'Rourke:
Computational Geometry Column 30.
Int. J. Comput. Geometry Appl. 7(1/2): 165-166 (1997) |
53 | | Joseph O'Rourke:
Computational Geometry Column 31.
Int. J. Comput. Geometry Appl. 7(4): 379-382 (1997) |
52 | | Joseph O'Rourke:
Computational Geometry Column 32.
Int. J. Comput. Geometry Appl. 7(5): 509-513 (1997) |
51 | | Pankaj K. Agarwal,
Boris Aronov,
Joseph O'Rourke,
Catherine A. Schevon:
Star Unfolding of a Polytope with Applications.
SIAM J. Comput. 26(6): 1689-1713 (1997) |
1996 |
50 | | C. Gitlin,
Joseph O'Rourke,
V. Subramanian:
On reconstructing polyhedra from parallel slices.
Int. J. Comput. Geometry Appl. 6(1): 103-122 (1996) |
49 | | Joseph O'Rourke:
Computational geometry column 27.
Int. J. Comput. Geometry Appl. 6(1): 123-125 (1996) |
48 | | Joseph O'Rourke:
Computational geometry column 28.
Int. J. Comput. Geometry Appl. 6(2): 243-244 (1996) |
47 | | Joseph O'Rourke:
Computational geometry column 29.
Int. J. Comput. Geometry Appl. 6(4): 507-511 (1996) |
1995 |
46 | EE | Vladimir Estivill-Castro,
Joseph O'Rourke,
Jorge Urrutia,
Dianna Xu:
Illumination of Polygons with Vertex Lights.
Inf. Process. Lett. 56(1): 9-13 (1995) |
45 | | Joseph O'Rourke:
Computational geometry column 25.
Int. J. Comput. Geometry Appl. 5: 215-218 (1995) |
44 | | Joseph O'Rourke:
Computational geometry column 26.
Int. J. Comput. Geometry Appl. 5(3): 339-341 (1995) |
1994 |
43 | | Joseph O'Rourke:
On the Scaling Heuristic for Reconstruction from Slices.
CVGIP: Graphical Model and Image Processing 56(5): 420-423 (1994) |
42 | | Joseph O'Rourke,
Jennifer Rippel:
Two Segment Classes with Hamiltonian Visibility Graphs.
Comput. Geom. 4: 209-218 (1994) |
41 | | Joseph O'Rourke:
Computational geometry column 22.
Int. J. Comput. Geometry Appl. 4(1): 119-122 (1994) |
40 | | Joseph O'Rourke:
Computational geometry column 23.
Int. J. Comput. Geometry Appl. 4(2): 239-242 (1994) |
39 | | Joseph O'Rourke:
Computational geometry column 24.
Int. J. Comput. Geometry Appl. 4(3): 363-366 (1994) |
38 | | Matthew Díaz,
Joseph O'Rourke:
Algorithms for computing the center of area of a convex polygon.
The Visual Computer 10(8): 432-442 (1994) |
1993 |
37 | | Hazel Everett,
Anna Lubiw,
Joseph O'Rourke:
Recovery of Convex Hulls From External Visibility Graphs.
CCCG 1993: 309-314 |
36 | | Joseph O'Rourke:
Daniel C. Dennett, Consciousness Explained; Robert Ornstein, The Evolution of Consciousness: Of Darwin, Freud, and Cranial Fire: The Origins of the Way We Think; William Seager, Metaphysics of Consciousness.
Artif. Intell. 60(2): 303-312 (1993) |
35 | | Joseph O'Rourke:
Computational geometry column 18.
Int. J. Comput. Geometry Appl. 3(1): 107-113 (1993) |
34 | | Joseph O'Rourke:
Computational geometry column 19.
Int. J. Comput. Geometry Appl. 3(2): 221-224 (1993) |
33 | | Joseph O'Rourke:
Computational geometry column 20.
Int. J. Comput. Geometry Appl. 3(3): 347-349 (1993) |
32 | | Joseph O'Rourke:
Computational geometry column 21.
Int. J. Comput. Geometry Appl. 3(4): 463-465 (1993) |
1992 |
31 | | Boris Aronov,
Joseph O'Rourke:
Nonoverlap of the Star Unfolding.
Discrete & Computational Geometry 8: 219-250 (1992) |
30 | | Joseph O'Rourke:
Computational geometry column 15.
Int. J. Comput. Geometry Appl. 2(2): 215-217 (1992) |
29 | | Joseph O'Rourke:
Computational geometry column 16.
Int. J. Comput. Geometry Appl. 2(3): 335-339 (1992) |
28 | | Joseph O'Rourke:
Computational geometry column 17.
Int. J. Comput. Geometry Appl. 2(4): 443-447 (1992) |
1991 |
27 | EE | Boris Aronov,
Joseph O'Rourke:
Nonoverlap of the Star Unfolding.
Symposium on Computational Geometry 1991: 105-114 |
26 | | Joseph O'Rourke:
Computational geometry column 11.
Int. J. Comput. Geometry Appl. 1(1): 93-98 (1991) |
25 | | Joseph O'Rourke:
Computational geometry column 12.
Int. J. Comput. Geometry Appl. 1(2): 197-200 (1991) |
24 | | Joseph O'Rourke:
Computational geometry column 13.
Int. J. Comput. Geometry Appl. 1(3): 341-343 (1991) |
23 | | Joseph O'Rourke:
Computational geometry column 14.
Int. J. Comput. Geometry Appl. 1(4): 517-522 (1991) |
1990 |
22 | | Pankaj K. Agarwal,
Boris Aronov,
Joseph O'Rourke,
Catherine A. Schevon:
Star Unfolding of a Polytope with Applications (Extended Abstract).
SWAT 1990: 251-263 |
1989 |
21 | EE | Joseph O'Rourke,
Catherine A. Schevon:
Computing the Geodesic Diameter of a 3-Polytope.
Symposium on Computational Geometry 1989: 370-379 |
20 | | Yan Ke,
Joseph O'Rourke:
Computing the Kernel of a Point Set in a Polygon (Extended Abstract).
WADS 1989: 135-146 |
19 | | Matthew Díaz,
Joseph O'Rourke:
Computing the Center of Area of a Polygon.
WADS 1989: 171-182 |
18 | | Alok Aggarwal,
Heather Booth,
Joseph O'Rourke,
Subhash Suri,
Chee-Keng Yap:
Finding Minimal Convex Nested Polygons
Inf. Comput. 83(1): 98-110 (1989) |
1988 |
17 | EE | M. McKenna,
Joseph O'Rourke:
Arrangements of Lines in 3-Space: A Data Structure with Applications.
Symposium on Computational Geometry 1988: 371-380 |
16 | | Yan Ke,
Joseph O'Rourke:
Lower Bounds on Moving a Ladder in Two and Three Dimensions.
Discrete & Computational Geometry 3: 197-217 (1988) |
1987 |
15 | EE | Yan Ke,
Joseph O'Rourke:
Moving a Ladder in Three Dimensions: Upper and Lower Bounds.
Symposium on Computational Geometry 1987: 136-146 |
1986 |
14 | EE | Subhash Suri,
Joseph O'Rourke:
Worst-Case Optimal Algorithms for Constructing Visibility Polygons with Holes.
Symposium on Computational Geometry 1986: 14-23 |
13 | | Joseph O'Rourke,
Alok Aggarwal,
Sanjeev R. Maddila,
Michael Baldwin:
An Optimal Algorithm for Finding Minimal Enclosing Triangles.
J. Algorithms 7(2): 258-269 (1986) |
12 | | Joseph O'Rourke:
The Signature of a Plane Curve.
SIAM J. Comput. 15(1): 34-51 (1986) |
11 | | Herbert Edelsbrunner,
Joseph O'Rourke,
Raimund Seidel:
Constructing Arrangements of Lines and Hyperplanes with Applications.
SIAM J. Comput. 15(2): 341-363 (1986) |
1985 |
10 | | Joseph O'Rourke,
Subhash Suri,
Heather Booth:
Shortest Paths on Polyhedral Surfaces.
STACS 1985: 243-254 |
9 | EE | Joseph O'Rourke:
Counterexamples to a minimal circumscription algorithm.
Computer Vision, Graphics, and Image Processing 30(3): 364-366 (1985) |
1983 |
8 | | Herbert Edelsbrunner,
Joseph O'Rourke,
Raimund Seidel:
Constructing Arrangements of Lines and Hyperplanes with Applications
FOCS 1983: 83-91 |
7 | | T. C. Addison,
S. Y. Lee,
Joseph O'Rourke:
The MEDITS Software Tools to Support Special Services System Engineering.
INFOCOM 1983: 600-607 |
6 | | Joseph O'Rourke,
Kenneth J. Supowit:
Some NP-hard polygon decomposition problems.
IEEE Transactions on Information Theory 29(2): 181-189 (1983) |
1982 |
5 | EE | Joseph O'Rourke:
Computing the relative neighborhood graph in the L1 and Linfinity metrics .
Pattern Recognition 15(3): 189-192 (1982) |
1981 |
4 | | Joseph O'Rourke:
Polyhedra of Minimal Area as 3D Object Models.
IJCAI 1981: 664-666 |
3 | | Joseph O'Rourke:
Dynamically Quantized Spaces for Focusing the Hough Transform.
IJCAI 1981: 737-739 |
2 | | Joseph O'Rourke:
An On-Line Algorithm for Fitting Straight Lines Between Data Ranges.
Commun. ACM 24(9): 574-578 (1981) |
1980 |
1 | | Norman I. Badler,
Joseph O'Rourke,
Stephen Platt,
Mary A. Morris:
Human Movement Understanding: A Variety of Perspectives.
AAAI 1980: 53-55 |