Hinged dissection of polygons is hard

Robert Aubrey Hearn, Erik D. Demaine, and Greg N. Frederickson
Proc. 15th Canad. Conf. Computational Geometry (CCCG 2003), Dalhousie Univ., Faculty of Computer Science, Aug 2003, pp. 98–102
http://torch.cs.dal.ca/~cccg/papers/45.pdf

Cites:

Fano Experimental Web Server, D. Eppstein, School of Information & Computer Science, UC Irvine
Made on a Mac Valid XHTML 1.0!