Add to ORKGThe recent result that n congruent balls in Rd have at most 4 distinct geometric permutations is des...
The main topic of my research is my discovery of a new series of uniform polyhedra, which I have nam...
The skeleton of a spherical polyhedron may also be viewed as the skeleton of other panelled structur...
The open problem of whether or not every pair of equal-area polygons has a hinged dissection is disc...
We prove that any finite collection of polygons of equal area has a common hinged dissection. That...
AbstractA hinged dissection of a set of polygons S is a collection of polygonal pieces hinged togeth...
Two long-open problems have been solved: (1) every sufficiently large planar point set in general po...
We prove that two polygons A and B have a reversible hinged dissection (a chain hinged dissection th...
Problems presented at the open-problem session of the 14th Annual ACM Symposium on Computational Geo...
A compendium of thirty previously published open problems in computational geometry is presented
We prove that two polygons A and B have a reversible hinged dissection (a chain hinged dissection th...
Abstract We prove that two polygons A and B have a reversible hinged dissection (a ch...
A geometric dissection is a cutting of one or more geometric gures into pieces that we can rearrange...
The resolution of a decades-old open problem is described: polygonal chains cannot lock in the plane
We describe a polynomial time algorithm that takes as input a polygon with axis-parallel sides but i...
The recent result that n congruent balls in Rd have at most 4 distinct geometric permutations is des...
The main topic of my research is my discovery of a new series of uniform polyhedra, which I have nam...
The skeleton of a spherical polyhedron may also be viewed as the skeleton of other panelled structur...
The open problem of whether or not every pair of equal-area polygons has a hinged dissection is disc...
We prove that any finite collection of polygons of equal area has a common hinged dissection. That...
AbstractA hinged dissection of a set of polygons S is a collection of polygonal pieces hinged togeth...
Two long-open problems have been solved: (1) every sufficiently large planar point set in general po...
We prove that two polygons A and B have a reversible hinged dissection (a chain hinged dissection th...
Problems presented at the open-problem session of the 14th Annual ACM Symposium on Computational Geo...
A compendium of thirty previously published open problems in computational geometry is presented
We prove that two polygons A and B have a reversible hinged dissection (a chain hinged dissection th...
Abstract We prove that two polygons A and B have a reversible hinged dissection (a ch...
A geometric dissection is a cutting of one or more geometric gures into pieces that we can rearrange...
The resolution of a decades-old open problem is described: polygonal chains cannot lock in the plane
We describe a polynomial time algorithm that takes as input a polygon with axis-parallel sides but i...
The recent result that n congruent balls in Rd have at most 4 distinct geometric permutations is des...
The main topic of my research is my discovery of a new series of uniform polyhedra, which I have nam...
The skeleton of a spherical polyhedron may also be viewed as the skeleton of other panelled structur...