Joseph O'Rourke

According to our database1, Joseph O'Rourke authored at least 214 papers between 1979 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Awards

ACM Fellow

ACM Fellow 2012, "For contributions to computational geometry and for broadening participation in computing.".

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2020
Tailoring for Every Body: Reshaping Convex Polyhedra.
CoRR, 2020

A Note on Unbounded Polyhedra Derived from Convex Caps.
CoRR, 2020

2019
Some Polycubes Have No Edge-Unzipping.
CoRR, 2019

Unfolding Polyhedra.
Proceedings of the 31st Canadian Conference on Computational Geometry, 2019

2018
Un-unzippable Convex Caps.
CoRR, 2018

Edge-Unfolding Nearly Flat Convex Caps.
Proceedings of the 34th International Symposium on Computational Geometry, 2018

Threadable Curves.
Proceedings of the 30th Canadian Conference on Computational Geometry, 2018

Open Problems from CCCG 2017.
Proceedings of the 30th Canadian Conference on Computational Geometry, 2018

2017
Unfolding Genus-2 Orthogonal Polyhedra with Linear Refinement.
Graphs Comb., 2017

Addendum to: Edge-Unfolding Nearly Flat Convex Caps.
CoRR, 2017

Open Problems from CCCG 2016.
Proceedings of the 29th Canadian Conference on Computational Geometry, 2017

Angle-monotone Paths in Non-obtuse Triangulations.
Proceedings of the 29th Canadian Conference on Computational Geometry, 2017

2016
Unfolding Convex Polyhedra via Radially Monotone Cut Trees.
CoRR, 2016

2015
New and improved spanning ratios for Yao graphs.
JoCG, 2015

On coloring box graphs.
Discret. Math., 2015

Spiral Unfoldings of Convex Polyhedra.
CoRR, 2015

Hypercube Unfoldings that Tile R^3 and R^2.
CoRR, 2015

2014
Development of curves on polyhedra via conical existence.
Comput. Geom., 2014

Reprint of: Refold rigidity of convex polyhedra.
Comput. Geom., 2014

Draining a polygon - or - rolling a ball out of a polygon.
Comput. Geom., 2014

Continuously Flattening Polyhedra Using Straight Skeletons.
Proceedings of the 30th Annual Symposium on Computational Geometry, 2014

2013
A 2-chain can interlock with an open 10-chain.
CoRR, 2013

New and Improved Spanning Ratios for Yao Graphs.
CoRR, 2013

Refold rigidity of convex polyhedra.
Comput. Geom., 2013

Unfolding Face-Neighborhood Convex Patches: Counterexamples and Positive Results.
Proceedings of the 25th Canadian Conference on Computational Geometry, 2013

2012
Computational geometry column 52.
SIGACT News, 2012

π/2-Angle Yao Graphs are Spanners.
Int. J. Comput. Geom. Appl., 2012

From Pop-Up Cards to Coffee-Cup Caustics: The Knight's Visor
CoRR, 2012

Unfolding Prismatoids as Convex Patches: Counterexamples and Positive Results
CoRR, 2012

Source Unfoldings of Convex Polyhedra via Certain Closed Curves
CoRR, 2012

2011
Efficient constant-velocity reconfiguration of crystalline robots.
Robotica, 2011

Continuous Blooming of Convex Polyhedra.
Graphs Comb., 2011

Common Edge-Unzippings for Tetrahedra
CoRR, 2011

Conical Existence of Closed Curves on Convex Polyhedra
CoRR, 2011

Convex Polyhedra Realizing Given Face Areas
CoRR, 2011

String-Wrapped Rotating Disks.
Proceedings of the Computational Geometry - XIV Spanish Meeting on Computational Geometry, 2011

Edge-guarding Orthogonal Polyhedra.
Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

Discrete and Computational Geometry.
Princeton University Press, ISBN: 978-0-691-14553-2, 2011

2010
Connecting Polygonizations via Stretches and Twangs.
Theory Comput. Syst., 2010

Morphing of Triangular Meshes in Shape Space.
Int. J. Shape Model., 2010

