Joseph O’rourke
#114,164
Most Influential Person Now
Joseph O’rourke's AcademicInfluence.com Rankings
Joseph O’rourkecomputer-science Degrees
Computer Science
#4401
World Rank
#4636
Historical Rank
Database
#1610
World Rank
#1688
Historical Rank
Download Badge
Computer Science
Why Is Joseph O’rourke Influential?
(Suggest an Edit or Addition)Joseph O’rourke's Published Works
Number of citations in a given year to any of this author's works
Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author
Published Works
- Computational geometry in C (1995) (2075)
- Art gallery theorems and algorithms (1987) (1542)
- Handbook of Discrete and Computational Geometry, Second Edition (1997) (1060)
- Geometric folding algorithms - linkages, origami, polyhedra (2007) (519)
- Constructing arrangements of lines and hyperplanes with applications (1983) (508)
- Computational geometry in C (2nd ed.) (1998) (453)
- Some NP-hard polygon decomposition problems (1983) (203)
- Finding minimal enclosing boxes (1985) (187)
- Geometric Folding Algorithms: Linkages (2007) (181)
- A new linear algorithm for intersecting convex polygons (1982) (148)
- An Optimal Algorithm for Finding Minimal Enclosing Triangles (1986) (123)
- Worst-case optimal algorithms for constructing visibility polygons with holes (1986) (119)
- On Polygonal Chain Approximation (1988) (113)
- Star Unfolding of a Polytope with Applications (1997) (94)
- An on-line algorithm for fitting straight lines between data ranges (1981) (92)
- Finding minimal convex nested polygons (1985) (85)
- An alternate proof of the rectilinear art gallery theorem (1983) (84)
- Folding and Unfolding in Computational Geometry (1998) (83)
- Nonoverlap of the star unfolding (1991) (83)
- Galleries need fewer mobile guards: A variation on Chvátal's theorem (1983) (79)
- Computing circular separability (1986) (78)
- Unfolding some classes of orthogonal polyhedra (1998) (77)
- PushPush and Push-1 are NP-hard in 2D (2000) (71)
- Connect-the-dots: a new heuristic (1987) (68)
- An Implementation of Chen & Han's Shortest Paths Algorithm (2000) (64)
- Arrangements of lines in 3-space: a data structure with applications (1988) (61)
- Stationing guards in rectilinear art galleries (1984) (60)
- The Open Problems Project (2007) (59)
- Computational geometry column 18 (1991) (57)
- Locked and unlocked polygonal chains in 3D (1998) (55)
- Open problems from cccg 2001 (2002) (51)
- Shortest Paths on Polyhedral Surfaces (1985) (50)
- Dynamically Quantized Spaces for Focusing the Hough Transform (1981) (47)
- A Survey of Folding and Unfolding in Computational Geometry (2007) (46)
- When Can a Polygon Fold to a Polytope (1999) (46)
- Polygonal chains cannot lock in 4d (1999) (45)
- Locked and Unlocked Polygonal Chains in Three Dimensions (1999) (44)
- Polyhedra of Minimal Area as 3D Object Models (1981) (43)
- Linear Reconfiguration of Cube-Style Modular Robots (2007) (42)
- Vertex-edge pseudo-visibility graphs: characterization and recognition (1997) (40)
- π/2-Angle Yao Graphs are Spanners (2010) (39)
- Dynamic Quantization: Two Adaptive Data Structures for Multidimensional Spaces (1984) (39)
- Open problem session (2010) (37)
- On reconstructing polyhedra from parallel slices (1996) (37)
- Uniqueness of Orthogonal Connect-the-Dots (1988) (37)
- Illumination of Polygons with Vertex Lights (1995) (34)
- A note on reconfiguring tree linkages: trees can lock (2002) (33)
- Pushing blocks is hard (2003) (33)
- New and Improved Spanning Ratios for Yao Graphs (2013) (32)
- Continuous foldability of polygonal paper (2004) (31)
- Computational geometry column 35 (1999) (29)
- Enumerating Foldings and Unfoldings Between Polygons and Polytopes (2001) (29)
- The vertex-edge visibility graph of a polygon (1998) (28)
- Computational geometry column 32 (1997) (27)
- Vertex-unfoldings of simplicial manifolds (2001) (27)
- Computational geometry column 45 (2004) (26)
- Epsilon-Unfolding Orthogonal Polyhedra (2006) (26)
- Unfolding Manhattan Towers (2007) (25)
- Computing the relative neighborhood graph in the L1 and Linfinity metrics (1982) (24)
- Open Problems in the Combinatorics of Visibility and Illumination (1998) (21)
- Computational Geometry in C by Joseph O'Rourke (1998) (21)
- On reconfiguring tree linkages: Trees can lock (1999) (21)
- Open Problems: Open Problems from CCCG 2005 (2006) (20)
- The Signature of a Plane Curve (1986) (20)
- Lower bounds on moving a ladder in two and three dimensions (1988) (19)
- Computing the geodesic diameter of a 3-polytope (1989) (19)
- Curve Similarity via Signatures (1985) (19)
- Geometric Folding Algorithms: Map Folding (2007) (19)
- Metamorphosis of the cube (1999) (18)
- On the development of the intersection of a plane with a polytope (2000) (18)
- Moving a ladder in three dimensions: upper and lower bounds (1987) (17)
- Efficient constant-velocity reconfiguration of crystalline robots** (2011) (17)
- Edge-guarding Orthogonal Polyhedra (2011) (17)
- Two Segment Classes with Hamiltonian Visibility Graphs (1994) (17)
- Interlocked open linkages with few joints (2002) (17)
- Star Unfolding Convex Polyhedra via Quasigeodesic Loops (2007) (17)
- Edge-unfolding nested polyhedral bands (2008) (16)
- Unfolding Genus-2 Orthogonal Polyhedra with Linear Refinement (2016) (16)
- Finding A Shortest Ladder Path: A Special Case (1987) (15)
- The structure of optimal partitions of orthogonal polygons into fat rectangles (2004) (14)
- Continuous Blooming of Convex Polyhedra (2009) (14)
- Continuously Flattening Polyhedra Using Straight Skeletons (2014) (14)
- Computational geometry column 9 (1990) (13)
- Flat-State Connectivity of Linkages under Dihedral Motions (2002) (13)
- Geometric Restrictions on Producible Polygonal Protein Chains (2003) (13)
- Computational geometry column (1989) (12)
- Discrete and Computational Geometry (2011) (12)
- Interlocked open and closed linkages with few joints (2003) (12)
- Examples, Counterexamples, and Enumeration Results for Foldings and Unfoldings between Polygons and Polytopes (2000) (12)
- Highway hull revisited (2008) (11)
- Nonorthogonal polyhedra built from rectangles (2001) (11)
- PushPush is NP-hard in 2D (1999) (11)
- Edge-Unfolding Nearly Flat Convex Caps (2017) (10)
- Computational geometry column 38 (1991) (10)
- Computational geometry column 26 (1992) (10)
- On the development of closed convex curves on 3-polytopes (1989) (10)
- A New Lower Bound on Guard Placement for Wireless Localization (2007) (10)
- An Extension of Cauchy's Arm Lemma with Application to Curve Development (2000) (10)
- Narrowing light rays with mirrors (2001) (10)
- Partitioning orthogonal polygons into fat rectangles (2001) (9)
- Morphing of Triangular Meshes in Shape Space (2008) (9)
- The Foldings of a Square to Convex Polyhedra (2002) (9)
- Realistic Reconfiguration of Crystalline (and Telecube) Robots (2008) (9)
- Vertex Pops and Popturns (2007) (9)
- Angle-monotone Paths in Non-obtuse Triangulations (2017) (9)
- Pi/2-Angle Yao Graphs are Spanners (2010) (9)
- Grid Vertex-Unfolding Orthogonal Polyhedra (2005) (9)
- Algorithms for computing the center of area of a convex polygon (1994) (8)
- Draining a Polygon - or - Rolling a Ball out of a Polygon (2014) (8)
- The Computational Geometry Column #2 (1987) (8)
- The Computational Geometry Column #4 (1988) (8)
- Recovery of Convex Hulls From External Visibility Graphs (1993) (8)
- Image analysis of human motion (1980) (8)
- Computational geometry column 47 (2000) (8)
- Flat Zipper-Unfolding Pairs for Platonic Solids (2010) (8)
- Computational geometry column 39 (2000) (8)
- Computational Geometry Column 24 (1993) (8)
- Connecting Polygonizations via Stretches and Twangs (2007) (7)
- Unfolding Orthogonal Terrains (2007) (7)
- Partitioning orthogonal polygons into fat rectangles in polynomial time (2002) (7)
- How to Fold It: Unfolding Orthogonal Polyhedra (2011) (7)
- Counterexamples to a minimal circumscription algorithm (1985) (7)
- Computational geometry column 48 (2006) (7)
- Unfolding Polyhedra (2019) (7)
- The Continuous Hexachordal Theorem (2009) (7)
- Unfolding polyhedral bands (2004) (7)
- Development of Curves on Polyhedra via Conical Existence (2014) (7)
- Polygon decomposition and switching function minimization (1982) (6)
- Computational geometry column 43 (2002) (6)
- Vertex pi-lights for monotone mountains (1997) (6)
- Refold rigidity of convex polyhedra (2013) (6)
- Unfolding Convex Polyhedra via Radially Monotone Cut Trees (2016) (6)
- On flat-state connectivity of chains with fixed acute angles (2002) (6)
- Star Unfolding of a Polytope with Applications (Extended Abstract) (1990) (6)
- Unfolding Polyhedra via Cut-Tree Truncation (2007) (5)
- The generative-rules definition of creativity (1994) (5)
- Computational geometry (1994) (5)
- Computing the Center of Area of a Polygon (1989) (5)
- Computational Geometry in C: Motion Planning (1998) (5)
- Band Unfoldings and Prismatoids: A Counterexample (2007) (5)
- Computational geometry column 33 (1997) (5)
- Computational geometry column 52 (2012) (5)
- On Flat Polyhedra deriving from Alexandrov's Theorem (2010) (5)
- Unfolding Convex Polyhedra via Quasigeodesics (2007) (5)
- Isometric Morphing of Triangular Meshes (2008) (5)
- Computational geometry column 49 (2007) (5)
- Unfolding Prismatoids as Convex Patches: Counterexamples and Positive Results (2012) (5)
- Addendum to: Edge-Unfolding Nearly Flat Convex Caps (2017) (5)
- Unfolding Smooth Primsatoids (2004) (5)
- Cauchy's Arm Lemma on a Growing Sphere (2008) (4)
- Convex Polyhedra Realizing Given Face Areas (2011) (4)
- Computational Geometry in C: Search and Intersection (1998) (4)
- Computational Geometry Column 29 (1996) (4)
- Sweeping minimum perimeter enclosing parallelograms: Optimal crumb cleanup (2010) (4)
- Unfolding Face-Neighborhood Convex Patches: Counterexamples and Positive Results (2013) (4)
- Coloring Objects Built From Bricks (2003) (4)
- Computational geometry column 44 (1998) (4)
- On the Scaling Heuristic for Reconstruction from Slices (1994) (4)
- Computational geometry column 23 (1994) (3)
- Some Polycubes Have No Edge-Unzipping (2019) (3)
- Computational geometry column 8 (1989) (3)
- Illuminating convex polygonswith vertex floodlight (1995) (3)
- Computing the Kernel of a Point Set in a Polygon (Extended Abstract) (1989) (3)
- Conical Existence of Closed Curves on Convex Polyhedra (2011) (3)
- Spiral Unfoldings of Convex Polyhedra (2015) (3)
- Convex Hulls in Three Dimensions (1998) (3)
- How to Fold It: Index (2011) (3)
- Geometric Folding Algorithms: Preface (2007) (3)
- Computational geometry column 46 (2004) (3)
- Computational Geometry in C: Voronoi Diagrams (1998) (3)
- Partitioning Regular Polygons into Circular Pieces I: Convex Partitions (2003) (3)
- Reshaping Convex Polyhedra (2021) (3)
- On the Maximum Span of Fixed-Angle Chains (2007) (3)
- Computational Geometry in C: Convex Hulls in Three Dimensions (1998) (3)
- On Folding a Polygon to a Polyhedron (2010) (3)
- Computational Geometry in C: Polygon Partitioning (1998) (3)
- Discrete And Computational Geometry: Ten Years Later (2007) (3)
- A Pumping Lemma for Homometric Rhythms (2008) (2)
- Unfolding Convex Polyhedra via Quasigeodesic Star Unfoldings (2008) (2)
- Simple Closed Quasigeodesics on Tetrahedra (2022) (2)
- Polygons Flip Finitely: Flaws and a Fix (2006) (2)
- Open Problems from CCCG 2017 (2018) (2)
- Pattern recognition (2004) (2)
- Computational geometry column 36 (1997) (2)
- A 2-chain can interlock with a k-chain (2004) (2)
- Vertex-Unfoldings of Simplicial Polyhedra (2001) (2)
- Tailoring for Every Body: Reshaping Convex Polyhedra (2020) (2)
- How to Fold It: Robot Arms (2011) (2)
- Vertex-Transplants on a Convex Polyhedron (2020) (2)
- Computational geometry column 41 (2001) (2)
- Computational geometry column 28 (1996) (2)
- Reconfiguration of Chains (2007) (1)
- Unfolding Restricted Convex Caps (2007) (1)
- Common Edge-Unzippings for Tetrahedra (2011) (1)
- Zero-Parity Stabbing Information (1999) (1)
- Source Unfoldings of Convex Polyhedra via Certain Closed Curves (2012) (1)
- Computational Geometry in C: Polygon Triangulation (1998) (1)
- Quasi-Twisting Convex Polyhedra (2022) (1)
- A Note on Objects Built From Bricks without Corners (2003) (1)
- String-Wrapped Rotating Disks (2011) (1)
- Geometric Folding Algorithms: Rigid Origami and Curved Creases (2007) (1)
- Computational Geometry Column 30 (1997) (1)
- How to Fold It: Folding Polygons to Convex Polyhedra (2011) (1)
- Edge-Unfolding Medial Axis Polyhedra (2008) (1)
- A Class of Convex Polyhedra with Few Edge Unfoldings (2008) (1)
- Short interlocked linkages (2001) (1)
- Every Tetrahedron has a 3-vertex Quasigeodesic (2021) (1)
- Some Polycubes Have No Edge Zipper Unfolding (2019) (1)
- Computational geometry column 40 (2000) (1)
- Computational geometry column 31 (1997) (1)
- Reprint of: Refold rigidity of convex polyhedra (2014) (1)
- Session O1: Open Problems and Planning (2000) (1)
- Some Properties of Yao Y4 Subgraphs (2009) (1)
- A Note on Solid Coloring of Pure Simplicial Complexes (2010) (1)
- 2 2 D ec 2 00 2 Open Problems from CCCG 2002 (2002) (1)
- The Yao Graph Y_6 is a Spanner (2010) (1)
- Hypercube Unfoldings that Tile R^3 and R^2 (2015) (1)
- Cut Locus Realizations on Convex Polyhedra (2021) (1)
- Rolling Polyhedra on Tessellations (2022) (0)
- Geometric Folding Algorithms: Reconstruction of Polyhedra (2007) (0)
- Proceedings of the First Annual Symposium on Computational Geometry, Baltimore, Maryland, USA, June 5-7, 1985 (1985) (0)
- 30 POLYGONS (2016) (0)
- A 2-chain can interlock with an open 10-chain (2013) (0)
- Computational geometry column 27 (1995) (0)
- Unfolding Genus-2 Orthogonal Polyhedra with Linear Refinement (2017) (0)
- Book review: Three-Dimensional Computer Vision. by Olivier Faugeras (The MIT Press, 1993) (1995) (0)
- How to Fold It: Fold and One-Cut (2011) (0)
- On corners of objects built from parallelepiped bricks (2004) (0)
- Polygonal Chains : from Pocket Flipping to Protein Folding (0)
- On coloring box graphs (2015) (0)
- Upper and Lower Bounds (2007) (0)
- Geometric Folding Algorithms: Simple Crease Patterns (2007) (0)
- A Generalization of Cauchy's Arm Lemma with an Application to Curve Development (2000) (0)
- Geometric Folding Algorithms: Folding Polygons to Polyhedra (2007) (0)
- Geometric Folding Algorithms: Edge Unfolding of Polyhedra (2007) (0)
- How to Fold It: Glossary (2011) (0)
- Advanced Problems: 6368-6373 (1981) (0)
- A ug 1 99 9 Computational Geometry Column 36 (1999) (0)
- How to Fold It: Preface (2011) (0)
- Open Problems Presented at SCG'98 (1999) (0)
- C G ] 1 3 Ju n 20 09 Continuous Blooming of Convex Polyhedra (2019) (0)
- Geometric Folding Algorithms: Introduction (2007) (0)
- Computational geometry (1998) (0)
- NRC Publications Archive Archives des publications du CNRC : a pilot study (2019) (0)
- Geometric Folding Algorithms: Joint-Constrained Motion (2007) (0)
- Geometric Folding Algorithms: Geometric Constructibility (2007) (0)
- Book review: Machine Learning: A Theoretical Approach by Balas K. Natarajan (Morgan Kaufmann Publishers, 1991) (1993) (0)
- C G ] 8 O ct 1 99 9 Locked and Unlocked Polygonal Chains in 3 D ∗ T . Biedl (2008) (0)
- Geometric Folding Algorithms: Higher Dimensions (2007) (0)
- How to Fold It: Origami (2011) (0)
- Minimum Length Barrier to X-rays in a Square (2008) (0)
- 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) (1992) (0)
- Computational geometry (2001) (0)
- Geometric Folding Algorithms: Protein Folding (2007) (0)
- Computational geometry column (1989) (0)
- Problem Classification and Examples (2007) (0)
- Computational Geometry in C: Arrangements (1998) (0)
- Shortest Paths and Geodesics (2007) (0)
- A Note on Unbounded Polyhedra Derived from Convex Caps (2020) (0)
- From Pop-Up Cards to Coffee-Cup Caustics: The Knight's Visor (2012) (0)
- M ay 2 00 2 Nonorthogonal Polyhedra Built from Rectangles ∗ Melody (2019) (0)
- C G ] 2 4 Ja n 20 00 PushPush is NP-hard in 2 D (2008) (0)
- Computational geometry column 37 (1999) (0)
- Threadable Curves (2018) (0)
- How to Fold It: Answers to Exercises (2011) (0)
- How to Fold It: Polyhedra (2011) (0)
- Mathematics in Action (Stan Wagon) (1992) (0)
- Session details: Computational geometry (2006) (0)
- Proceedings of the 29th Canadian Conference on Computational Geometry, CCCG 2017, July 26-28, 2017, Carleton University, Ottawa, Ontario, Canada (2017) (0)
- Contemporary Mathematics Unfolding Orthogonal Polyhedra (2007) (0)
- C G ] 11 N ov 1 99 8 Locked and Unlocked Polygonal Chains in 3 D ∗ T . Biedl (2008) (0)
- Continuously Flattening Polyhedra Using Straight Skeletons Citation (2014) (0)
- Every Combinatorial Polyhedron Can Unfold with Overlap (2022) (0)
- A ug 2 00 1 Computational Geometry Column 42 (2008) (0)
- 50 MOTION (2004) (0)
- Polar Zonohedra Edge-Unfold to Nets (2023) (0)
- Geometric Folding Algorithms: Planar Linkage Mechanisms (2007) (0)
- Contemporary Mathematics All Polygons Flip Finitely (2007) (0)
- Pushpush Is Np-hard in 3d and the Smith Problem Solving Group † (2006) (0)
- Computational Geometry in C: Sources (1998) (0)
- Computational geometry (1992) (0)
- Computational geometry (1988) (0)
- How to Fold It: Further Reading (2011) (0)
- Reshaping Convex Polyhedra: Two Theorems Sketched (2022) (0)
- Computational geometry column 51 (2008) (0)
- Geometric Folding Algorithms: Bibliography (2007) (0)
- How to Fold It: Flat Vertex Folds (2011) (0)
- Geometric Folding Algorithms: The Tree Method (2007) (0)
- 54 PATTERN RECOGNITION (2017) (0)
- How to Fold It: Straight-Line Linkages and the Pantograph (2011) (0)
- Geometric Folding Algorithms: Rigid Frameworks (2007) (0)
- Msn-support Help (2001) (0)
- How to Fold It: Protein Folding and Pop-Up Cards (2011) (0)
- One Complete Straight Cut (2007) (0)
- Computational geometry column 50 (2008) (0)
- The following is a chapter on modeling motion from the brand new Handbook of Discrete and Computational Geometry (2005) (0)
- Geometric Folding Algorithms: General Crease Patterns (2007) (0)
- Unfolding Polyhedral (2007) (0)
- Hamiltonian Quasigeodesics yield Nets (2022) (0)
- Geometric Folding Algorithms: Silhouettes and Gift Wrapping (2007) (0)
- Toward Unfolding Doubly Covered n-Stars (2018) (0)
- How to Fold It: Linkages (2011) (0)
- Un-unzippable Convex Caps (2018) (0)
- C G ] 2 9 Se p 20 00 On Reconfiguring Tree Linkages : Trees can Lock (2019) (0)
- Book reivew: Consciousness Reconsidered by Owen Flanagan (The MIT Press. 1992) (1993) (0)
- How to Fold It: Dürer's Problem: Edge Unfolding (2011) (0)
- 3 Theory of Shape Space for Triangulated 3 D Polygons (2008) (0)
- Computational geometry column (1989) (0)
- C G ] 3 S ep 2 00 0 PushPush and Push-1 are NP-hard in 2 D (2008) (0)
This paper list is powered by the following services:
