The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Joseph O'Rourke: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Norman I. Badler, Joseph O'Rourke, Stephen Platt, Mary A. Morris
    Human Movement Understanding: A Variety of Perspectives. [Citation Graph (0, 0)][DBLP]
    AAAI, 1980, pp:53-55 [Conf]
  2. Greg Aloupis, Erik D. Demaine, Stefan Langerman, Pat Morin, Joseph O'Rourke, Ileana Streinu, Godfried T. Toussaint
    Unfolding polyhedral bands. [Citation Graph (0, 0)][DBLP]
    CCCG, 2004, pp:60-63 [Conf]
  3. 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. [Citation Graph (0, 0)][DBLP]
    CCCG, 2002, pp:27-30 [Conf]
  4. 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. [Citation Graph (0, 0)][DBLP]
    CCCG, 1998, pp:- [Conf]
  5. 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. [Citation Graph (0, 0)][DBLP]
    CCCG, 1998, pp:- [Conf]
  6. Erik D. Demaine, Satyan L. Devadoss, Joseph S. B. Mitchell, Joseph O'Rourke
    Continuous foldability of polygonal paper. [Citation Graph (0, 0)][DBLP]
    CCCG, 2004, pp:64-67 [Conf]
  7. Erik D. Demaine, Martin L. Demaine, Joseph O'Rourke
    PushPush and Push-1 are NP-hard in 2D. [Citation Graph (0, 0)][DBLP]
    CCCG, 2000, pp:- [Conf]
  8. Erik D. Demaine, Stefan Langerman, Joseph O'Rourke
    Short interlocked linkages. [Citation Graph (0, 0)][DBLP]
    CCCG, 2001, pp:69-72 [Conf]
  9. Erik D. Demaine, Joseph O'Rourke
    Session O1: Open Problems and Planning. [Citation Graph (0, 0)][DBLP]
    CCCG, 2000, pp:- [Conf]
  10. Erik D. Demaine, Joseph O'Rourke
    Open problems from cccg 2000. [Citation Graph (0, 0)][DBLP]
    CCCG, 2001, pp:185-187 [Conf]
  11. Erik D. Demaine, Joseph O'Rourke
    Open problems from cccg 2001. [Citation Graph (0, 0)][DBLP]
    CCCG, 2002, pp:- [Conf]
  12. Melody Donoso, Joseph O'Rourke
    Nonorthogonal polyhedra built from rectangles. [Citation Graph (0, 0)][DBLP]
    CCCG, 2002, pp:101-104 [Conf]
  13. Roxana Cocan, Joseph O'Rourke
    Polygonal chains cannot lock in 4d. [Citation Graph (0, 0)][DBLP]
    CCCG, 1999, pp:- [Conf]
  14. Mirela Damian-Iordache, Joseph O'Rourke
    Partitioning Regular Polygons into Circular Pieces I: Convex Partitions. [Citation Graph (0, 0)][DBLP]
    CCCG, 2003, pp:43-46 [Conf]
  15. Mirela Damian, Robin Y. Flatland, Joseph O'Rourke
    Unfolding Manhattan Towers. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:211-214 [Conf]
  16. Mirela Damian, Joseph O'Rourke
    On corners of objects built from parallelepiped bricks. [Citation Graph (0, 0)][DBLP]
    CCCG, 2004, pp:20-23 [Conf]
  17. Hazel Everett, Anna Lubiw, Joseph O'Rourke
    Recovery of Convex Hulls From External Visibility Graphs. [Citation Graph (0, 0)][DBLP]
    CCCG, 1993, pp:309-314 [Conf]
  18. Suzanne Gallagher, Joseph O'Rourke
    Coloring Objects Built From Bricks. [Citation Graph (0, 0)][DBLP]
    CCCG, 2003, pp:56-59 [Conf]
  19. Biliana Kaneva, Joseph O'Rourke
    An Implementation of Chen & Han's Shortest Paths Algorithm. [Citation Graph (0, 0)][DBLP]
    CCCG, 2000, pp:- [Conf]
  20. Joseph O'Rourke
    Vertex pi-lights for monotone mountains. [Citation Graph (0, 0)][DBLP]
    CCCG, 1997, pp:- [Conf]
  21. Joseph O'Rourke, Octavia Petrovici
    Narrowing light rays with mirrors. [Citation Graph (0, 0)][DBLP]
    CCCG, 2001, pp:137-140 [Conf]
  22. Joseph O'Rourke, Irena Pashchenko, Geetika Tewari
    Partitioning orthogonal polygons into fat rectangles. [Citation Graph (0, 0)][DBLP]
    CCCG, 2001, pp:133-136 [Conf]
  23. Joseph O'Rourke, Geetika Tewari
    Partitioning orthogonal polygons into fat rectangles in polynomial time. [Citation Graph (0, 0)][DBLP]
    CCCG, 2002, pp:97-100 [Conf]
  24. Yan Ke, Joseph O'Rourke
    Moving a Ladder in Three Dimensions: Upper and Lower Bounds. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1987, pp:136-146 [Conf]
  25. Boris Aronov, Joseph O'Rourke
    Nonoverlap of the Star Unfolding. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1991, pp:105-114 [Conf]
  26. Erik D. Demaine, Martin L. Demaine, Anna Lubiw, Joseph O'Rourke, Irena Pashchenko
    Metamorphosis of the Cube. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1999, pp:409-410 [Conf]
  27. Erik D. Demaine, David Eppstein, Jeff Erickson, George W. Hart, Joseph O'Rourke
    Vertex-unfoldings of simplicial manifolds. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2002, pp:237-243 [Conf]
  28. Erik D. Demaine, Stefan Langerman, Joseph O'Rourke, Jack Snoeyink
    Interlocked open linkages with few joints. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2002, pp:189-198 [Conf]
  29. M. McKenna, Joseph O'Rourke
    Arrangements of Lines in 3-Space: A Data Structure with Applications. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1988, pp:371-380 [Conf]
  30. Joseph O'Rourke, Catherine A. Schevon
    Computing the Geodesic Diameter of a 3-Polytope. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1989, pp:370-379 [Conf]
  31. Joseph O'Rourke, Ileana Streinu
    Vertex-Edge Pseudo-Visibility Graphs: Characterization and Recognition. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1997, pp:119-128 [Conf]
  32. Subhash Suri, Joseph O'Rourke
    Worst-Case Optimal Algorithms for Constructing Visibility Polygons with Holes. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1986, pp:14-23 [Conf]
  33. Herbert Edelsbrunner, Joseph O'Rourke, Raimund Seidel
    Constructing Arrangements of Lines and Hyperplanes with Applications [Citation Graph (0, 0)][DBLP]
    FOCS, 1983, pp:83-91 [Conf]
  34. Joseph O'Rourke
    Polyhedra of Minimal Area as 3D Object Models. [Citation Graph (0, 0)][DBLP]
    IJCAI, 1981, pp:664-666 [Conf]
  35. Joseph O'Rourke
    Dynamically Quantized Spaces for Focusing the Hough Transform. [Citation Graph (0, 0)][DBLP]
    IJCAI, 1981, pp:737-739 [Conf]
  36. T. C. Addison, S. Y. Lee, Joseph O'Rourke
    The MEDITS Software Tools to Support Special Services System Engineering. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 1983, pp:600-607 [Conf]
  37. 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. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2002, pp:369-380 [Conf]
  38. Erik D. Demaine, Stefan Langerman, Joseph O'Rourke
    Geometric Restrictions on Producible Polygonal Protein Chains. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2003, pp:395-404 [Conf]
  39. Rebecca Alexander, Heather Dyson, Joseph O'Rourke
    The Foldings of a Square to Convex Polyhedra. [Citation Graph (0, 0)][DBLP]
    JCDCG, 2002, pp:38-50 [Conf]
  40. Joseph O'Rourke
    An Extension of Cauchy's Arm Lemma with Application to Curve Development. [Citation Graph (0, 0)][DBLP]
    JCDCG, 2000, pp:280-291 [Conf]
  41. Joseph O'Rourke
    Folding and Unfolding in Computational Geometry. [Citation Graph (0, 0)][DBLP]
    JCDCG, 1998, pp:258-266 [Conf]
  42. 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. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:866-867 [Conf]
  43. Mirela Damian, Robin Y. Flatland, Joseph O'Rourke
    Grid Vertex-Unfolding Orthogonal Polyhedra. [Citation Graph (0, 0)][DBLP]
    STACS, 2006, pp:264-276 [Conf]
  44. Joseph O'Rourke, Subhash Suri, Heather Booth
    Shortest Paths on Polyhedral Surfaces. [Citation Graph (0, 0)][DBLP]
    STACS, 1985, pp:243-254 [Conf]
  45. Pankaj K. Agarwal, Boris Aronov, Joseph O'Rourke, Catherine A. Schevon
    Star Unfolding of a Polytope with Applications (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    SWAT, 1990, pp:251-263 [Conf]
  46. Yan Ke, Joseph O'Rourke
    Computing the Kernel of a Point Set in a Polygon (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    WADS, 1989, pp:135-146 [Conf]
  47. Matthew Díaz, Joseph O'Rourke
    Computing the Center of Area of a Polygon. [Citation Graph (0, 0)][DBLP]
    WADS, 1989, pp:171-182 [Conf]
  48. 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. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 1993, v:60, n:2, pp:303-312 [Journal]
  49. Erik D. Demaine, Stefan Langerman, Joseph O'Rourke
    Geometric Restrictions on Producible Polygonal Protein Chains. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2006, v:44, n:2, pp:167-181 [Journal]
  50. Joseph O'Rourke
    An On-Line Algorithm for Fitting Straight Lines Between Data Ranges. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1981, v:24, n:9, pp:574-578 [Journal]
  51. Roxana Cocan, Joseph O'Rourke
    Polygonal chains cannot lock in 4D. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2001, v:20, n:3, pp:105-129 [Journal]
  52. Erik D. Demaine, Martin L. Demaine, Michael Hoffmann, Joseph O'Rourke
    Pushing blocks is hard. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2003, v:26, n:1, pp:21-36 [Journal]
  53. Erik D. Demaine, Stefan Langerman, Joseph O'Rourke, Jack Snoeyink
    Interlocked open and closed linkages with few joints. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2003, v:26, n:1, pp:37-45 [Journal]
  54. Joseph O'Rourke
    On the development of the intersection of a plane with a polytope. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2003, v:24, n:1, pp:3-10 [Journal]
  55. Joseph O'Rourke, Jennifer Rippel
    Two Segment Classes with Hamiltonian Visibility Graphs. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1994, v:4, n:, pp:209-218 [Journal]
  56. Joseph O'Rourke, Ileana Streinu
    The vertex-edge visibility graph of a polygon. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1998, v:10, n:2, pp:105-120 [Journal]
  57. Joseph O'Rourke, Geetika Tewari
    The structure of optimal partitions of orthogonal polygons into fat rectangles. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2004, v:28, n:1, pp:49-71 [Journal]
  58. Erik D. Demaine, Martin L. Demaine, Joseph O'Rourke
    PushPush is NP-hard in 2D [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  59. Joseph O'Rourke
    Computational Geometry Column 38 [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  60. Joseph O'Rourke
    On the Development of the Intersection of a Plane with a Polytope [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  61. Erik D. Demaine, Martin L. Demaine, Anna Lubiw, Joseph O'Rourke
    Examples, Counterexamples, and Enumeration Results for Foldings and Unfoldings between Polygons and Polytopes [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  62. Erik D. Demaine, Martin L. Demaine, Joseph O'Rourke
    PushPush and Push-1 are NP-hard in 2D [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  63. Joseph O'Rourke
    Computational Geometry Column 39 [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  64. Joseph O'Rourke
    Computational Geometry Column 40 [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  65. Joseph O'Rourke
    Computational Geometry Column 41 [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  66. Erik D. Demaine, David Eppstein, Jeff Erickson, George W. Hart, Joseph O'Rourke
    Vertex-Unfoldings of Simplicial Polyhedra [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  67. Erik D. Demaine, Martin L. Demaine, Anna Lubiw, Joseph O'Rourke
    Enumerating Foldings and Unfoldings between Polygons and Polytopes [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  68. Joseph S. B. Mitchell, Joseph O'Rourke
    Computational Geometry Column 42 [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  69. Erik D. Demaine, David Eppstein, Jeff Erickson, George W. Hart, Joseph O'Rourke
    Vertex-Unfoldings of Simplicial Manifolds [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  70. Melody Donoso, Joseph O'Rourke
    Nonorthogonal Polyhedra Built from Rectangles [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  71. Joseph O'Rourke
    Computational Geometry Column 43 [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  72. Erik D. Demaine, Joseph O'Rourke
    Open Problems from CCCG 2002 [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  73. Mirela Damian-Iordache, Joseph O'Rourke
    Partitioning Regular Polygons into Circular Pieces I: Convex Partitions [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  74. Joseph O'Rourke
    Computational Geometry Column 44 [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  75. Mirela Damian-Iordache, Joseph O'Rourke
    A Note on Objects Built From Bricks without Corners [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  76. Joseph O'Rourke
    Computational Geometry Column 45 [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  77. Nadia Benbernou, Patricia Cahn, Joseph O'Rourke
    Unfolding Smooth Primsatoids [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  78. Julie Glass, Stefan Langerman, Joseph O'Rourke, Jack Snoeyink, Jianyuan K. Zhong
    A 2-chain can interlock with a k-chain [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  79. Pankaj K. Agarwal, Joseph O'Rourke
    Computational Geometry Column 34 [Citation Graph (0, 0)][DBLP]
    CoRR, 1998, v:0, n:, pp:- [Journal]
  80. Joseph O'Rourke
    Computational Geometry Column 33 [Citation Graph (0, 0)][DBLP]
    CoRR, 1998, v:0, n:, pp:- [Journal]
  81. Joseph O'Rourke
    Computational Geometry Column 32 [Citation Graph (0, 0)][DBLP]
    CoRR, 1998, v:0, n:, pp:- [Journal]
  82. 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 [Citation Graph (0, 0)][DBLP]
    CoRR, 1998, v:0, n:, pp:- [Journal]
  83. Joseph O'Rourke, Irena Pashchenko
    Zero-Parity Stabbing Information [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  84. Joseph O'Rourke
    Computational Geometry Column 35 [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  85. Roxana Cocan, Joseph O'Rourke
    Polygonal Chains Cannot Lock in 4D [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  86. Joseph O'Rourke
    Computational Geometry Column 36 [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  87. Erik D. Demaine, Joseph O'Rourke
    Computational Geometry Column 37 [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  88. 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 [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  89. 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 [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  90. 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 [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  91. Joseph O'Rourke
    Counterexamples to a minimal circumscription algorithm. [Citation Graph (0, 0)][DBLP]
    Computer Vision, Graphics, and Image Processing, 1985, v:30, n:3, pp:364-366 [Journal]
  92. Joseph O'Rourke
    On the Scaling Heuristic for Reconstruction from Slices. [Citation Graph (0, 0)][DBLP]
    CVGIP: Graphical Model and Image Processing, 1994, v:56, n:5, pp:420-423 [Journal]
  93. 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. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2002, v:117, n:1-3, pp:293-297 [Journal]
  94. Boris Aronov, Joseph O'Rourke
    Nonoverlap of the Star Unfolding. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1992, v:8, n:, pp:219-250 [Journal]
  95. Yan Ke, Joseph O'Rourke
    Lower Bounds on Moving a Ladder in Two and Three Dimensions. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1988, v:3, n:, pp:197-217 [Journal]
  96. 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. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2001, v:26, n:3, pp:269-281 [Journal]
  97. Erik D. Demaine, Martin L. Demaine, Anna Lubiw, Joseph O'Rourke
    Enumerating Foldings and Unfoldings Between Polygons and Polytopes. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2002, v:18, n:1, pp:93-104 [Journal]
  98. Alok Aggarwal, Heather Booth, Joseph O'Rourke, Subhash Suri, Chee-Keng Yap
    Finding Minimal Convex Nested Polygons [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1989, v:83, n:1, pp:98-110 [Journal]
  99. Pankaj K. Agarwal, Joseph O'Rourke
    Computational Geometry Column 34. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1998, v:8, n:5/6, pp:637-0 [Journal]
  100. Erik D. Demaine, Joseph O'Rourke
    Computational Geometry Column 37. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2000, v:10, n:1, pp:103-107 [Journal]
  101. C. Gitlin, Joseph O'Rourke, V. Subramanian
    On reconstructing polyhedra from parallel slices. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1996, v:6, n:1, pp:103-122 [Journal]
  102. Joseph S. B. Mitchell, Joseph O'Rourke
    Computational Geometry Column 42. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2001, v:11, n:5, pp:573-582 [Journal]
  103. Joseph O'Rourke
    Computational Geometry Column 36. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1999, v:9, n:6, pp:615-618 [Journal]
  104. Joseph O'Rourke
    Computational Geometry Column 38. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2000, v:10, n:2, pp:221-223 [Journal]
  105. Joseph O'Rourke
    Computational Geometry Column 39. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2000, v:10, n:4, pp:441-444 [Journal]
  106. Joseph O'Rourke
    Computational Geometry Column 40. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2000, v:10, n:6, pp:649-651 [Journal]
  107. Joseph O'Rourke
    Computational Geometry Column 41. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2001, v:11, n:2, pp:239-242 [Journal]
  108. Joseph O'Rourke
    Computational Geometry Column 43. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2002, v:12, n:3, pp:263-266 [Journal]
  109. Joseph O'Rourke
    Computational Geometry Column 44. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2003, v:13, n:3, pp:273-275 [Journal]
  110. Joseph O'Rourke
    Computational Geometry Column 45. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2004, v:14, n:3, pp:227-229 [Journal]
  111. Joseph O'Rourke
    Computational geometry column 46. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2004, v:14, n:6, pp:475-478 [Journal]
  112. Joseph O'Rourke
    Computational geometry column 11. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1991, v:1, n:1, pp:93-98 [Journal]
  113. Joseph O'Rourke
    Computational geometry column 12. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1991, v:1, n:2, pp:197-200 [Journal]
  114. Joseph O'Rourke
    Computational geometry column 13. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1991, v:1, n:3, pp:341-343 [Journal]
  115. Joseph O'Rourke
    Computational geometry column 14. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1991, v:1, n:4, pp:517-522 [Journal]
  116. Joseph O'Rourke
    Computational geometry column 15. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1992, v:2, n:2, pp:215-217 [Journal]
  117. Joseph O'Rourke
    Computational geometry column 16. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1992, v:2, n:3, pp:335-339 [Journal]
  118. Joseph O'Rourke
    Computational geometry column 17. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1992, v:2, n:4, pp:443-447 [Journal]
  119. Joseph O'Rourke
    Computational geometry column 18. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1993, v:3, n:1, pp:107-113 [Journal]
  120. Joseph O'Rourke
    Computational geometry column 19. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1993, v:3, n:2, pp:221-224 [Journal]
  121. Joseph O'Rourke
    Computational geometry column 20. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1993, v:3, n:3, pp:347-349 [Journal]
  122. Joseph O'Rourke
    Computational geometry column 21. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1993, v:3, n:4, pp:463-465 [Journal]
  123. Joseph O'Rourke
    Computational geometry column 22. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1994, v:4, n:1, pp:119-122 [Journal]
  124. Joseph O'Rourke
    Computational geometry column 23. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1994, v:4, n:2, pp:239-242 [Journal]
  125. Joseph O'Rourke
    Computational geometry column 24. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1994, v:4, n:3, pp:363-366 [Journal]
  126. Joseph O'Rourke
    Computational geometry column 25. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1995, v:5, n:, pp:215-218 [Journal]
  127. Joseph O'Rourke
    Computational geometry column 26. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1995, v:5, n:3, pp:339-341 [Journal]
  128. Joseph O'Rourke
    Computational geometry column 27. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1996, v:6, n:1, pp:123-125 [Journal]
  129. Joseph O'Rourke
    Computational geometry column 28. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1996, v:6, n:2, pp:243-244 [Journal]
  130. Joseph O'Rourke
    Computational geometry column 29. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1996, v:6, n:4, pp:507-511 [Journal]
  131. Joseph O'Rourke
    Computational Geometry Column 32. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1997, v:7, n:5, pp:509-513 [Journal]
  132. Joseph O'Rourke
    Computational Geometry Column 31. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1997, v:7, n:4, pp:379-382 [Journal]
  133. Joseph O'Rourke
    Computational Geometry Column 30. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1997, v:7, n:1/2, pp:165-166 [Journal]
  134. Joseph O'Rourke
    Computational geometry column 33. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1998, v:8, n:3, pp:381-384 [Journal]
  135. Joseph O'Rourke
    Computational Geometry Column 35. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1999, v:9, n:4/5, pp:513-0 [Journal]
  136. Joseph O'Rourke
    Computational Geometry Column 47. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2006, v:16, n:4, pp:373-375 [Journal]
  137. Vladimir Estivill-Castro, Joseph O'Rourke, Jorge Urrutia, Dianna Xu
    Illumination of Polygons with Vertex Lights. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1995, v:56, n:1, pp:9-13 [Journal]
  138. Samir Khuller, Pankaj K. Agarwal, Joseph O'Rourke
    Open Problems Presented at SCG'98. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1999, v:30, n:2, pp:449-453 [Journal]
  139. Joseph O'Rourke, Alok Aggarwal, Sanjeev R. Maddila, Michael Baldwin
    An Optimal Algorithm for Finding Minimal Enclosing Triangles. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1986, v:7, n:2, pp:258-269 [Journal]
  140. Joseph O'Rourke
    Computing the relative neighborhood graph in the L1 and Linfinity metrics . [Citation Graph (0, 0)][DBLP]
    Pattern Recognition, 1982, v:15, n:3, pp:189-192 [Journal]
  141. Pankaj K. Agarwal, Boris Aronov, Joseph O'Rourke, Catherine A. Schevon
    Star Unfolding of a Polytope with Applications. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1997, v:26, n:6, pp:1689-1713 [Journal]
  142. Herbert Edelsbrunner, Joseph O'Rourke, Raimund Seidel
    Constructing Arrangements of Lines and Hyperplanes with Applications. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1986, v:15, n:2, pp:341-363 [Journal]
  143. Joseph O'Rourke
    The Signature of a Plane Curve. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1986, v:15, n:1, pp:34-51 [Journal]
  144. Joseph O'Rourke, Kenneth J. Supowit
    Some NP-hard polygon decomposition problems. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1983, v:29, n:2, pp:181-189 [Journal]
  145. Matthew Díaz, Joseph O'Rourke
    Algorithms for computing the center of area of a convex polygon. [Citation Graph (0, 0)][DBLP]
    The Visual Computer, 1994, v:10, n:8, pp:432-442 [Journal]
  146. Erik D. Demaine, Blaise Gassend, Joseph O'Rourke, Godfried T. Toussaint
    Polygons Flip Finitely: Flaws and a Fix. [Citation Graph (0, 0)][DBLP]
    CCCG, 2006, pp:- [Conf]
  147. Erik D. Demaine, Joseph O'Rourke
    Open Problems: Open Problems from CCCG 2005. [Citation Graph (0, 0)][DBLP]
    CCCG, 2006, pp:- [Conf]
  148. Nadia Benbernou, Joseph O'Rourke
    On the Maximum Span of Fixed-Angle Chains. [Citation Graph (0, 0)][DBLP]
    CCCG, 2006, pp:- [Conf]
  149. 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. [Citation Graph (0, 0)][DBLP]
    CCCG, 2007, pp:137-140 [Conf]
  150. Alex Benton, Joseph O'Rourke
    Unfolding Polyhedra via Cut-Tree Truncation. [Citation Graph (0, 0)][DBLP]
    CCCG, 2007, pp:77-80 [Conf]
  151. Erik D. Demaine, Joseph O'Rourke
    Open Problems from CCCG 2006. [Citation Graph (0, 0)][DBLP]
    CCCG, 2007, pp:277-280 [Conf]
  152. Greg Aloupis, Erik D. Demaine, Stefan Langerman, Pat Morin, Joseph O'Rourke, Ileana Streinu, Godfried T. Toussaint
    Edge-unfolding nested polyhedral bands. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2008, v:39, n:1, pp:30-42 [Journal]
  153. Mirela Damian, Joseph O'Rourke
    On corners of objects built from parallelepiped bricks. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2008, v:39, n:1, pp:43-54 [Journal]
  154. Mirela Damian, Robin Y. Flatland, Joseph O'Rourke
    Unfolding Manhattan Towers [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  155. Mirela Damian, Robin Y. Flatland, Joseph O'Rourke
    Epsilon-Unfolding Orthogonal Polyhedra [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  156. Joseph O'Rourke
    Unfolding Orthogonal Terrains [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  157. Jin-ichi Itoh, Joseph O'Rourke, Costin Vîlcu
    Unfolding Convex Polyhedra via Quasigeodesics [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  158. Joseph O'Rourke
    Unfolding Restricted Convex Caps [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  159. Mirela Damian, Robin Y. Flatland, Joseph O'Rourke, Suneeta Ramaswami
    Connecting Polygonizations via Stretches and Twangs [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  160. Mirela Damian, Robin Y. Flatland, Joseph O'Rourke, Suneeta Ramaswami
    A New Lower Bound on Guard Placement for Wireless Localization [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  161. Joseph O'Rourke
    Band Unfoldings and Prismatoids: A Counterexample [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  162. Mirela Damian, Joseph O'Rourke
    Partitioning Regular Polygons into Circular Pieces II:Nonconvex Partitions [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]

  163. A Pumping Lemma for Homometric Rhythms. [Citation Graph (, )][DBLP]


  164. Isometric Morphing of Triangular Meshes. [Citation Graph (, )][DBLP]


  165. Draining a Polygon - or - Rolling a Ball out of a Polygon. [Citation Graph (, )][DBLP]


  166. A Class of Convex Polyhedra with Few Edge Unfoldings. [Citation Graph (, )][DBLP]


  167. Open Problems from CCCG 2008. [Citation Graph (, )][DBLP]


  168. Sweeping minimum perimeter enclosing parallelograms: Optimal crumb cleanup. [Citation Graph (, )][DBLP]


  169. Open problem session. [Citation Graph (, )][DBLP]


  170. Finding minimal convex nested polygons. [Citation Graph (, )][DBLP]


  171. Linear Reconfiguration of Cube-Style Modular Robots. [Citation Graph (, )][DBLP]


  172. Connecting Polygonizations via Stretches and Twangs. [Citation Graph (, )][DBLP]


  173. Realistic Reconfiguration of Crystalline (and Telecube) Robots. [Citation Graph (, )][DBLP]


  174. Unfolding Manhattan Towers. [Citation Graph (, )][DBLP]


  175. Linear reconfiguration of cube-style modular robots. [Citation Graph (, )][DBLP]


  176. Highway hull revisited. [Citation Graph (, )][DBLP]


  177. Grid Vertex-Unfolding Orthogonal Polyhedra [Citation Graph (, )][DBLP]


  178. On the Maximum Span of Fixed-Angle Chains [Citation Graph (, )][DBLP]


  179. A Class of Convex Polyhedra with Few Edge Unfoldings [Citation Graph (, )][DBLP]


  180. Cauchy's Arm Lemma on a Growing Sphere [Citation Graph (, )][DBLP]


  181. Morphing of Triangular Meshes in Shape Space [Citation Graph (, )][DBLP]


  182. Highway Hull Revisited [Citation Graph (, )][DBLP]


  183. Unfolding Convex Polyhedra via Quasigeodesic Star Unfoldings [Citation Graph (, )][DBLP]


  184. Some Properties of Yao Y4 Subgraphs [Citation Graph (, )][DBLP]


  185. Continuous Blooming of Convex Polyhedra [Citation Graph (, )][DBLP]


  186. Pi/2-Angle Yao Graphs are Spanners [Citation Graph (, )][DBLP]


  187. The Yao Graph Y_6 is a Spanner [Citation Graph (, )][DBLP]


  188. On Flat Polyhedra deriving from Alexandrov's Theorem [Citation Graph (, )][DBLP]


  189. On Folding a Polygon to a Polyhedron [Citation Graph (, )][DBLP]


  190. Grid Vertex-Unfolding Orthogonal Polyhedra. [Citation Graph (, )][DBLP]


  191. Star Unfolding Convex Polyhedra via Quasigeodesic Loops. [Citation Graph (, )][DBLP]


Search in 0.008secs, Finished in 0.762secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002