Computational geometry column 44

  title={Computational geometry column 44},
  author={Joseph O'Rourke},
  journal={SIGACT News},
  • J. O'Rourke
  • Published 18 April 2003
  • Mathematics
  • SIGACT News
The open problem of whether or not every pair of equal-area polygons has a hinged dissection is discussed. 
1 Citations

Figures from this paper


In handbook of discrete and computational geometry
Handbook of discrete and computational geometry, 2d.ed, Handbook of differential geometry. QA 372 P725 2003, Handbook of geometric topology. Jacob E. Goodman, co-founder and editor of Discrete &
Hinged dissections : swinging & twisting
Preface 1. If it ain't got that swing 2. Hinging on the details 3. Tricks for turning 4. Making squares dance 5. L'affaire triangulaire 6. Return to polygonia 7. Who's the squarest of them all? 8.
Computational Geometry Applications of Well Separted Pairs Decomposition
We define a well-separated pair decomposition of P to be a structure consisting of a binary tree T associated with P , and a well separated realization of P ⊗ P such that all Ai and Bi in the
A Computing Research Repository
Quadrilateral Meshing by Circle Packing
We use circle-packing methods to generate quadrilateral meshes for polygonal domains, with guaranteed bounds both on the quality and the number of elements. We show that these methods can generate
Hinged dissection of polyominoes and polyforms To appear, arXiv:cs.CG/9907018
  • Proc. 11th Canad. Conf
  • 1999
Journal of Recreational Mathematics
  • 31(3):204–207,
  • 2003
Demaine and Martin L . Demaine . Hinged dissection of the alphabet
  • Journal of Recreational Mathematics
  • 2003
Goodman and Joseph O’Rourke
  • editors, Handbook of Discrete and Computational Geometry, chapter 12, pages 225–242. CRC Press LLC, Boca Raton, FL,
  • 1997