Publication | Date of Publication | Type |
---|
Reshaping Convex Polyhedra | 2024-02-10 | Paper |
Cut locus realizations on convex polyhedra | 2023-07-31 | Paper |
Toward unfolding doubly covered \(n\)-stars | 2023-03-31 | Paper |
https://portal.mardi4nfdi.de/entity/Q5881857 | 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 | 2022-12-09 | Paper |
https://portal.mardi4nfdi.de/entity/Q5104352 | 2022-09-09 | Paper |
Simple Closed Quasigeodesics on Tetrahedra | 2022-03-09 | Paper |
Pop-Up Geometry | 2022-02-03 | Paper |
Every Tetrahedron has a 3-vertex Quasigeodesic | 2021-09-15 | Paper |
Edge-Unfolding Nearly Flat Convex Caps | 2020-08-18 | Paper |
Tailoring for Every Body: Reshaping Convex Polyhedra | 2020-08-04 | Paper |
Interlocked open linkages with few joints | 2018-11-23 | Paper |
Vertex-unfoldings of simplicial manifolds | 2018-11-23 | Paper |
Book Review | 2018-08-20 | Paper |
New and Improved Spanning Ratios for Yao Graphs | 2018-04-23 | Paper |
Continuously Flattening Polyhedra Using Straight Skeletons | 2018-04-23 | Paper |
Unfolding genus-2 orthogonal polyhedra with linear refinement | 2017-12-12 | Paper |
New and improved spanning ratios for Yao graphs | 2017-03-30 | Paper |
https://portal.mardi4nfdi.de/entity/Q5177769 | 2015-03-05 | Paper |
On coloring box graphs | 2014-11-20 | Paper |
Development of curves on polyhedra via conical existence | 2014-01-22 | Paper |
Draining a polygon-or-rolling a ball out of a polygon | 2014-01-22 | Paper |
Reprint of: Refold rigidity of convex polyhedra | 2014-01-22 | Paper |
Refold rigidity of convex polyhedra | 2013-07-31 | Paper |
MORPHING OF TRIANGULAR MESHES IN SHAPE SPACE | 2013-06-06 | Paper |
https://portal.mardi4nfdi.de/entity/Q4910721 | 2013-03-19 | Paper |
String-Wrapped Rotating Disks | 2013-01-07 | Paper |
π/2-ANGLE YAO GRAPHS ARE SPANNERS | 2012-11-23 | Paper |
The Continuous Hexachordal Theorem | 2012-09-20 | Paper |
Continuous blooming of convex polyhedra | 2012-01-24 | Paper |
https://portal.mardi4nfdi.de/entity/Q3003643 | 2011-05-30 | Paper |
Realistic Reconfiguration of Crystalline (and Telecube) Robots | 2011-03-02 | Paper |
https://portal.mardi4nfdi.de/entity/Q3077970 | 2011-02-18 | Paper |
π/2-Angle Yao Graphs Are Spanners | 2010-12-09 | Paper |
Connecting polygonizations via stretches and twangs | 2010-10-06 | Paper |
Star unfolding convex polyhedra via quasigeodesic loops | 2010-06-21 | Paper |
Discrete and Computational Geometry | 2010-02-05 | Paper |
Highway hull revisited | 2009-11-16 | Paper |
Algorithms and Computation | 2009-08-07 | Paper |
Linear reconfiguration of cube-style modular robots | 2009-07-27 | Paper |
https://portal.mardi4nfdi.de/entity/Q3619941 | 2009-04-14 | Paper |
https://portal.mardi4nfdi.de/entity/Q3523033 | 2008-09-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3514523 | 2008-07-21 | Paper |
https://portal.mardi4nfdi.de/entity/Q3514527 | 2008-07-21 | Paper |
Linear Reconfiguration of Cube-Style Modular Robots | 2008-05-27 | Paper |
COMPUTATIONAL GEOMETRY COLUMN 48 | 2008-05-14 | Paper |
Unfolding Manhattan towers | 2008-04-28 | Paper |
Grid vertex-unfolding orthogonal polyhedra | 2008-04-16 | Paper |
Grid Vertex-Unfolding Orthogonal Polyhedra | 2008-03-19 | Paper |
https://portal.mardi4nfdi.de/entity/Q5427478 | 2007-11-20 | Paper |
Edge-unfolding nested polyhedral bands | 2007-10-19 | Paper |
On corners of objects built from parallelepiped bricks | 2007-10-19 | Paper |
Epsilon-unfolding orthogonal polyhedra | 2007-07-19 | Paper |
COMPUTATIONAL GEOMETRY COLUMN 47 | 2006-09-04 | Paper |
Geometric restrictions on producible polygonal protein chains | 2006-06-14 | Paper |
https://portal.mardi4nfdi.de/entity/Q5290260 | 2006-04-28 | Paper |
COMPUTATIONAL GEOMETRY COLUMN 46 | 2005-12-09 | Paper |
COMPUTATIONAL GEOMETRY COLUMN 45 | 2005-02-28 | Paper |
COMPUTATIONAL GEOMETRY COLUMN 43 | 2004-09-29 | Paper |
Computational Geometry Column 44 | 2004-09-29 | Paper |
The structure of optimal partitions of orthogonal polygons into fat rectangles | 2004-08-06 | Paper |
https://portal.mardi4nfdi.de/entity/Q4464718 | 2004-05-27 | Paper |
https://portal.mardi4nfdi.de/entity/Q4427858 | 2003-09-14 | Paper |
Interlocked open and closed linkages with few joints. | 2003-07-01 | Paper |
On the development of the intersection of a plane with a polytope | 2003-04-28 | Paper |
https://portal.mardi4nfdi.de/entity/Q4547817 | 2002-08-21 | Paper |
A note on reconfiguring tree linkages: Trees can lock | 2002-05-15 | Paper |
Enumerating foldings and unfoldings between polygons and polytopes | 2002-05-14 | Paper |
Polygonal chains cannot lock in 4D | 2002-01-14 | Paper |
https://portal.mardi4nfdi.de/entity/Q2728851 | 2001-11-01 | Paper |
COMPUTATIONAL GEOMETRY COLUMN 40 | 2001-04-17 | Paper |
Computational Geometry Column 33 | 2000-11-07 | Paper |
Computational Geometry Column 34 | 2000-11-07 | Paper |
https://portal.mardi4nfdi.de/entity/Q4225306 | 2000-04-27 | Paper |
https://portal.mardi4nfdi.de/entity/Q3838179 | 2000-04-25 | Paper |
Computational Geometry in C | 1999-01-19 | Paper |
The vertex-edge visibility graph of a polygon | 1998-10-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q4401033 | 1998-09-30 | Paper |
Star Unfolding of a Polytope with Applications | 1998-02-10 | Paper |
Computational Geometry Column 32 | 1997-10-30 | Paper |
Computational Geometry Column 31 | 1997-09-10 | Paper |
COMPUTATIONAL GEOMETRY COLUMN 29 | 1997-05-28 | Paper |
Illumination of polygons with vertex lights | 1997-02-27 | Paper |
https://portal.mardi4nfdi.de/entity/Q4401015 | 1997-01-01 | Paper |
ON RECONSTRUCTING POLYHEDRA FROM PARALLEL SLICES | 1996-08-13 | Paper |
COMPUTATIONAL GEOMETRY COLUMN 27 | 1996-08-13 | Paper |
COMPUTATIONAL GEOMETRY COLUMN 26 | 1996-05-30 | Paper |
COMPUTATIONAL GEOMETRY COLUMN 25 | 1996-02-26 | Paper |
COMPUTATIONAL GEOMETRY COLUMN 24 | 1995-04-03 | Paper |
COMPUTATIONAL GEOMETRY COLUMN 23 | 1994-11-27 | Paper |
Two segment classes with Hamiltonian visibility graphs | 1994-09-25 | Paper |
COMPUTATIONAL GEOMETRY COLUMN 22 | 1994-07-13 | Paper |
https://portal.mardi4nfdi.de/entity/Q4295776 | 1994-06-14 | Paper |
COMPUTATIONAL GEOMETRY COLUMN 18 | 1993-08-22 | Paper |
https://portal.mardi4nfdi.de/entity/Q4028880 | 1993-03-28 | Paper |
https://portal.mardi4nfdi.de/entity/Q4028884 | 1993-03-28 | Paper |
Nonoverlap of the star unfolding | 1993-01-16 | Paper |
COMPUTATIONAL GEOMETRY COLUMN 15 | 1993-01-16 | Paper |
COMPUTATIONAL GEOMETRY COLUMN 13 | 1992-06-28 | Paper |
COMPUTATIONAL GEOMETRY COLUMN 12 | 1992-06-27 | Paper |
https://portal.mardi4nfdi.de/entity/Q3973280 | 1992-06-26 | Paper |
COMPUTATIONAL GEOMETRY COLUMN 11 | 1991-01-01 | Paper |
On the development of closed convex curves on 3-polytopes | 1989-01-01 | Paper |
Finding minimal convex nested polygons | 1989-01-01 | Paper |
Lower bounds on moving a ladder in two and three dimensions | 1988-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3796758 | 1988-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3813185 | 1988-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3799261 | 1987-01-01 | Paper |
Connect-the-dots: A new heuristic | 1987-01-01 | Paper |
Computing circular separability | 1986-01-01 | Paper |
Constructing Arrangements of Lines and Hyperplanes with Applications | 1986-01-01 | Paper |
An optimal algorithm for finding minimal enclosing triangles | 1986-01-01 | Paper |
The Signature of a Plane Curve | 1986-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3685218 | 1985-01-01 | Paper |
Finding minimal enclosing boxes | 1985-01-01 | Paper |
An alternative proof of the rectilinear art gallery theorem | 1983-01-01 | Paper |
Galleries need fewer mobile guards: A variation on Chvatal's theorem | 1983-01-01 | Paper |
Some NP-hard polygon decomposition problems | 1983-01-01 | Paper |
Computing the relative neighborhood graph in the \(L_ 1\) and L//infinity metrics | 1982-01-01 | Paper |
Polygon decomposition and switching function minimization | 1982-01-01 | Paper |
A new linear algorithm for intersecting convex polygons | 1982-01-01 | Paper |
An on-line algorithm for fitting straight lines between data ranges | 1981-01-01 | Paper |