Star Unfolding Convex Polyhedra via Quasigeodesic Loops.
Discret. Comput. Geom., 2010

A Note on Solid Coloring of Pure Simplicial Complexes
CoRR, 2010

Flat Zipper-Unfolding Pairs for Platonic Solids
CoRR, 2010

On Folding a Polygon to a Polyhedron
CoRR, 2010

On Flat Polyhedra deriving from Alexandrov's Theorem
CoRR, 2010

Pi/2-Angle Yao Graphs are Spanners
CoRR, 2010

Highway hull revisited.
Comput. Geom., 2010

<i>pi</i>/2-Angle Yao Graphs Are Spanners.
Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

Open problem session.
Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, 2010

Sweeping minimum perimeter enclosing parallelograms: Optimal crumb cleanup.
Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, 2010

2009
Some Properties of Yao Y4 Subgraphs
CoRR, 2009

Linear reconfiguration of cube-style modular robots.
Comput. Geom., 2009

Open Problems from CCCG 2008.
Proceedings of the 21st Annual Canadian Conference on Computational Geometry, 2009

2008
Computational geometry column 51.
SIGACT News, 2008

Computational geometry column 50.
SIGACT News, 2008

Grid Vertex-Unfolding Orthogonal Polyhedra.
Discret. Comput. Geom., 2008

Unfolding Convex Polyhedra via Quasigeodesic Star Unfoldings
CoRR, 2008

Cauchy's Arm Lemma on a Growing Sphere
CoRR, 2008

On corners of objects built from parallelepiped bricks.
Comput. Geom., 2008

Unfolding Manhattan Towers.
Comput. Geom., 2008

Edge-unfolding nested polyhedral bands.
Comput. Geom., 2008

Realistic Reconfiguration of Crystalline (and Telecube) Robots.
Proceedings of the Algorithmic Foundation of Robotics VIII, 2008

A Pumping Lemma for Homometric Rhythms.
Proceedings of the 20th Annual Canadian Conference on Computational Geometry, 2008

Isometric Morphing of Triangular Meshes.
Proceedings of the 20th Annual Canadian Conference on Computational Geometry, 2008

A Class of Convex Polyhedra with Few Edge Unfoldings.
Proceedings of the 20th Annual Canadian Conference on Computational Geometry, 2008

2007
Computational geometry column 49.
SIGACT News, 2007

Epsilon-Unfolding Orthogonal Polyhedra.
Graphs Comb., 2007

Band Unfoldings and Prismatoids: A Counterexample
CoRR, 2007

A New Lower Bound on Guard Placement for Wireless Localization
CoRR, 2007

Unfolding Restricted Convex Caps
CoRR, 2007

Unfolding Convex Polyhedra via Quasigeodesics
CoRR, 2007

Unfolding Orthogonal Terrains
CoRR, 2007

Open Problems from CCCG 2006.
Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007

Unfolding Polyhedra via Cut-Tree Truncation.
Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007

Vertex Pops and Popturns.
Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007

Geometric folding algorithms - linkages, origami, polyhedra.
Cambridge University Press, 2007

2006
Computational geometry column 48.
SIGACT News, 2006

Computational geometry column 47.
SIGACT News, 2006

Geometric Restrictions on Producible Polygonal Protein Chains.
Algorithmica, 2006

Open Problems: Open Problems from CCCG 2005.
Proceedings of the 18th Annual Canadian Conference on Computational Geometry, 2006

Polygons Flip Finitely: Flaws and a Fix.
Proceedings of the 18th Annual Canadian Conference on Computational Geometry, 2006

On the Maximum Span of Fixed-Angle Chains.
Proceedings of the 18th Annual Canadian Conference on Computational Geometry, 2006

2004
Pattern recognition.
Proceedings of the Handbook of Discrete and Computational Geometry, Second Edition., 2004

Polygons.
Proceedings of the Handbook of Discrete and Computational Geometry, Second Edition., 2004

Visibility.
Proceedings of the Handbook of Discrete and Computational Geometry, Second Edition., 2004

