Paper by Erik D. Demaine

Reference:

Erik D. Demaine and Joseph O'Rourke, “Computational Geometry Column 37”, International Journal of Computational Geometry and Applications, volume 10, number 1, February 2000, pages 103–107. Also appears in SIGACT News, volume 30, number 3, issue #112, September 1999, pages 39–42.

Abstract:

Open problems from the 15th Annual ACM Symposium on Computational Geometry.

Comments:

This paper is also available as arXiv:cs.CG/9908007 of the Computing Research Repository (CoRR).

Updates:

I understand that Kasturi Varadarajan's problem (is there a topological cube with orthogonal opposite facets?) has been solved by Günter Ziegler.

John Conway's Holyhedron Problem has been solved by Jade Vinson in “On Holyhedra” (with an introduction by John Conway), Discrete and Computational Geometry, volume 24, number 1, pages 85-104, 2000. There is still work to be done in order to win the $10,000 / (number of faces) reward, because Vinson's polyhedron has 78,585,627 faces and genus 60,380,421! Don Hatch reports some further progress: a 492-face holyhedron.

John Conway's Angel and Devil Problem has been solved, even for power-2 angel, by András Máthé and Oddvar Kloster. See this blog post. There are other solutions, for higher-power angels, by Brian Bowditch and Peter Gács.

Length:

The paper is 4 pages.

Availability:

The paper is available in PostScript (112k).

See information on file formats.

[Google Scholar search]