Joseph O'Rourke

1. PushPush and Push-1 are NP-hard in 2D
   2000/07/13 by Erik D. Demaine, Martin L. Demaine, Demaine, Erik D. +4 · 4 citations
   Computer Science · #Algorithms and Data Compression #Computational Geometry (cs.CG) #Discrete Mathematics (cs.DM) #F.2.2 #FOS: Computer and information sciences #cs.CG #cs.DM
2. PushPush is NP-hard in 3D
   1999/11/28 by Joseph O’Rourke, Joseph O'Rourke, O'Rourke, Joseph +2 · 1 citation
   Computer Science · #Artificial Intelligence in Games #Computational Geometry (cs.CG) #Computational Geometry and Mesh Generation #Discrete Mathematics (cs.DM) #F.2.2 #FOS: Computer and information sciences #Robotic Path Planning Algorithms #cs.CG #cs.DM
3. PushPush is NP-hard in 2D
   2000/01/24 by Erik D. Demaine, Martin L. Demaine, Demaine, Erik D. +4 · 1 citation
   Computer Science · #Artificial Intelligence in Games #Computational Geometry (cs.CG) #Computational Geometry and Mesh Generation #Discrete Mathematics (cs.DM) #F.2.2 #FOS: Computer and information sciences #G.2.m #Robotic Path Planning Algorithms #cs.CG #cs.DM
4. Enumerating Foldings and Unfoldings between Polygons and Polytopes
   2001/07/18 by Erik D. Demaine, Martin L. Demaine, Anna Lubiw +1 · 1 citation
   Computer Science · #cs.CG #cs.DM
5. Open Problems from CCCG 2002
   2002/12/22 by Erik D. Demaine, Joseph O'Rourke, Joseph O’Rourke +2 · 2 citations
   Computer Science · Earth and Planetary Sciences · Engineering · #3D Modeling in Geospatial Applications #Computational Geometry (cs.CG) #Computational Geometry and Mesh Generation #Discrete Mathematics (cs.DM) #F.2.2 #FOS: Computer and information sciences #Geological Modeling and Analysis #cs.CG #cs.DM