Computational geometry column 46.
SIGACT News, 2004

Computational geometry column 45.
SIGACT News, 2004

A 2-chain can interlock with a k-chain
CoRR, 2004

Unfolding Smooth Primsatoids
CoRR, 2004

Partitioning Regular Polygons into Circular Pieces II:Nonconvex Partitions
CoRR, 2004

The structure of optimal partitions of orthogonal polygons into fat rectangles.
Comput. Geom., 2004

Continuous foldability of polygonal paper.
Proceedings of the 16th Canadian Conference on Computational Geometry, 2004

Unfolding polyhedral bands.
Proceedings of the 16th Canadian Conference on Computational Geometry, 2004

2003
Computational geometry column 44.
SIGACT News, 2003

A Note on Objects Built From Bricks without Corners
CoRR, 2003

On the development of the intersection of a plane with a polytope.
Comput. Geom., 2003

Interlocked open and closed linkages with few joints.
Comput. Geom., 2003

Pushing blocks is hard.
Comput. Geom., 2003

Coloring Objects Built From Bricks.
Proceedings of the 15th Canadian Conference on Computational Geometry, 2003

Partitioning Regular Polygons into Circular Pieces I: Convex Partitions.
Proceedings of the 15th Canadian Conference on Computational Geometry, 2003

2002
Computational geometry column 43.
SIGACT News, 2002

Enumerating Foldings and Unfoldings Between Polygons and Polytopes.
Graphs Comb., 2002

A note on reconfiguring tree linkages: trees can lock.
Discret. Appl. Math., 2002

Open Problems from CCCG 2002
CoRR, 2002

The Foldings of a Square to Convex Polyhedra.
Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2002

Flat-State Connectivity of Linkages under Dihedral Motions.
Proceedings of the Algorithms and Computation, 13th International Symposium, 2002

Interlocked open linkages with few joints.
Proceedings of the 18th Annual Symposium on Computational Geometry, Barcelona, 2002

Vertex-unfoldings of simplicial manifolds.
Proceedings of the 18th Annual Symposium on Computational Geometry, Barcelona, 2002

Partitioning orthogonal polygons into fat rectangles in polynomial time.
Proceedings of the 14th Canadian Conference on Computational Geometry, 2002

Nonorthogonal polyhedra built from rectangles.
Proceedings of the 14th Canadian Conference on Computational Geometry, 2002

Open problems from cccg 2001.
Proceedings of the 14th Canadian Conference on Computational Geometry, 2002

On flat-state connectivity of chains with fixed acute angles.
Proceedings of the 14th Canadian Conference on Computational Geometry, 2002

2001
Computational geometry column 41.
SIGACT News, 2001

Computational geometry.
SIGACT News, 2001

Computational Geometry Column 42.
Int. J. Comput. Geom. Appl., 2001

Locked and Unlocked Polygonal Chains in Three Dimensions.
Discret. Comput. Geom., 2001

Vertex-Unfoldings of Simplicial Polyhedra
CoRR, 2001

Polygonal chains cannot lock in 4D.
Comput. Geom., 2001

Partitioning orthogonal polygons into fat rectangles.
Proceedings of the 13th Canadian Conference on Computational Geometry, 2001

Narrowing light rays with mirrors.
Proceedings of the 13th Canadian Conference on Computational Geometry, 2001

Open problems from cccg 2000.
Proceedings of the 13th Canadian Conference on Computational Geometry, 2001

Short interlocked linkages.
Proceedings of the 13th Canadian Conference on Computational Geometry, 2001

2000
Computational geometry column 40.
SIGACT News, 2000

Computational geometry column 39.
SIGACT News, 2000

Computational geometry column 38.
SIGACT News, 2000

Examples, Counterexamples, and Enumeration Results for Foldings and Unfoldings between Polygons and Polytopes
CoRR, 2000

PushPush is NP-hard in 2D
CoRR, 2000

An Extension of Cauchy's Arm Lemma with Application to Curve Development.
Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2000

An Implementation of Chen & Han's Shortest Paths Algorithm.
Proceedings of the 12th Canadian Conference on Computational Geometry, 2000

