| Publication | Date of Publication | Type |
|---|
Every combinatorial polyhedron can unfold with overlap
CGT. Computing in Geometry and Topology | 2025-10-21 | Paper |
| The mathematics of origami | 2025-10-20 | Paper |
Book review of: T. Hull, Origametry. Mathematical methods in paper folding
The Mathematical Intelligencer | 2025-08-28 | Paper |
| Discrete and computational geometry | 2025-02-10 | Paper |
| Rolling polyhedra on tessellations | 2024-05-16 | Paper |
Reshaping Convex Polyhedra
(available as arXiv preprint) | 2024-02-10 | Paper |
Cut locus realizations on convex polyhedra
Computational Geometry | 2023-07-31 | Paper |
| Toward unfolding doubly covered n-stars | 2023-03-31 | Paper |
| scientific article; zbMATH DE number 7662628 (Why is no real title available?) | 2023-03-13 | Paper |
| Polar Zonohedra Edge-Unfold to Nets | 2023-02-15 | Paper |
| Every Combinatorial Polyhedron Can Unfold with Overlap | 2022-12-30 | Paper |
Star unfolding of a polytope with applications
SWAT 90 | 2022-12-09 | Paper |
Some polycubes have no edge zipper unfolding
(available as arXiv preprint) | 2022-09-09 | Paper |
| Simple Closed Quasigeodesics on Tetrahedra | 2022-03-09 | Paper |
| Pop-up geometry. The mathematics behind pop-up cards | 2022-02-03 | Paper |
| Every Tetrahedron has a 3-vertex Quasigeodesic | 2021-09-15 | Paper |
Edge-unfolding nearly flat convex caps
(available as arXiv preprint) | 2020-08-18 | Paper |
| Tailoring for Every Body: Reshaping Convex Polyhedra | 2020-08-04 | Paper |
Vertex-unfoldings of simplicial manifolds
Proceedings of the eighteenth annual symposium on Computational geometry | 2018-11-23 | Paper |
Interlocked open linkages with few joints
Proceedings of the eighteenth annual symposium on Computational geometry | 2018-11-23 | Paper |
Book Review
The College Mathematics Journal | 2018-08-20 | Paper |
Continuously flattening polyhedra using straight skeletons
Proceedings of the thirtieth annual symposium on Computational geometry | 2018-04-23 | Paper |
New and improved spanning ratios for Yao graphs
Proceedings of the thirtieth annual symposium on Computational geometry | 2018-04-23 | Paper |
Unfolding genus-2 orthogonal polyhedra with linear refinement
Graphs and Combinatorics | 2017-12-12 | Paper |
| New and improved spanning ratios for Yao graphs | 2017-03-30 | Paper |
A 2-chain can interlock with an open 10-chain
(available as arXiv preprint) | 2015-03-05 | Paper |
On coloring box graphs
Discrete Mathematics | 2014-11-20 | Paper |
Development of curves on polyhedra via conical existence
Computational Geometry | 2014-01-22 | Paper |
Draining a polygon-or-rolling a ball out of a polygon
Computational Geometry | 2014-01-22 | Paper |
Reprint of: Refold rigidity of convex polyhedra
Computational Geometry | 2014-01-22 | Paper |
Refold rigidity of convex polyhedra
Computational Geometry | 2013-07-31 | Paper |
Morphing of triangular meshes in shape space
International Journal of Shape Modeling | 2013-06-06 | Paper |
| Connecting polygonizations via stretches and twangs | 2013-03-19 | Paper |
String-wrapped rotating disks
Lecture Notes in Computer Science | 2013-01-07 | Paper |
\(\pi /2\)-angle Xao graphs are spanners
International Journal of Computational Geometry & Applications | 2012-11-23 | Paper |
The Continuous Hexachordal Theorem
Communications in Computer and Information Science | 2012-09-20 | Paper |
Continuous blooming of convex polyhedra
Graphs and Combinatorics | 2012-01-24 | Paper |
| Discrete and computational geometry | 2011-05-30 | Paper |
Realistic reconfiguration of crystalline (and telecube) robots
Springer Tracts in Advanced Robotics | 2011-03-02 | Paper |
| How to fold it. The mathematics of linkages, origami and polyhedra | 2011-02-18 | Paper |
π/2-Angle Yao Graphs Are Spanners
Algorithms and Computation | 2010-12-09 | Paper |
Connecting polygonizations via stretches and twangs
Theory of Computing Systems | 2010-10-06 | Paper |
Star unfolding convex polyhedra via quasigeodesic loops
Discrete & Computational Geometry | 2010-06-21 | Paper |
The foldings of a square to convex polyhedra
Lecture Notes in Computer Science | 2010-02-05 | Paper |
Highway hull revisited
Computational Geometry | 2009-11-16 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2009-08-07 | Paper |
Linear reconfiguration of cube-style modular robots
Computational Geometry | 2009-07-27 | Paper |
| scientific article; zbMATH DE number 5542495 (Why is no real title available?) | 2009-04-14 | Paper |
| scientific article; zbMATH DE number 5318635 (Why is no real title available?) | 2008-09-01 | Paper |
| All polygon flip finitely\dots right? | 2008-07-21 | Paper |
| Unfolding orthogonal polyhedra | 2008-07-21 | Paper |
Linear Reconfiguration of Cube-Style Modular Robots
Algorithms and Computation | 2008-05-27 | Paper |
COMPUTATIONAL GEOMETRY COLUMN 48
International Journal of Computational Geometry & Applications | 2008-05-14 | Paper |
Unfolding Manhattan towers
Computational Geometry | 2008-04-28 | Paper |
Grid vertex-unfolding orthogonal polyhedra
Discrete & Computational Geometry | 2008-04-16 | Paper |
Grid Vertex-Unfolding Orthogonal Polyhedra
STACS 2006 | 2008-03-19 | Paper |
| Geometric folding algorithms. Linkages, origami, polyhedra | 2007-11-20 | Paper |
Edge-unfolding nested polyhedral bands
Computational Geometry | 2007-10-19 | Paper |
On corners of objects built from parallelepiped bricks
Computational Geometry | 2007-10-19 | Paper |
Epsilon-unfolding orthogonal polyhedra
Graphs and Combinatorics | 2007-07-19 | Paper |
COMPUTATIONAL GEOMETRY COLUMN 47
International Journal of Computational Geometry & Applications | 2006-09-04 | Paper |
Geometric restrictions on producible polygonal protein chains
Algorithmica | 2006-06-14 | Paper |
| A survey of folding and unfolding in computational geometry | 2006-04-28 | Paper |
COMPUTATIONAL GEOMETRY COLUMN 46
International Journal of Computational Geometry & Applications | 2005-12-09 | Paper |
COMPUTATIONAL GEOMETRY COLUMN 45
International Journal of Computational Geometry & Applications | 2005-02-28 | Paper |
COMPUTATIONAL GEOMETRY COLUMN 43
International Journal of Computational Geometry & Applications | 2004-09-29 | Paper |
Computational Geometry Column 44
International Journal of Computational Geometry & Applications | 2004-09-29 | Paper |
The structure of optimal partitions of orthogonal polygons into fat rectangles
Computational Geometry | 2004-08-06 | Paper |
| scientific article; zbMATH DE number 2068107 (Why is no real title available?) | 2004-05-27 | Paper |
| scientific article; zbMATH DE number 1979514 (Why is no real title available?) | 2003-09-14 | Paper |
Interlocked open and closed linkages with few joints.
Computational Geometry | 2003-07-01 | Paper |
On the development of the intersection of a plane with a polytope
Computational Geometry | 2003-04-28 | Paper |
| scientific article; zbMATH DE number 1786522 (Why is no real title available?) | 2002-08-21 | Paper |
Locked and unlocked polygonal chains in three dimensions
Discrete & Computational Geometry | 2002-07-22 | Paper |
A note on reconfiguring tree linkages: Trees can lock
Discrete Applied Mathematics | 2002-05-15 | Paper |
Enumerating foldings and unfoldings between polygons and polytopes
Graphs and Combinatorics | 2002-05-14 | Paper |
Polygonal chains cannot lock in 4D
Computational Geometry | 2002-01-14 | Paper |
| scientific article; zbMATH DE number 1629824 (Why is no real title available?) | 2001-11-01 | Paper |
Computational geometry column 40
International Journal of Computational Geometry & Applications | 2001-04-17 | Paper |
Computational Geometry Column 33
International Journal of Computational Geometry & Applications | 2000-11-07 | Paper |
Computational Geometry Column 34
International Journal of Computational Geometry & Applications | 2000-11-07 | Paper |
| scientific article; zbMATH DE number 1241843 (Why is no real title available?) | 2000-04-27 | Paper |
| scientific article; zbMATH DE number 1185290 (Why is no real title available?) | 2000-04-25 | Paper |
| Computational Geometry in C | 1999-01-19 | Paper |
The vertex-edge visibility graph of a polygon
Computational Geometry | 1998-10-01 | Paper |
| scientific article; zbMATH DE number 1182936 (Why is no real title available?) | 1998-09-30 | Paper |
Star Unfolding of a Polytope with Applications
SIAM Journal on Computing | 1998-02-10 | Paper |
Computational Geometry Column 32
International Journal of Computational Geometry & Applications | 1997-10-30 | Paper |
Computational Geometry Column 31
International Journal of Computational Geometry & Applications | 1997-09-10 | Paper |
COMPUTATIONAL GEOMETRY COLUMN 29
International Journal of Computational Geometry & Applications | 1997-05-28 | Paper |
Illumination of polygons with vertex lights
Information Processing Letters | 1997-02-27 | Paper |
| scientific article; zbMATH DE number 1182918 (Why is no real title available?) | 1997-01-01 | Paper |
ON RECONSTRUCTING POLYHEDRA FROM PARALLEL SLICES
International Journal of Computational Geometry & Applications | 1996-08-13 | Paper |
COMPUTATIONAL GEOMETRY COLUMN 27
International Journal of Computational Geometry & Applications | 1996-08-13 | Paper |
COMPUTATIONAL GEOMETRY COLUMN 26
International Journal of Computational Geometry & Applications | 1996-05-30 | Paper |
COMPUTATIONAL GEOMETRY COLUMN 25
International Journal of Computational Geometry & Applications | 1996-02-26 | Paper |
COMPUTATIONAL GEOMETRY COLUMN 24
International Journal of Computational Geometry & Applications | 1995-04-03 | Paper |
COMPUTATIONAL GEOMETRY COLUMN 23
International Journal of Computational Geometry & Applications | 1994-11-27 | Paper |
Two segment classes with Hamiltonian visibility graphs
Computational Geometry | 1994-09-25 | Paper |
COMPUTATIONAL GEOMETRY COLUMN 22
International Journal of Computational Geometry & Applications | 1994-07-13 | Paper |
| scientific article; zbMATH DE number 589497 (Why is no real title available?) | 1994-06-14 | Paper |
COMPUTATIONAL GEOMETRY COLUMN 18
International Journal of Computational Geometry & Applications | 1993-08-22 | Paper |
| scientific article; zbMATH DE number 140464 (Why is no real title available?) | 1993-03-28 | Paper |
| scientific article; zbMATH DE number 140467 (Why is no real title available?) | 1993-03-28 | Paper |
Nonoverlap of the star unfolding
Discrete & Computational Geometry | 1993-01-16 | Paper |
COMPUTATIONAL GEOMETRY COLUMN 15
International Journal of Computational Geometry & Applications | 1993-01-16 | Paper |
COMPUTATIONAL GEOMETRY COLUMN 13
International Journal of Computational Geometry & Applications | 1992-06-28 | Paper |
COMPUTATIONAL GEOMETRY COLUMN 12
International Journal of Computational Geometry & Applications | 1992-06-27 | Paper |
| scientific article; zbMATH DE number 16593 (Why is no real title available?) | 1992-06-26 | Paper |
COMPUTATIONAL GEOMETRY COLUMN 11
International Journal of Computational Geometry & Applications | 1991-01-01 | Paper |
On the development of closed convex curves on 3-polytopes
Journal of Geometry | 1989-01-01 | Paper |
Finding minimal convex nested polygons
Information and Computation | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4062601 (Why is no real title available?) | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4082817 (Why is no real title available?) | 1988-01-01 | Paper |
Lower bounds on moving a ladder in two and three dimensions
Discrete & Computational Geometry | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4065813 (Why is no real title available?) | 1987-01-01 | Paper |
Connect-the-dots: A new heuristic
Computer Vision, Graphics, and Image Processing | 1987-01-01 | Paper |
Constructing Arrangements of Lines and Hyperplanes with Applications
SIAM Journal on Computing | 1986-01-01 | Paper |
Computing circular separability
Discrete & Computational Geometry | 1986-01-01 | Paper |
An optimal algorithm for finding minimal enclosing triangles
Journal of Algorithms | 1986-01-01 | Paper |
The Signature of a Plane Curve
SIAM Journal on Computing | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3907791 (Why is no real title available?) | 1985-01-01 | Paper |
Finding minimal enclosing boxes
International Journal of Computer & Information Sciences | 1985-01-01 | Paper |
An alternative proof of the rectilinear art gallery theorem
Journal of Geometry | 1983-01-01 | Paper |
Some NP-hard polygon decomposition problems
IEEE Transactions on Information Theory | 1983-01-01 | Paper |
Galleries need fewer mobile guards: A variation on Chvatal's theorem
Geometriae Dedicata | 1983-01-01 | Paper |
A new linear algorithm for intersecting convex polygons
Computer Graphics and Image Processing | 1982-01-01 | Paper |
Computing the relative neighborhood graph in the \(L_ 1\) and L//infinity metrics
Pattern Recognition | 1982-01-01 | Paper |
Polygon decomposition and switching function minimization
Computer Graphics and Image Processing | 1982-01-01 | Paper |
An on-line algorithm for fitting straight lines between data ranges
Communications of the ACM | 1981-01-01 | Paper |
Skeletal Cut Loci on Convex Polyhedra
(available as arXiv preprint) | N/A | Paper |
Super Guarding and Dark Rays in Art Galleries
(available as arXiv preprint) | N/A | Paper |
