Joseph O'Rourke

From MaRDI portal
Revision as of 09:09, 25 September 2023 by Import230924090903 (talk | contribs) (Created automatically from import230924090903)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:223096

Available identifiers

zbMath Open orourke.josephDBLPo/JosephORourkeWikidataQ6285896 ScholiaQ6285896MaRDI QIDQ223096

List of research outcomes





PublicationDate of PublicationType
Rolling polyhedra on tessellations2024-05-16Paper
Reshaping Convex Polyhedra2024-02-10Paper
Cut locus realizations on convex polyhedra2023-07-31Paper
Toward unfolding doubly covered \(n\)-stars2023-03-31Paper
https://portal.mardi4nfdi.de/entity/Q58818572023-03-13Paper
Polar Zonohedra Edge-Unfold to Nets2023-02-15Paper
Every Combinatorial Polyhedron Can Unfold with Overlap2022-12-30Paper
Star unfolding of a polytope with applications2022-12-09Paper
https://portal.mardi4nfdi.de/entity/Q51043522022-09-09Paper
Simple Closed Quasigeodesics on Tetrahedra2022-03-09Paper
Pop-Up Geometry2022-02-03Paper
Every Tetrahedron has a 3-vertex Quasigeodesic2021-09-15Paper
Edge-Unfolding Nearly Flat Convex Caps2020-08-18Paper
Tailoring for Every Body: Reshaping Convex Polyhedra2020-08-04Paper
Interlocked open linkages with few joints2018-11-23Paper
Vertex-unfoldings of simplicial manifolds2018-11-23Paper
Book Review2018-08-20Paper
New and Improved Spanning Ratios for Yao Graphs2018-04-23Paper
Continuously Flattening Polyhedra Using Straight Skeletons2018-04-23Paper
Unfolding genus-2 orthogonal polyhedra with linear refinement2017-12-12Paper
New and improved spanning ratios for Yao graphs2017-03-30Paper
https://portal.mardi4nfdi.de/entity/Q51777692015-03-05Paper
On coloring box graphs2014-11-20Paper
Development of curves on polyhedra via conical existence2014-01-22Paper
Draining a polygon-or-rolling a ball out of a polygon2014-01-22Paper
Reprint of: Refold rigidity of convex polyhedra2014-01-22Paper
Refold rigidity of convex polyhedra2013-07-31Paper
MORPHING OF TRIANGULAR MESHES IN SHAPE SPACE2013-06-06Paper
https://portal.mardi4nfdi.de/entity/Q49107212013-03-19Paper
String-Wrapped Rotating Disks2013-01-07Paper
π/2-ANGLE YAO GRAPHS ARE SPANNERS2012-11-23Paper
The Continuous Hexachordal Theorem2012-09-20Paper
Continuous blooming of convex polyhedra2012-01-24Paper
https://portal.mardi4nfdi.de/entity/Q30036432011-05-30Paper
Realistic Reconfiguration of Crystalline (and Telecube) Robots2011-03-02Paper
https://portal.mardi4nfdi.de/entity/Q30779702011-02-18Paper
π/2-Angle Yao Graphs Are Spanners2010-12-09Paper
Connecting polygonizations via stretches and twangs2010-10-06Paper
Star unfolding convex polyhedra via quasigeodesic loops2010-06-21Paper
Discrete and Computational Geometry2010-02-05Paper
Highway hull revisited2009-11-16Paper
Algorithms and Computation2009-08-07Paper
Linear reconfiguration of cube-style modular robots2009-07-27Paper
https://portal.mardi4nfdi.de/entity/Q36199412009-04-14Paper
https://portal.mardi4nfdi.de/entity/Q35230332008-09-01Paper
https://portal.mardi4nfdi.de/entity/Q35145232008-07-21Paper
https://portal.mardi4nfdi.de/entity/Q35145272008-07-21Paper
Linear Reconfiguration of Cube-Style Modular Robots2008-05-27Paper
COMPUTATIONAL GEOMETRY COLUMN 482008-05-14Paper
Unfolding Manhattan towers2008-04-28Paper
Grid vertex-unfolding orthogonal polyhedra2008-04-16Paper
Grid Vertex-Unfolding Orthogonal Polyhedra2008-03-19Paper
https://portal.mardi4nfdi.de/entity/Q54274782007-11-20Paper
Edge-unfolding nested polyhedral bands2007-10-19Paper
On corners of objects built from parallelepiped bricks2007-10-19Paper
Epsilon-unfolding orthogonal polyhedra2007-07-19Paper
COMPUTATIONAL GEOMETRY COLUMN 472006-09-04Paper
Geometric restrictions on producible polygonal protein chains2006-06-14Paper
https://portal.mardi4nfdi.de/entity/Q52902602006-04-28Paper
COMPUTATIONAL GEOMETRY COLUMN 462005-12-09Paper
COMPUTATIONAL GEOMETRY COLUMN 452005-02-28Paper
COMPUTATIONAL GEOMETRY COLUMN 432004-09-29Paper
Computational Geometry Column 442004-09-29Paper
The structure of optimal partitions of orthogonal polygons into fat rectangles2004-08-06Paper
https://portal.mardi4nfdi.de/entity/Q44647182004-05-27Paper
https://portal.mardi4nfdi.de/entity/Q44278582003-09-14Paper
Interlocked open and closed linkages with few joints.2003-07-01Paper
On the development of the intersection of a plane with a polytope2003-04-28Paper
https://portal.mardi4nfdi.de/entity/Q45478172002-08-21Paper
A note on reconfiguring tree linkages: Trees can lock2002-05-15Paper
Enumerating foldings and unfoldings between polygons and polytopes2002-05-14Paper
Polygonal chains cannot lock in 4D2002-01-14Paper
https://portal.mardi4nfdi.de/entity/Q27288512001-11-01Paper
COMPUTATIONAL GEOMETRY COLUMN 402001-04-17Paper
Computational Geometry Column 332000-11-07Paper
Computational Geometry Column 342000-11-07Paper
https://portal.mardi4nfdi.de/entity/Q42253062000-04-27Paper
https://portal.mardi4nfdi.de/entity/Q38381792000-04-25Paper
Computational Geometry in C1999-01-19Paper
The vertex-edge visibility graph of a polygon1998-10-01Paper
https://portal.mardi4nfdi.de/entity/Q44010331998-09-30Paper
Star Unfolding of a Polytope with Applications1998-02-10Paper
Computational Geometry Column 321997-10-30Paper
Computational Geometry Column 311997-09-10Paper
COMPUTATIONAL GEOMETRY COLUMN 291997-05-28Paper
Illumination of polygons with vertex lights1997-02-27Paper
https://portal.mardi4nfdi.de/entity/Q44010151997-01-01Paper
ON RECONSTRUCTING POLYHEDRA FROM PARALLEL SLICES1996-08-13Paper
COMPUTATIONAL GEOMETRY COLUMN 271996-08-13Paper
COMPUTATIONAL GEOMETRY COLUMN 261996-05-30Paper
COMPUTATIONAL GEOMETRY COLUMN 251996-02-26Paper
COMPUTATIONAL GEOMETRY COLUMN 241995-04-03Paper
COMPUTATIONAL GEOMETRY COLUMN 231994-11-27Paper
Two segment classes with Hamiltonian visibility graphs1994-09-25Paper
COMPUTATIONAL GEOMETRY COLUMN 221994-07-13Paper
https://portal.mardi4nfdi.de/entity/Q42957761994-06-14Paper
COMPUTATIONAL GEOMETRY COLUMN 181993-08-22Paper
https://portal.mardi4nfdi.de/entity/Q40288801993-03-28Paper
https://portal.mardi4nfdi.de/entity/Q40288841993-03-28Paper
Nonoverlap of the star unfolding1993-01-16Paper
COMPUTATIONAL GEOMETRY COLUMN 151993-01-16Paper
COMPUTATIONAL GEOMETRY COLUMN 131992-06-28Paper
COMPUTATIONAL GEOMETRY COLUMN 121992-06-27Paper
https://portal.mardi4nfdi.de/entity/Q39732801992-06-26Paper
COMPUTATIONAL GEOMETRY COLUMN 111991-01-01Paper
On the development of closed convex curves on 3-polytopes1989-01-01Paper
Finding minimal convex nested polygons1989-01-01Paper
Lower bounds on moving a ladder in two and three dimensions1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37967581988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38131851988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37992611987-01-01Paper
Connect-the-dots: A new heuristic1987-01-01Paper
Computing circular separability1986-01-01Paper
Constructing Arrangements of Lines and Hyperplanes with Applications1986-01-01Paper
An optimal algorithm for finding minimal enclosing triangles1986-01-01Paper
The Signature of a Plane Curve1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36852181985-01-01Paper
Finding minimal enclosing boxes1985-01-01Paper
An alternative proof of the rectilinear art gallery theorem1983-01-01Paper
Galleries need fewer mobile guards: A variation on Chvatal's theorem1983-01-01Paper
Some NP-hard polygon decomposition problems1983-01-01Paper
Computing the relative neighborhood graph in the \(L_ 1\) and L//infinity metrics1982-01-01Paper
Polygon decomposition and switching function minimization1982-01-01Paper
A new linear algorithm for intersecting convex polygons1982-01-01Paper
An on-line algorithm for fitting straight lines between data ranges1981-01-01Paper
Skeletal Cut Loci on Convex PolyhedraN/APaper
Super Guarding and Dark Rays in Art GalleriesN/APaper

Research outcomes over time

This page was built for person: Joseph O'Rourke