Session O1: Open Problems and Planning.
Proceedings of the 12th Canadian Conference on Computational Geometry, 2000

PushPush and Push-1 are NP-hard in 2D.
Proceedings of the 12th Canadian Conference on Computational Geometry, 2000

1999
Computational geometry column 36.
SIGACT News, 1999

Computational geometry column 35.
SIGACT News, 1999

Computational geometry column 37.
SIGACT News, 1999

Open Problems Presented at SCG'98.
J. Algorithms, 1999

PushPush is NP-hard in 3D
CoRR, 1999

Zero-Parity Stabbing Information
CoRR, 1999

Locked and Unlocked Polygonal Chains in 3D.
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

Metamorphosis of the Cube.
Proceedings of the Fifteenth Annual Symposium on Computational Geometry, 1999

1998
Computational geometry column 33.
SIGACT News, 1998

Computational geometry.
SIGACT News, 1998

Computational Geometry Column 34.
Int. J. Comput. Geom. Appl., 1998

The vertex-edge visibility graph of a polygon.
Comput. Geom., 1998

Folding and Unfolding in Computational Geometry.
Proceedings of the Discrete and Computational Geometry, Japanese Conference, 1998

Unfolding some classes of orthogonal polyhedra.
Proceedings of the 10th Canadian Conference on Computational Geometry, 1998

On reconfiguring tree linkages: Trees can lock.
Proceedings of the 10th Canadian Conference on Computational Geometry, 1998

1997
Computational geometry column 32.
SIGACT News, 1997

Computational geometry column 31.
SIGACT News, 1997

Computational Geometry Column 30.
SIGACT News, 1997

Star Unfolding of a Polytope with Applications.
SIAM J. Comput., 1997

Vertex-Edge Pseudo-Visibility Graphs: Characterization and Recognition.
Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997

Vertex pi-lights for monotone mountains.
Proceedings of the 9th Canadian Conference on Computational Geometry, 1997

1996
Computational Geometry Column 29.
SIGACT News, 1996

Computational geometry column 28.
SIGACT News, 1996

On reconstructing polyhedra from parallel slices.
Int. J. Comput. Geom. Appl., 1996

1995
Computational geometry column 27.
SIGACT News, 1995

Computational geometry column 26.
SIGACT News, 1995

Illumination of Polygons with Vertex Lights.
Inf. Process. Lett., 1995

Computational geometry column 25.
Int. J. Comput. Geom. Appl., 1995

Illuminating convex polygonswith vertex floodlight.
Proceedings of the 7th Canadian Conference on Computational Geometry, 1995

1994
Algorithms for computing the center of area of a convex polygon.
Vis. Comput., 1994

Computational Geometry Column 24.
SIGACT News, 1994

Computational geometry column 23.
SIGACT News, 1994

Computational geometry.
SIGACT News, 1994

Computational geometry column 22.
Int. J. Comput. Geom. Appl., 1994

On the Scaling Heuristic for Reconstruction from Slices.
CVGIP Graph. Model. Image Process., 1994

Two Segment Classes with Hamiltonian Visibility Graphs.
Comput. Geom., 1994

1993
Computational geometry column 18.
SIGACT News, 1993

Computational geometry column 21.
Int. J. Comput. Geom. Appl., 1993

Computational geometry column 20.
Int. J. Comput. Geom. Appl., 1993

Computational geometry column 19.
Int. J. Comput. Geom. Appl., 1993

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., 1993

Recovery of Convex Hulls From External Visibility Graphs.
Proceedings of the 5th Canadian Conference on Computational Geometry, 1993

1992
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, 1992

Mathematics in Action (Stan Wagon).
SIAM Review, 1992

Computational geometry column 17.
Int. J. Comput. Geom. Appl., 1992

Computational geometry column 16.
Int. J. Comput. Geom. Appl., 1992

Computational geometry column 15.
Int. J. Comput. Geom. Appl., 1992

Nonoverlap of the Star Unfolding.
Discret. Comput. Geom., 1992

