Papers
Topics
Authors
Recent
Search
2000 character limit reached

Computational Geometry Column 44

Published 18 Apr 2003 in cs.CG | (0304025v1)

Abstract: The open problem of whether or not every pair of equal-area polygons has a hinged dissection is discussed.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.