The following pages link to Joseph O'Rourke (Q223096):
Displayed 50 items.
- Development of curves on polyhedra via conical existence (Q390109) (← links)
- Draining a polygon-or-rolling a ball out of a polygon (Q390145) (← links)
- Reprint of: Refold rigidity of convex polyhedra (Q390173) (← links)
- On coloring box graphs (Q472968) (← links)
- A differentiable sphere theorem with positive Ricci curvature and reverse volume pinching (Q547373) (← links)
- The structure of optimal partitions of orthogonal polygons into fat rectangles (Q598555) (← links)
- On the almost sure spiraling of geodesics in negatively curved manifolds (Q616681) (← links)
- Continuous blooming of convex polyhedra (Q659710) (← links)
- An alternative proof of the rectilinear art gallery theorem (Q795339) (← links)
- Linear reconfiguration of cube-style modular robots (Q924084) (← links)
- Star unfolding convex polyhedra via quasigeodesic loops (Q977183) (← links)
- Highway hull revisited (Q1037778) (← links)
- Galleries need fewer mobile guards: A variation on Chvatal's theorem (Q1052325) (← links)
- Computing circular separability (Q1079817) (← links)
- Lower bounds on moving a ladder in two and three dimensions (Q1104091) (← links)
- On the development of closed convex curves on 3-polytopes (Q1124118) (← links)
- Computing the relative neighborhood graph in the \(L_ 1\) and L//infinity metrics (Q1165014) (← links)
- Nonoverlap of the star unfolding (Q1199127) (← links)
- Two segment classes with Hamiltonian visibility graphs (Q1334612) (← links)
- A note on reconfiguring tree linkages: Trees can lock (Q1348403) (← links)
- Enumerating foldings and unfoldings between polygons and polytopes (Q1348668) (← links)
- Illumination of polygons with vertex lights (Q1350220) (← links)
- The vertex-edge visibility graph of a polygon (Q1388137) (← links)
- Interlocked open and closed linkages with few joints. (Q1395574) (← links)
- Unfolding genus-2 orthogonal polyhedra with linear refinement (Q1684951) (← links)
- Finding minimal convex nested polygons (Q1822960) (← links)
- On the development of the intersection of a plane with a polytope (Q1869734) (← links)
- Connecting polygonizations via stretches and twangs (Q1959392) (← links)
- Epsilon-unfolding orthogonal polyhedra (Q2373431) (← links)
- Refold rigidity of convex polyhedra (Q2391544) (← links)
- Edge-unfolding nested polyhedral bands (Q2456664) (← links)
- On corners of objects built from parallelepiped bricks (Q2456665) (← links)
- Grid vertex-unfolding orthogonal polyhedra (Q2482205) (← links)
- Unfolding Manhattan towers (Q2483556) (← links)
- Geometric restrictions on producible polygonal protein chains (Q2492634) (← links)
- Toward unfolding doubly covered \(n\)-stars (Q2695478) (← links)
- COMPUTATIONAL GEOMETRY COLUMN 40 (Q2708044) (← links)
- (Q2728851) (← links)
- The Continuous Hexachordal Theorem (Q2914436) (← links)
- New and improved spanning ratios for Yao graphs (Q2970433) (← links)
- (Q3003643) (← links)
- π/2-Angle Yao Graphs Are Spanners (Q3060796) (← links)
- (Q3077970) (← links)
- Realistic Reconfiguration of Crystalline (and Telecube) Robots (Q3079494) (← links)
- COMPUTATIONAL GEOMETRY COLUMN 29 (Q3126159) (← links)
- COMPUTATIONAL GEOMETRY COLUMN 11 (Q3212331) (← links)
- Polygon decomposition and switching function minimization (Q3313275) (← links)
- A new linear algorithm for intersecting convex polygons (Q3316124) (← links)
- (Q3514523) (← links)
- (Q3514527) (← links)