1991
Computational geometry column 14.
Int. J. Comput. Geom. Appl., 1991

Computational geometry column 13.
Int. J. Comput. Geom. Appl., 1991

Computational geometry column 12.
Int. J. Comput. Geom. Appl., 1991

Computational geometry column 11.
Int. J. Comput. Geom. Appl., 1991

1990
Computational geometry column 9.
SIGACT News, 1990

Star Unfolding of a Polytope with Applications (Extended Abstract).
Proceedings of the SWAT 90, 1990

1989
Finding Minimal Convex Nested Polygons
Inf. Comput., October, 1989

Computational geometry column 8.
SIGACT News, 1989

Computational geometry column.
SIGACT News, 1989

Computing the Kernel of a Point Set in a Polygon (Extended Abstract).
Proceedings of the Algorithms and Data Structures, 1989

Computing the Center of Area of a Polygon.
Proceedings of the Algorithms and Data Structures, 1989

Computing the Geodesic Diameter of a 3-Polytope.
Proceedings of the Fifth Annual Symposium on Computational Geometry, 1989

1988
Lower Bounds on Moving a Ladder in Two and Three Dimensions.
Discret. Comput. Geom., 1988

Arrangements of Lines in 3-Space: A Data Structure with Applications.
Proceedings of the Fourth Annual Symposium on Computational Geometry, 1988

1987
Moving a Ladder in Three Dimensions: Upper and Lower Bounds.
Proceedings of the Third Annual Symposium on Computational Geometry, 1987

1986
The Signature of a Plane Curve.
SIAM J. Comput., 1986

Constructing Arrangements of Lines and Hyperplanes with Applications.
SIAM J. Comput., 1986

An Optimal Algorithm for Finding Minimal Enclosing Triangles.
J. Algorithms, 1986

Worst-Case Optimal Algorithms for Constructing Visibility Polygons with Holes.
Proceedings of the Second Annual ACM SIGACT/SIGGRAPH Symposium on Computational Geometry, 1986

1985
Finding minimal enclosing boxes.
Int. J. Parallel Program., 1985

Counterexamples to a minimal circumscription algorithm.
Comput. Vis. Graph. Image Process., 1985

Shortest Paths on Polyhedral Surfaces.
Proceedings of the STACS 85, 1985

1984
Dynamic Quantization: Two Adaptive Data Structures for Multidimensional Spaces.
IEEE Trans. Pattern Anal. Mach. Intell., 1984

1983
Some NP-hard polygon decomposition problems.
IEEE Trans. Inf. Theory, 1983

The MEDITS Software Tools to Support Special Services System Engineering.
Proceedings of the Proceedings IEEE INFOCOM 83, San Diego, CA, USA, April 18-21, 1983, 1983

1982
Computing the relative neighborhood graph in the L<sup>1</sup> and L<sup>infinity</sup> metrics .
Pattern Recognit., 1982

Polygon decomposition and switching function minimization.
Comput. Graph. Image Process., 1982

A new linear algorithm for intersecting convex polygons.
Comput. Graph. Image Process., 1982

1981
An On-Line Algorithm for Fitting Straight Lines Between Data Ranges.
Commun. ACM, 1981

Dynamically Quantized Spaces for Focusing the Hough Transform.
Proceedings of the 7th International Joint Conference on Artificial Intelligence, 1981

Polyhedra of Minimal Area as 3D Object Models.
Proceedings of the 7th International Joint Conference on Artificial Intelligence, 1981

1980
Special problems in human movement simulation.
Proceedings of the 7th Annual Conference on Computer Graphics and Interactive Techniques, 1980

Human Movement Understanding: A Variety of Perspectives.
Proceedings of the 1st Annual National Conference on Artificial Intelligence, 1980

1979
Correction to "Decomposition of Three-Dimensional Objects into Spheres".
IEEE Trans. Pattern Anal. Mach. Intell., 1979

Decomposition of Three-Dimensional Objects into Spheres.
IEEE Trans. Pattern Anal. Mach. Intell., 1979


  Loading...