default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJoseph O'Rourke
Person information
- affiliation: Smith College, Department of Computer Science
- affiliation: Johns Hopkins University, Department of Computer Science
- affiliation: University of Pennsylvania, Department of Computer and Information Science
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[i84]MIT CompGeom Group, Hugo A. Akitaya, Erik D. Demaine, Adam Hesterberg, Anna Lubiw, Jayson Lynch, Joseph O'Rourke, Frederick Stock:
Super Guarding and Dark Rays in Art Galleries. CoRR abs/2404.04613 (2024)- 2023
- [j135]Joseph O'Rourke
, Costin Vîlcu:
Cut locus realizations on convex polyhedra. Comput. Geom. 114: 102010 (2023) - [c87]Joseph O'Rourke, Hugo A. Akitaya, Erik D. Demaine, Adam Hesterberg, Anna Lubiw, Jayson Lynch, Frederick Stock:
Super Guarding and Dark Rays in Art Galleries. CCCG 2023: 51-61 - [c86]Joseph O'Rourke:
Every Combinatorial Polyhedron Can Unfold with Overlap. CCCG 2023: 257-263 - [i83]Joseph O'Rourke:
Polar Zonohedra Edge-Unfold to Nets. CoRR abs/2302.07747 (2023) - [i82]Joseph O'Rourke, Costin Vîlcu:
Skeletal Cut Loci on Convex Polyhedra. CoRR abs/2312.01534 (2023) - 2022
- [j134]Joseph O'Rourke, Costin Vîlcu:
Simple Closed Quasigeodesics on Tetrahedra. Inf. 13(5): 238 (2022) - [c85]Joseph O'Rourke, Anna Lubiw, Ryuhei Uehara, Chie Nara, Thomas C. Hull, Klara Mundilova, Josef Tkadlec:
Quasi-Twisting Convex Polyhedra. CCCG 2022: 270-276 - [c84]Akira Baes, Erik D. Demaine, Martin L. Demaine, Elizabeth Hartung, Stefan Langerman, Joseph O'Rourke, Ryuhei Uehara, Yushi Uno, Aaron Williams:
Rolling Polyhedra on Tessellations. FUN 2022: 6:1-6:16 - [i81]Joseph O'Rourke, Costin Vîlcu:
Simple Closed Quasigeodesics on Tetrahedra. CoRR abs/2203.04745 (2022) - [i80]Joseph O'Rourke:
Hamiltonian Quasigeodesics yield Nets. CoRR abs/2206.05353 (2022) - [i79]Joseph O'Rourke:
Every Combinatorial Polyhedron Can Unfold with Overlap. CoRR abs/2212.14721 (2022) - 2021
- [c83]Joseph O'Rourke, Costin Vîlcu:
Cut Locus Realizations on Convex Polyhedra. CCCG 2021: 279-285 - [i78]Joseph O'Rourke, Costin Vîlcu:
Cut Locus Realizations on Convex Polyhedra. CoRR abs/2102.11097 (2021) - [i77]Joseph O'Rourke, Costin Vîlcu:
Reshaping Convex Polyhedra. CoRR abs/2107.03153 (2021) - 2020
- [c82]Erik D. Demaine, Martin L. Demaine, David Eppstein, Joseph O'Rourke:
Some Polycubes Have No Edge Zipper Unfolding. CCCG 2020: 101-105 - [c81]Joseph O'Rourke:
Vertex-Transplants on a Convex Polyhedron. CCCG 2020: 128-133 - [i76]Joseph O'Rourke:
A Note on Unbounded Polyhedra Derived from Convex Caps. CoRR abs/2002.06418 (2020) - [i75]Joseph O'Rourke, Costin Vîlcu:
Tailoring for Every Body: Reshaping Convex Polyhedra. CoRR abs/2008.01759 (2020)
2010 – 2019
- 2019
- [c80]Joseph O'Rourke:
Unfolding Polyhedra. CCCG 2019: 85 - [i74]Erik D. Demaine, Martin L. Demaine, David Eppstein, Joseph O'Rourke:
Some Polycubes Have No Edge-Unzipping. CoRR abs/1907.08433 (2019) - [i73]Joseph O'Rourke:
Unfolding Polyhedra. CoRR abs/1908.07152 (2019) - 2018
- [c79]Joseph O'Rourke:
Open Problems from CCCG 2017. CCCG 2018: 149-154 - [c78]Joseph O'Rourke, Emmely Rogers:
Threadable Curves. CCCG 2018: 328-333 - [c77]Joseph O'Rourke:
Edge-Unfolding Nearly Flat Convex Caps. SoCG 2018: 64:1-64:14 - [c76]Hugo A. Akitaya, Brad Ballinger, Mirela Damian, Erik D. Demaine, Martin L. Demaine, Robin Y. Flatland, Irina Kostitsyna, Jason S. Ku, Stefan Langerman, Joseph O'Rourke, Ryuhei Uehara:
Toward Unfolding Doubly Covered n-Stars. JCDCGGG 2018: 122-135 - [i72]Joseph O'Rourke, Emmely Rogers:
Threadable Curves. CoRR abs/1801.08003 (2018) - [i71]Joseph O'Rourke:
Un-unzippable Convex Caps. CoRR abs/1802.01621 (2018) - 2017
- [j133]Mirela Damian, Erik D. Demaine, Robin Y. Flatland, Joseph O'Rourke:
Unfolding Genus-2 Orthogonal Polyhedra with Linear Refinement. Graphs Comb. 33(5): 1357-1379 (2017) - [c75]Anna Lubiw, Joseph O'Rourke:
Angle-monotone Paths in Non-obtuse Triangulations. CCCG 2017: 25-30 - [c74]Joseph O'Rourke:
Open Problems from CCCG 2016. CCCG 2017: 73-76 - [i70]Anna Lubiw, Joseph O'Rourke:
Angle-monotone Paths in Non-obtuse Triangulations. CoRR abs/1707.00219 (2017) - [i69]Joseph O'Rourke:
Edge-Unfolding Nearly Flat Convex Caps. CoRR abs/1707.01006 (2017) - [i68]Joseph O'Rourke:
Addendum to: Edge-Unfolding Nearly Flat Convex Caps. CoRR abs/1709.02433 (2017) - 2016
- [i67]Joseph O'Rourke:
Unfolding Convex Polyhedra via Radially Monotone Cut Trees. CoRR abs/1607.07421 (2016) - [i66]Mirela Damian, Erik D. Demaine, Robin Y. Flatland, Joseph O'Rourke:
Unfolding Genus-2 Orthogonal Polyhedra with Linear Refinement. CoRR abs/1611.00106 (2016) - 2015
- [j132]Emilie Hogan, Joseph O'Rourke, Cindy Traub, Ellen Veomett:
On coloring box graphs. Discret. Math. 338(2): 209-216 (2015) - [j131]Luis Barba, Prosenjit Bose, Mirela Damian, Rolf Fagerberg, Wah Loon Keng, Joseph O'Rourke, André van Renssen, Perouz Taslakian, Sander Verdonschot, Ge Xia:
New and improved spanning ratios for Yao graphs. J. Comput. Geom. 6(2): 19-53 (2015) - [i65]Joseph O'Rourke:
Spiral Unfoldings of Convex Polyhedra. CoRR abs/1509.00321 (2015) - [i64]Giovanna Diaz, Joseph O'Rourke:
Hypercube Unfoldings that Tile R^3 and R^2. CoRR abs/1512.02086 (2015) - 2014
- [j130]Joseph O'Rourke, Costin Vîlcu:
Development of curves on polyhedra via conical existence. Comput. Geom. 47(2): 149-163 (2014) - [j129]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. Comput. Geom. 47(2): 316-328 (2014) - [j128]Erik D. Demaine, Martin L. Demaine, Jin-ichi Itoh, Anna Lubiw, Chie Nara, Joseph O'Rourke:
Reprint of: Refold rigidity of convex polyhedra. Comput. Geom. 47(3): 507-517 (2014) - [c73]Luis Barba, Prosenjit Bose, Mirela Damian, Rolf Fagerberg, Wah Loon Keng, Joseph O'Rourke, André van Renssen, Perouz Taslakian, Sander Verdonschot, Ge Xia:
New and Improved Spanning Ratios for Yao Graphs. SoCG 2014: 30 - [c72]Zachary Abel, Erik D. Demaine, Martin L. Demaine, Jin-ichi Itoh, Anna Lubiw, Chie Nara, Joseph O'Rourke:
Continuously Flattening Polyhedra Using Straight Skeletons. SoCG 2014: 396 - 2013
- [j127]Erik D. Demaine, Martin L. Demaine, Jin-ichi Itoh, Anna Lubiw, Chie Nara, Joseph O'Rourke:
Refold rigidity of convex polyhedra. Comput. Geom. 46(8): 979-989 (2013) - [c71]Joseph O'Rourke:
Unfolding Face-Neighborhood Convex Patches: Counterexamples and Positive Results. CCCG 2013 - [i63]Luis Barba, Prosenjit Bose, Mirela Damian, Rolf Fagerberg, Joseph O'Rourke, André van Renssen, Perouz Taslakian, Sander Verdonschot:
New and Improved Spanning Ratios for Yao Graphs. CoRR abs/1307.5829 (2013) - [i62]Bin Lu, Joseph O'Rourke, Jianyuan K. Zhong:
A 2-chain can interlock with an open 10-chain. CoRR abs/1308.4186 (2013) - 2012
- [j126]Prosenjit Bose, Mirela Damian, Karim Douïeb, Joseph O'Rourke, Ben Seamone, Michiel H. M. Smid, Stefanie Wuhrer:
π/2-Angle Yao Graphs are Spanners. Int. J. Comput. Geom. Appl. 22(1): 61-82 (2012) - [j125]Joseph O'Rourke:
Computational geometry column 52. SIGACT News 43(1): 82-85 (2012) - [i61]Jin-ichi Itoh, Joseph O'Rourke, Costin Vîlcu:
Source Unfoldings of Convex Polyhedra via Certain Closed Curves. CoRR abs/1205.0963 (2012) - [i60]Joseph O'Rourke:
Unfolding Prismatoids as Convex Patches: Counterexamples and Positive Results. CoRR abs/1205.2048 (2012) - [i59]Stephanie Jakus, Joseph O'Rourke:
From Pop-Up Cards to Coffee-Cup Caustics: The Knight's Visor. CoRR abs/1206.1312 (2012) - 2011
- [b2]Satyan L. Devadoss, Joseph O'Rourke:
Discrete and Computational Geometry. Princeton University Press 2011, ISBN 978-0-691-14553-2, pp. I-XI, 1-255 - [j124]Erik D. Demaine, Martin L. Demaine, Vi Hart, John Iacono, Stefan Langerman, Joseph O'Rourke:
Continuous Blooming of Convex Polyhedra. Graphs Comb. 27(3): 363-376 (2011) - [j123]Greg Aloupis, Sébastien Collette, Mirela Damian, Erik D. Demaine, Robin Y. Flatland, Stefan Langerman, Joseph O'Rourke, Val Pinciu, Suneeta Ramaswami, Vera Sacristán, Stefanie Wuhrer:
Efficient constant-velocity reconfiguration of crystalline robots. Robotica 29(1): 59-71 (2011) - [c70]Joseph O'Rourke, Costin Vîlcu:
Development of Curves on Polyhedra via Conical Existence. CCCG 2011 - [c69]Giovanni Viglietta, Nadia M. Benbernou, Erik D. Demaine, Martin L. Demaine, Anastasia Kurdia, Joseph O'Rourke, Godfried T. Toussaint, Jorge Urrutia:
Edge-guarding Orthogonal Polyhedra. CCCG 2011 - [c68]Joseph O'Rourke:
String-Wrapped Rotating Disks. EGC 2011: 65-78 - [i58]Joseph O'Rourke:
Convex Polyhedra Realizing Given Face Areas. CoRR abs/1101.0823 (2011) - [i57]Joseph O'Rourke, Costin Vîlcu:
Conical Existence of Closed Curves on Convex Polyhedra. CoRR abs/1102.0823 (2011) - [i56]Joseph O'Rourke:
Common Edge-Unzippings for Tetrahedra. CoRR abs/1105.5401 (2011) - 2010
- [j122]Greg Aloupis, Jean Cardinal, Sébastien Collette, Ferran Hurtado, Stefan Langerman, Joseph O'Rourke, Belén Palop:
Highway hull revisited. Comput. Geom. 43(2): 115-130 (2010) - [j121]Jin-ichi Itoh, Joseph O'Rourke, Costin Vîlcu:
Star Unfolding Convex Polyhedra via Quasigeodesic Loops. Discret. Comput. Geom. 44(1): 35-54 (2010) - [j120]Stefanie Wuhrer, Prosenjit Bose, Chang Shu, Joseph O'Rourke, Alan Brunton:
Morphing of Triangular Meshes in Shape Space. Int. J. Shape Model. 16(1-2): 195-212 (2010) - [j119]Mirela Damian, Robin Y. Flatland, Joseph O'Rourke, Suneeta Ramaswami:
Connecting Polygonizations via Stretches and Twangs. Theory Comput. Syst. 47(3): 674-695 (2010) - [c67]Erik D. Demaine, Joseph O'Rourke:
Open problem session. CCCG 2010: 83-86 - [c66]Yonit Bousany, Mary Leah Karker, Joseph O'Rourke, Leona Sparaco:
Sweeping minimum perimeter enclosing parallelograms: Optimal crumb cleanup. CCCG 2010: 167-170 - [c65]Prosenjit Bose, Mirela Damian, Karim Douïeb, Joseph O'Rourke, Ben Seamone, Michiel H. M. Smid, Stefanie Wuhrer:
pi/2-Angle Yao Graphs Are Spanners. ISAAC (2) 2010: 446-457 - [i55]Prosenjit Bose, Mirela Damian, Karim Douïeb, Joseph O'Rourke, Ben Seamone, Michiel H. M. Smid, Stefanie Wuhrer:
Pi/2-Angle Yao Graphs are Spanners. CoRR abs/1001.2913 (2010) - [i54]Joseph O'Rourke:
On Flat Polyhedra deriving from Alexandrov's Theorem. CoRR abs/1007.2016 (2010) - [i53]Joseph O'Rourke:
On Folding a Polygon to a Polyhedron. CoRR abs/1007.3181 (2010) - [i52]Joseph O'Rourke:
Flat Zipper-Unfolding Pairs for Platonic Solids. CoRR abs/1010.2450 (2010) - [i51]Joseph O'Rourke:
A Note on Solid Coloring of Pure Simplicial Complexes. CoRR abs/1012.4017 (2010)
2000 – 2009
- 2009
- [j118]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. Comput. Geom. 42(6-7): 652-663 (2009) - [c64]Erik D. Demaine, Joseph O'Rourke:
Open Problems from CCCG 2008. CCCG 2009: 75-78 - [i50]Joseph O'Rourke:
Some Properties of Yao Y4 Subgraphs. CoRR abs/0905.2249 (2009) - [i49]Erik D. Demaine, Martin L. Demaine, Vi Hart, John Iacono, Stefan Langerman, Joseph O'Rourke:
Continuous Blooming of Convex Polyhedra. CoRR abs/0906.2461 (2009) - 2008
- [j117]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) - [j116]Mirela Damian, Joseph O'Rourke:
On corners of objects built from parallelepiped bricks. Comput. Geom. 39(1): 43-54 (2008) - [j115]Mirela Damian, Robin Y. Flatland, Joseph O'Rourke:
Unfolding Manhattan Towers. Comput. Geom. 40(2): 102-114 (2008) - [j114]Mirela Damian, Robin Y. Flatland, Joseph O'Rourke:
Grid Vertex-Unfolding Orthogonal Polyhedra. Discret. Comput. Geom. 39(1-3): 213-238 (2008) - [j113]Joseph O'Rourke:
Computational geometry column 50. SIGACT News 39(1): 73-76 (2008) - [j112]Joseph O'Rourke:
Computational geometry column 51. SIGACT News 39(3): 58-62 (2008) - [c63]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 - [c62]Alex Benton, Joseph O'Rourke:
A Class of Convex Polyhedra with Few Edge Unfoldings. CCCG 2008 - [c61]Prosenjit Bose, Joseph O'Rourke, Chang Shu, Stefanie Wuhrer:
Isometric Morphing of Triangular Meshes. CCCG 2008 - [c60]Joseph O'Rourke, Perouz Taslakian, Godfried T. Toussaint:
A Pumping Lemma for Homometric Rhythms. CCCG 2008 - [c59]Mirela Damian, Robin Y. Flatland, Joseph O'Rourke, Suneeta Ramaswami:
Connecting Polygonizations via Stretches and Twangs. STACS 2008: 217-228 - [c58]Greg Aloupis, Sébastien Collette, Mirela Damian, Erik D. Demaine, Dania El-Khechen, Robin Y. Flatland, Stefan Langerman, Joseph O'Rourke, Val Pinciu, Suneeta Ramaswami, Vera Sacristán Adinolfi, Stefanie Wuhrer:
Realistic Reconfiguration of Crystalline (and Telecube) Robots. WAFR 2008: 433-447 - [i48]Alex Benton, Joseph O'Rourke:
A Class of Convex Polyhedra with Few Edge Unfoldings. CoRR abs/0801.4019 (2008) - [i47]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) - [i46]Stefanie Wuhrer, Prosenjit Bose, Chang Shu, Joseph O'Rourke, Alan Brunton:
Morphing of Triangular Meshes in Shape Space. CoRR abs/0805.0162 (2008) - [i45]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) - [i44]Jin-ichi Itoh, Joseph O'Rourke, Costin Vîlcu:
Unfolding Convex Polyhedra via Quasigeodesic Star Unfoldings. CoRR abs/0812.2257 (2008) - 2007
- [b1]Erik D. Demaine, Joseph O'Rourke:
Geometric folding algorithms - linkages, origami, polyhedra. Cambridge University Press 2007, pp. I-XIII, 1-472 - [j111]Mirela Damian, Robin Y. Flatland, Joseph O'Rourke:
Epsilon-Unfolding Orthogonal Polyhedra. Graphs Comb. 23(Supplement-1): 179-194 (2007) - [j110]Joseph O'Rourke:
Computational Geometry Column 48. Int. J. Comput. Geom. Appl. 17(4): 397-399 (2007) - [j109]Joseph O'Rourke:
Computational geometry column 49. SIGACT News 38(2): 51-55 (2007) - [c57]Alex Benton, Joseph O'Rourke:
Unfolding Polyhedra via Cut-Tree Truncation. CCCG 2007: 77-80 - [c56]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 - [c55]Erik D. Demaine, Joseph O'Rourke:
Open Problems from CCCG 2006. CCCG 2007: 277-280 - [c54]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 - [i43]Mirela Damian, Robin Y. Flatland, Joseph O'Rourke:
Unfolding Manhattan Towers. CoRR abs/0705.1541 (2007) - [i42]Joseph O'Rourke:
Unfolding Orthogonal Terrains. CoRR abs/0707.0610 (2007) - [i41]Jin-ichi Itoh, Joseph O'Rourke, Costin Vîlcu:
Unfolding Convex Polyhedra via Quasigeodesics. CoRR abs/0707.4258 (2007) - [i40]Joseph O'Rourke:
Unfolding Restricted Convex Caps. CoRR abs/0709.1647 (2007) - [i39]Mirela Damian, Robin Y. Flatland, Joseph O'Rourke, Suneeta Ramaswami:
Connecting Polygonizations via Stretches and Twangs. CoRR abs/0709.1942 (2007) - [i38]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) - [i37]Joseph O'Rourke:
Band Unfoldings and Prismatoids: A Counterexample. CoRR abs/0710.0811 (2007) - 2006
- [j108]Erik D. Demaine, Stefan Langerman, Joseph O'Rourke:
Geometric Restrictions on Producible Polygonal Protein Chains. Algorithmica 44(2): 167-181 (2006) - [j107]Joseph O'Rourke:
Computational Geometry Column 47. Int. J. Comput. Geom. Appl. 16(4): 373-375 (2006) - [j106]Joseph O'Rourke:
Computational geometry column 47. SIGACT News 37(2): 47-49 (2006) - [j105]Joseph O'Rourke:
Computational geometry column 48. SIGACT News 37(3): 55-57 (2006) - [c53]Nadia M. Benbernou, Joseph O'Rourke:
On the Maximum Span of Fixed-Angle Chains. CCCG 2006 - [c52]Erik D. Demaine, Blaise Gassend, Joseph O'Rourke, Godfried T. Toussaint:
Polygons Flip Finitely: Flaws and a Fix. CCCG 2006 - [c51]Erik D. Demaine, Joseph O'Rourke:
Open Problems: Open Problems from CCCG 2005. CCCG 2006 - [c50]Mirela Damian, Robin Y. Flatland, Joseph O'Rourke:
Grid Vertex-Unfolding Orthogonal Polyhedra. STACS 2006: 264-276 - [i36]Mirela Damian, Robin Y. Flatland, Joseph O'Rourke:
Epsilon-Unfolding Orthogonal Polyhedra. CoRR abs/cs/0602095 (2006) - 2005
- [c49]Mirela Damian, Robin Y. Flatland, Joseph O'Rourke:
Unfolding Manhattan Towers. CCCG 2005: 211-214 - [i35]Mirela Damian, Robin Y. Flatland, Joseph O'Rourke:
Grid Vertex-Unfolding Orthogonal Polyhedra. CoRR abs/cs/0509054 (2005) - 2004
- [j104]Joseph O'Rourke, Geetika Tewari:
The structure of optimal partitions of orthogonal polygons into fat rectangles. Comput. Geom. 28(1): 49-71 (2004) - [j103]Joseph O'Rourke:
Computational Geometry Column 45. Int. J. Comput. Geom. Appl. 14(3): 227-229 (2004) - [j102]Joseph O'Rourke:
Computational geometry column 46. Int. J. Comput. Geom. Appl. 14(6): 475-478 (2004) - [j101]Joseph O'Rourke:
Computational geometry column 45. SIGACT News 35(2): 71-73 (2004) - [j100]Joseph O'Rourke:
Computational geometry column 46. SIGACT News 35(3): 42-45 (2004) - [c48]Mirela Damian, Joseph O'Rourke:
On corners of objects built from parallelepiped bricks. CCCG 2004: 20-23 - [c47]Greg Aloupis, Erik D. Demaine, Stefan Langerman, Pat Morin, Joseph O'Rourke, Ileana Streinu, Godfried T. Toussaint:
Unfolding polyhedral bands. CCCG 2004: 60-63 - [c46]Erik D. Demaine, Satyan L. Devadoss, Joseph S. B. Mitchell, Joseph O'Rourke:
Continuous foldability of polygonal paper. CCCG 2004: 64-67 - [e2]Jacob E. Goodman, Joseph O'Rourke:
Handbook of Discrete and Computational Geometry, Second Edition. Chapman and Hall/CRC 2004, ISBN 978-1-58488-301-2 [contents] - [r3]Joseph O'Rourke, Subhash Suri:
Polygons. Handbook of Discrete and Computational Geometry, 2nd Ed. 2004: 583-606 - [r2]Joseph O'Rourke:
Visibility. Handbook of Discrete and Computational Geometry, 2nd Ed. 2004: 643-663 - [r1]Joseph O'Rourke, Godfried T. Toussaint:
Pattern recognition. Handbook of Discrete and Computational Geometry, 2nd Ed. 2004: 1135-1162 - [i34]Mirela Damian, Joseph O'Rourke:
Partitioning Regular Polygons into Circular Pieces II:Nonconvex Partitions. CoRR abs/cs/0412095 (2004) - [i33]Joseph O'Rourke:
Computational Geometry Column 45. CoRR cs.CG/0405034 (2004) - [i32]Nadia M. Benbernou, Patricia Cahn, Joseph O'Rourke:
Unfolding Smooth Primsatoids. CoRR cs.CG/0407063 (2004) - [i31]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) - 2003
- [j99]Joseph O'Rourke:
On the development of the intersection of a plane with a polytope. Comput. Geom. 24(1): 3-10 (2003) - [j98]Erik D. Demaine, Martin L. Demaine, Michael Hoffmann, Joseph O'Rourke:
Pushing blocks is hard. Comput. Geom. 26(1): 21-36 (2003) - [j97]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) - [j96]Joseph O'Rourke:
Computational Geometry Column 44. Int. J. Comput. Geom. Appl. 13(3): 273-275 (2003) - [j95]Joseph O'Rourke:
Computational geometry column 44. SIGACT News 34(2): 58-60 (2003) - [c45]Mirela Damian-Iordache, Joseph O'Rourke:
Partitioning Regular Polygons into Circular Pieces I: Convex Partitions. CCCG 2003: 43-46 - [c44]Suzanne Gallagher, Joseph O'Rourke:
Coloring Objects Built From Bricks. CCCG 2003: 56-59 - [c43]Erik D. Demaine, Stefan Langerman, Joseph O'Rourke:
Geometric Restrictions on Producible Polygonal Protein Chains. ISAAC 2003: 395-404 - [i30]Mirela Damian-Iordache, Joseph O'Rourke:
Partitioning Regular Polygons into Circular Pieces I: Convex Partitions. CoRR cs.CG/0304023 (2003) - [i29]Joseph O'Rourke:
Computational Geometry Column 44. CoRR cs.CG/0304025 (2003) - [i28]Mirela Damian-Iordache, Joseph O'Rourke:
A Note on Objects Built From Bricks without Corners. CoRR cs.CG/0307042 (2003) - 2002
- [j94]Therese 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. Discret. Appl. Math. 117(1-3): 293-297 (2002) - [j93]Erik D. Demaine, Martin L. Demaine, Anna Lubiw, Joseph O'Rourke:
Enumerating Foldings and Unfoldings Between Polygons and Polytopes. Graphs Comb. 18(1): 93-104 (2002) - [j92]Joseph O'Rourke:
Computational Geometry Column 43. Int. J. Comput. Geom. Appl. 12(3): 263-266 (2002) - [j91]Joseph O'Rourke:
Computational geometry column 43. SIGACT News 33(1): 58-60 (2002) - [c42]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 - [c41]Erik D. Demaine, Joseph O'Rourke:
Open problems from cccg 2001. CCCG 2002 - [c40]Joseph O'Rourke, Geetika Tewari:
Partitioning orthogonal polygons into fat rectangles in polynomial time. CCCG 2002: 97-100 - [c39]Melody Donoso, Joseph O'Rourke:
Nonorthogonal polyhedra built from rectangles. CCCG 2002: 101-104 - [c38]Erik D. Demaine, Stefan Langerman, Joseph O'Rourke, Jack Snoeyink:
Interlocked open linkages with few joints. SCG 2002: 189-198 - [c37]Erik D. Demaine, David Eppstein, Jeff Erickson, George W. Hart, Joseph O'Rourke:
Vertex-unfoldings of simplicial manifolds. SCG 2002: 237-243 - [c36]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 - [c35]Rebecca Alexander, Heather Dyson, Joseph O'Rourke:
The Foldings of a Square to Convex Polyhedra. JCDCG 2002: 38-50 - [i27]Joseph O'Rourke:
Computational Geometry Column 43. CoRR cs.CG/0203008 (2002) - [i26]Erik D. Demaine, Joseph O'Rourke:
Open Problems from CCCG 2002. CoRR cs.CG/0212050 (2002) - 2001
- [j90]Roxana Cocan, Joseph O'Rourke:
Polygonal chains cannot lock in 4D. Comput. Geom. 20(3): 105-129 (2001) - [j89]Therese 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. Discret. Comput. Geom. 26(3): 269-281 (2001) - [j88]Joseph O'Rourke:
Computational Geometry Column 41. Int. J. Comput. Geom. Appl. 11(2): 239-242 (2001) - [j87]Joseph S. B. Mitchell, Joseph O'Rourke:
Computational Geometry Column 42. Int. J. Comput. Geom. Appl. 11(5): 573-582 (2001) - [j86]Joseph O'Rourke:
Computational geometry column 41. SIGACT News 32(1): 53-55 (2001) - [j85]Joseph S. B. Mitchell, Joseph O'Rourke:
Computational geometry. SIGACT News 32(3): 63-72 (2001) - [c34]Erik D. Demaine, Stefan Langerman, Joseph O'Rourke:
Short interlocked linkages. CCCG 2001: 69-72 - [c33]Joseph O'Rourke, Irena Pashchenko, Geetika Tewari:
Partitioning orthogonal polygons into fat rectangles. CCCG 2001: 133-136 - [c32]Joseph O'Rourke, Octavia Petrovici:
Narrowing light rays with mirrors. CCCG 2001: 137-140 - [c31]Erik D. Demaine, Joseph O'Rourke:
Open problems from cccg 2000. CCCG 2001: 185-187 - [i25]Joseph O'Rourke:
Computational Geometry Column 41. CoRR cs.CG/0102004 (2001) - [i24]Erik D. Demaine, David Eppstein, Jeff Erickson, George W. Hart, Joseph O'Rourke:
Vertex-Unfoldings of Simplicial Polyhedra. CoRR cs.CG/0107023 (2001) - [i23]Erik D. Demaine, Martin L. Demaine, Anna Lubiw, Joseph O'Rourke:
Enumerating Foldings and Unfoldings between Polygons and Polytopes. CoRR cs.CG/0107024 (2001) - [i22]Joseph S. B. Mitchell, Joseph O'Rourke:
Computational Geometry Column 42. CoRR cs.CG/0108021 (2001) - [i21]Erik D. Demaine, David Eppstein, Jeff Erickson, George W. Hart, Joseph O'Rourke:
Vertex-Unfoldings of Simplicial Manifolds. CoRR cs.CG/0110054 (2001) - [i20]Melody Donoso, Joseph O'Rourke:
Nonorthogonal Polyhedra Built from Rectangles. CoRR cs.CG/0110059 (2001) - 2000
- [j84]Erik D. Demaine, Joseph O'Rourke:
Computational Geometry Column 37. Int. J. Comput. Geom. Appl. 10(1): 103-107 (2000) - [j83]Joseph O'Rourke:
Computational Geometry Column 38. Int. J. Comput. Geom. Appl. 10(2): 221-223 (2000) - [j82]Joseph O'Rourke:
Computational Geometry Column 39. Int. J. Comput. Geom. Appl. 10(4): 441-444 (2000) - [j81]Joseph O'Rourke:
Computational Geometry Column 40. Int. J. Comput. Geom. Appl. 10(6): 649-651 (2000) - [j80]Joseph O'Rourke:
Computational geometry column 38. SIGACT News 31(1): 28-30 (2000) - [j79]Joseph O'Rourke:
Computational geometry column 39. SIGACT News 31(3): 47-49 (2000) - [j78]Joseph O'Rourke:
Computational geometry column 40. SIGACT News 31(4): 62-73 (2000) - [c30]Erik D. Demaine, Martin L. Demaine, Joseph O'Rourke:
PushPush and Push-1 are NP-hard in 2D. CCCG 2000 - [c29]Erik D. Demaine, Joseph O'Rourke:
Session O1: Open Problems and Planning. CCCG 2000 - [c28]Biliana Kaneva, Joseph O'Rourke:
An Implementation of Chen & Han's Shortest Paths Algorithm. CCCG 2000 - [c27]Joseph O'Rourke:
An Extension of Cauchy's Arm Lemma with Application to Curve Development. JCDCG 2000: 280-291 - [i19]Erik D. Demaine, Martin L. Demaine, Joseph O'Rourke:
PushPush is NP-hard in 2D. CoRR cs.CG/0001019 (2000) - [i18]Joseph O'Rourke:
Computational Geometry Column 38. CoRR cs.CG/0001025 (2000) - [i17]Joseph O'Rourke:
On the Development of the Intersection of a Plane with a Polytope. CoRR cs.CG/0006035 (2000) - [i16]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) - [i15]Erik D. Demaine, Martin L. Demaine, Joseph O'Rourke:
PushPush and Push-1 are NP-hard in 2D. CoRR cs.CG/0007021 (2000) - [i14]Joseph O'Rourke:
Computational Geometry Column 39. CoRR cs.CG/0007042 (2000) - [i13]Joseph O'Rourke:
Computational Geometry Column 40. CoRR cs.CG/0010039 (2000)
1990 – 1999
- 1999
- [j77]Joseph O'Rourke:
Computational Geometry Column 35. Int. J. Comput. Geom. Appl. 9(4/5): 513-516 (1999) - [j76]Joseph O'Rourke:
Computational Geometry Column 36. Int. J. Comput. Geom. Appl. 9(6): 615-618 (1999) - [j75]Samir Khuller, Pankaj K. Agarwal, Joseph O'Rourke:
Open Problems Presented at SCG'98. J. Algorithms 30(2): 449-453 (1999) - [j74]Joseph O'Rourke:
Computational geometry column 35. SIGACT News 30(2): 31-32 (1999) - [j73]Joseph O'Rourke:
Computational geometry column 36. SIGACT News 30(3): 35-38 (1999) - [j72]Erik D. Demaine, Joseph O'Rourke:
Computational geometry column 37. SIGACT News 30(3): 39-42 (1999) - [c26]Roxana Cocan, Joseph O'Rourke:
Polygonal chains cannot lock in 4d. CCCG 1999 - [c25]Erik D. Demaine, Martin L. Demaine, Anna Lubiw, Joseph O'Rourke, Irena Pashchenko:
Metamorphosis of the Cube. SCG 1999: 409-410 - [c24]Therese 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 - [i12]Joseph O'Rourke, Irena Pashchenko:
Zero-Parity Stabbing Information. CoRR cs.CG/9906022 (1999) - [i11]Joseph O'Rourke:
Computational Geometry Column 35. CoRR cs.CG/9906023 (1999) - [i10]Roxana Cocan, Joseph O'Rourke:
Polygonal Chains Cannot Lock in 4D. CoRR cs.CG/9908005 (1999) - [i9]Joseph O'Rourke:
Computational Geometry Column 36. CoRR cs.CG/9908006 (1999) - [i8]Erik D. Demaine, Joseph O'Rourke:
Computational Geometry Column 37. CoRR cs.CG/9908007 (1999) - [i7]Therese 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) - [i6]Therese 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) - [i5]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) - 1998
- [j71]Joseph O'Rourke, Ileana Streinu:
The vertex-edge visibility graph of a polygon. Comput. Geom. 10(2): 105-120 (1998) - [j70]Joseph O'Rourke:
Computational geometry column 33. Int. J. Comput. Geom. Appl. 8(3): 381-384 (1998) - [j69]Pankaj K. Agarwal, Joseph O'Rourke:
Computational Geometry Column 34. Int. J. Comput. Geom. Appl. 8(5/6): 637- (1998) - [j68]Joseph O'Rourke:
Computational geometry column 33. SIGACT News 29(2): 14-20 (1998) - [j67]Pankaj K. Agarwal, Joseph O'Rourke:
Computational geometry. SIGACT News 29(3): 27-32 (1998) - [c23]Therese 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 - [c22]Therese 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 - [c21]Joseph O'Rourke:
Folding and Unfolding in Computational Geometry. JCDCG 1998: 258-266 - [i4]Pankaj K. Agarwal, Joseph O'Rourke:
Computational Geometry Column 34. CoRR cs.CG/9808008 (1998) - [i3]Joseph O'Rourke:
Computational Geometry Column 33. CoRR cs.CG/9810020 (1998) - [i2]Joseph O'Rourke:
Computational Geometry Column 32. CoRR cs.CG/9810021 (1998) - [i1]Therese 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) - 1997
- [j66]Joseph O'Rourke:
Computational Geometry Column 30. Int. J. Comput. Geom. Appl. 7(1/2): 165-166 (1997) - [j65]Joseph O'Rourke:
Computational Geometry Column 31. Int. J. Comput. Geom. Appl. 7(4): 379-382 (1997) - [j64]Joseph O'Rourke:
Computational Geometry Column 32. Int. J. Comput. Geom. Appl. 7(5): 509-513 (1997) - [j63]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) - [j62]Joseph O'Rourke:
Computational Geometry Column 30. SIGACT News 28(1): 7 (1997) - [j61]Joseph O'Rourke:
Computational geometry column 31. SIGACT News 28(2): 20-23 (1997) - [j60]Joseph O'Rourke:
Computational geometry column 32. SIGACT News 28(3): 12-16 (1997) - [c20]Joseph O'Rourke:
Vertex pi-lights for monotone mountains. CCCG 1997 - [c19]Joseph O'Rourke, Ileana Streinu:
Vertex-Edge Pseudo-Visibility Graphs: Characterization and Recognition. SCG 1997: 119-128 - 1996
- [j59]C. Gitlin, Joseph O'Rourke, V. Subramanian:
On reconstructing polyhedra from parallel slices. Int. J. Comput. Geom. Appl. 6(1): 103-122 (1996) - [j58]Joseph O'Rourke:
Computational geometry column 27. Int. J. Comput. Geom. Appl. 6(1): 123-125 (1996) - [j57]Joseph O'Rourke:
Computational geometry column 28. Int. J. Comput. Geom. Appl. 6(2): 243-244 (1996) - [j56]Joseph O'Rourke:
Computational geometry column 29. Int. J. Comput. Geom. Appl. 6(4): 507-511 (1996) - [j55]Joseph O'Rourke:
Computational geometry column 28. SIGACT News 27(2): 18-19 (1996) - [j54]Joseph O'Rourke:
Computational Geometry Column 29. SIGACT News 27(3): 55-59 (1996) - 1995
- [j53]Joseph O'Rourke:
Computational geometry column 25. Int. J. Comput. Geom. Appl. 5: 215-218 (1995) - [j52]Joseph O'Rourke:
Computational geometry column 26. Int. J. Comput. Geom. Appl. 5(3): 339-341 (1995) - [j51]Vladimir Estivill-Castro, Joseph O'Rourke, Jorge Urrutia, Dianna Xu:
Illumination of Polygons with Vertex Lights. Inf. Process. Lett. 56(1): 9-13 (1995) - [j50]Joseph O'Rourke:
Computational geometry. SIGACT News 26(1): 14-16 (1995) - [j49]Joseph O'Rourke:
Computational geometry column 26. SIGACT News 26(2): 15-17 (1995) - [j48]Joseph O'Rourke:
Computational geometry column 27. SIGACT News 26(4): 19-21 (1995) - [c18]Joseph O'Rourke, Thomas C. Shermer, Ileana Streinu:
Illuminating convex polygonswith vertex floodlight. CCCG 1995: 151-156 - 1994
- [j47]Joseph O'Rourke, Jennifer Rippel:
Two Segment Classes with Hamiltonian Visibility Graphs. Comput. Geom. 4: 209-218 (1994) - [j46]Joseph O'Rourke:
On the Scaling Heuristic for Reconstruction from Slices. CVGIP Graph. Model. Image Process. 56(5): 420-423 (1994) - [j45]Joseph O'Rourke:
Computational geometry column 22. Int. J. Comput. Geom. Appl. 4(1): 119-122 (1994) - [j44]Joseph O'Rourke:
Computational geometry column 23. Int. J. Comput. Geom. Appl. 4(2): 239-242 (1994) - [j43]Joseph O'Rourke:
Computational geometry column 24. Int. J. Comput. Geom. Appl. 4(3): 363-366 (1994) - [j42]Joseph O'Rourke:
Computational geometry. SIGACT News 25(1): 31-33 (1994) - [j41]Joseph O'Rourke:
Computational geometry column 23. SIGACT News 25(3): 24-27 (1994) - [j40]Joseph O'Rourke:
Computational Geometry Column 24. SIGACT News 25(4): 12-14 (1994) - [j39]Matthew Díaz, Joseph O'Rourke:
Algorithms for computing the center of area of a convex polygon. Vis. Comput. 10(8): 432-442 (1994) - 1993
- [j38]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) - [j37]Joseph O'Rourke:
Computational geometry column 18. Int. J. Comput. Geom. Appl. 3(1): 107-113 (1993) - [j36]Joseph O'Rourke:
Computational geometry column 19. Int. J. Comput. Geom. Appl. 3(2): 221-224 (1993) - [j35]Joseph O'Rourke:
Computational geometry column 20. Int. J. Comput. Geom. Appl. 3(3): 347-349 (1993) - [j34]Joseph O'Rourke:
Computational geometry column 21. Int. J. Comput. Geom. Appl. 3(4): 463-465 (1993) - [j33]Joseph O'Rourke:
Computational geometry column 18. SIGACT News 24(1): 20-25 (1993) - [c17]Hazel Everett, Anna Lubiw, Joseph O'Rourke:
Recovery of Convex Hulls From External Visibility Graphs. CCCG 1993: 309-314 - 1992
- [j32]Boris Aronov, Joseph O'Rourke:
Nonoverlap of the Star Unfolding. Discret. Comput. Geom. 8: 219-250 (1992) - [j31]Joseph O'Rourke:
Computational geometry column 15. Int. J. Comput. Geom. Appl. 2(2): 215-217 (1992) - [j30]Joseph O'Rourke:
Computational geometry column 16. Int. J. Comput. Geom. Appl. 2(3): 335-339 (1992) - [j29]Joseph O'Rourke:
Computational geometry column 17. Int. J. Comput. Geom. Appl. 2(4): 443-447 (1992) - [j28]Joseph O'Rourke:
Mathematics in Action (Stan Wagon). SIAM Rev. 34(3): 515-516 (1992) - [j27]Joseph O'Rourke:
Book Review: Intersection and Decomposition Algorithms for Planar Arrangements, by Pankaj K. Agarwal. (Cambridge University Press, Cambridge, 1991 . xvii+277 pp . $39.50 cloth. ISBN 0-521-40446-0). SIGACT News 23(1): 35-36 (1992) - [j26]Joseph O'Rourke:
Computational geometry. SIGACT News 23(2): 26-28 (1992) - 1991
- [j25]Joseph O'Rourke:
Computational geometry column 11. Int. J. Comput. Geom. Appl. 1(1): 93-98 (1991) - [j24]Joseph O'Rourke:
Computational geometry column 12. Int. J. Comput. Geom. Appl. 1(2): 197-200 (1991) - [j23]Joseph O'Rourke:
Computational geometry column 13. Int. J. Comput. Geom. Appl. 1(3): 341-343 (1991) - [j22]Joseph O'Rourke:
Computational geometry column 14. Int. J. Comput. Geom. Appl. 1(4): 517-522 (1991) - [c16]Boris Aronov, Joseph O'Rourke:
Nonoverlap of the Star Unfolding. SCG 1991: 105-114 - 1990
- [j21]Joseph O'Rourke:
Computational geometry column 9. SIGACT News 21(1): 18 (1990) - [c15]Pankaj K. Agarwal, Boris Aronov, Joseph O'Rourke, Catherine A. Schevon:
Star Unfolding of a Polytope with Applications (Extended Abstract). SWAT 1990: 251-263
1980 – 1989
- 1989
- [j20]Alok Aggarwal, Heather Booth, Joseph O'Rourke, Subhash Suri, Chee-Keng Yap:
Finding Minimal Convex Nested Polygons. Inf. Comput. 83(1): 98-110 (1989) - [j19]Joseph O'Rourke:
Computational geometry column. SIGACT News 20(2): 10-11 (1989) - [j18]Joseph O'Rourke:
Computational geometry column. SIGACT News 20(3): 25-26 (1989) - [j17]Joseph O'Rourke:
Computational geometry column 8. SIGACT News 20(4): 30 (1989) - [c14]Joseph O'Rourke, Catherine A. Schevon:
Computing the Geodesic Diameter of a 3-Polytope. SCG 1989: 370-379 - [c13]Yan Ke, Joseph O'Rourke:
Computing the Kernel of a Point Set in a Polygon (Extended Abstract). WADS 1989: 135-146 - [c12]Matthew Díaz, Joseph O'Rourke:
Computing the Center of Area of a Polygon. WADS 1989: 171-182 - 1988
- [j16]Yan Ke, Joseph O'Rourke:
Lower Bounds on Moving a Ladder in Two and Three Dimensions. Discret. Comput. Geom. 3: 197-217 (1988) - [j15]Joseph O'Rourke:
Computational geometry column. SIGACT News 19(3-4): 21-26 (1988) - [c11]Michael McKenna, Joseph O'Rourke:
Arrangements of Lines in 3-Space: A Data Structure with Applications. SCG 1988: 371-380 - 1987
- [c10]Yan Ke, Joseph O'Rourke:
Moving a Ladder in Three Dimensions: Upper and Lower Bounds. SCG 1987: 136-146 - 1986
- [j14]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) - [j13]Joseph O'Rourke:
The Signature of a Plane Curve. SIAM J. Comput. 15(1): 34-51 (1986) - [j12]Herbert Edelsbrunner, Joseph O'Rourke, Raimund Seidel:
Constructing Arrangements of Lines and Hyperplanes with Applications. SIAM J. Comput. 15(2): 341-363 (1986) - [c9]Subhash Suri, Joseph O'Rourke:
Worst-Case Optimal Algorithms for Constructing Visibility Polygons with Holes. SCG 1986: 14-23 - 1985
- [j11]Joseph O'Rourke:
Counterexamples to a minimal circumscription algorithm. Comput. Vis. Graph. Image Process. 30(3): 364-366 (1985) - [j10]Joseph O'Rourke:
Finding minimal enclosing boxes. Int. J. Parallel Program. 14(3): 183-199 (1985) - [c8]Alok Aggarwal, Heather Booth, Joseph O'Rourke, Subhash Suri, Chee-Keng Yap:
Finding minimal convex nested polygons. SCG 1985: 296-304 - [c7]Joseph O'Rourke, Subhash Suri, Heather Booth:
Shortest Paths on Polyhedral Surfaces. STACS 1985: 243-254 - [e1]Joseph O'Rourke:
Proceedings of the First Annual Symposium on Computational Geometry, Baltimore, Maryland, USA, June 5-7, 1985. ACM 1985, ISBN 0-89791-163-6 [contents] - 1984
- [j9]Joseph O'Rourke, Kenneth R. Sloan:
Dynamic Quantization: Two Adaptive Data Structures for Multidimensional Spaces. IEEE Trans. Pattern Anal. Mach. Intell. 6(3): 266-280 (1984) - 1983
- [j8]Joseph O'Rourke, Kenneth J. Supowit:
Some NP-hard polygon decomposition problems. IEEE Trans. Inf. Theory 29(2): 181-189 (1983) - [c6]Herbert Edelsbrunner, Joseph O'Rourke, Raimund Seidel:
Constructing Arrangements of Lines and Hyperplanes with Applications. FOCS 1983: 83-91 - [c5]T. C. Addison, S. Y. Lee, Joseph O'Rourke:
The MEDITS Software Tools to Support Special Services System Engineering. INFOCOM 1983: 600-607 - 1982
- [j7]Joseph O'Rourke:
Polygon decomposition and switching function minimization. Comput. Graph. Image Process. 18(4): 382-391 (1982) - [j6]Joseph O'Rourke, Chi-Bin Chien, Thomas Olson, David Naddor:
A new linear algorithm for intersecting convex polygons. Comput. Graph. Image Process. 19(1): 92 (1982) - [j5]Joseph O'Rourke, Chi-Bin Chien, Thomas Olson, David Naddor:
A new linear algorithm for intersecting convex polygons. Comput. Graph. Image Process. 19(4): 384-391 (1982) - [j4]Joseph O'Rourke:
Computing the relative neighborhood graph in the L1 and Linfinity metrics . Pattern Recognit. 15(3): 189-192 (1982) - 1981
- [j3]Joseph O'Rourke:
An On-Line Algorithm for Fitting Straight Lines Between Data Ranges. Commun. ACM 24(9): 574-578 (1981) - [c4]Joseph O'Rourke:
Polyhedra of Minimal Area as 3D Object Models. IJCAI 1981: 664-666 - [c3]Joseph O'Rourke:
Dynamically Quantized Spaces for Focusing the Hough Transform. IJCAI 1981: 737-739 - 1980
- [c2]Norman I. Badler, Joseph O'Rourke, Stephen Platt, Mary A. Morris:
Human Movement Understanding: A Variety of Perspectives. AAAI 1980: 53-55 - [c1]Norman I. Badler, Joseph O'Rourke, Bruce Kaufman:
Special problems in human movement simulation. SIGGRAPH 1980: 189-197
1970 – 1979
- 1979
- [j2]Joseph O'Rourke, Norman I. Badler:
Decomposition of Three-Dimensional Objects into Spheres. IEEE Trans. Pattern Anal. Mach. Intell. 1(3): 295-305 (1979) - [j1]Joseph O'Rourke, Norman I. Badler:
Correction to "Decomposition of Three-Dimensional Objects into Spheres". IEEE Trans. Pattern Anal. Mach. Intell. 1(4): 417 (1979)
Coauthor Index
Mirela Damian
aka: Mirela Damian-Iordache
aka: Mirela Damian-Iordache
[i84] [c87] [c84] [c82] [i74] [c76] [j133] [i66] [j128] [c72] [j127] [j124] [j123] [c69] [c67] [j118] [c64] [i49] [j117] [c58] [i47] [b1] [c56] [c55] [c54] [j108] [c52] [c51] [c47] [c46] [j98] [j97] [c43] [j94] [j93] [c42] [c41] [c38] [c37] [c36] [i26] [j89] [c34] [c31] [i24] [i23] [i21] [j84] [c30] [c29] [i19] [i16] [i15] [j72] [c25] [c24] [i8] [i7] [i6] [c23] [c22] [i1]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:13 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
