CCCG 2003, Halifax, Nova Scotia, August 11–13, 2003 Hinged Dissection of Polygons is Hard Robert A. Hearn∗ Erik D. Demaine†

First Page		Document Content
Date: 2004-01-08 18:44:35 Recreational mathematics Polyform Rectangle Area Polyomino Polygon Triangle Geometry Euclidean geometry Euclidean plane geometry		CCCG 2003, Halifax, Nova Scotia, August 11–13, 2003 Hinged Dissection of Polygons is Hard Robert A. Hearn∗ Erik D. Demaine† Add to Reading List Source URL: www.cccg.ca Download Document from Source Website File Size: 144,21 KB Share Document on Facebook

	Introduction What is constructive geometry? IEGC (Intuitionistic Euclidean Constructive Geometry) Connections to Field Theory Field theory and the parallel postulate Independence results DocID: 1tdMr - View Document
	Herbrand’s theorem and non-Euclidean geometry Michael Beeson, Pierre Boutry, Julien Narboux To cite this version: Michael Beeson, Pierre Boutry, Julien Narboux. Herbrand’s theorem and non-Euclidean geometry. Bulletin DocID: 1t313 - View Document
	The hamburger theorem Mikio Kano and Jan Kynˇcl EPFL Problem: Given n red and n blue points in the plane in general position, draw n DocID: 1rrZJ - View Document
	Singularities of the asymptotic completion of developable M¨obius strips Kosuke Naokawa Email: Let U be an open domain in Euclidean two-space R2 and f : U −→ R3 a C ∞ map. A point p ∈ U DocID: 1rq0Q - View Document
	Simplot_FinalLogo_FullColor DocID: 1rprR - View Document