Searching for authors named "Barry Hayes" – sorted by Relevance.
-
The Complexity of Flat Origami (Extended Abstract)
- We study a basic problem in mathematical origami: determine if a given crease pattern can be folded to a flat origami. We show that assigning mountain and valley folds is NP-complete. We also show that determining a suitable overlap order for flaps is NP-complete, even assuming a valid mountain and
- Add To MetaCart
-
A Disk-Packing Algorithm for an Origami Magic Trick
- We present an algorithm for a magic trick. Given a polygon with holes P , our algorithm determines a folding of a rectangular sheet of paper such that a single straight cut suffices to cut out P . Keywords: Computational Geometry, Paperfolding, Polygon. 1 Introduction The great Harry Houdini wa
- Cited by 11 (7 self) – Add To MetaCart
-
Communications of the ACM, 26(6):419--429, June 1983.
- ent of prepaging policies. Journal of Systems and Software, 1992. Technical Communication, to appear. [28] Jean-Loup Baer and Gary R. Sager. Dynamic improvement of locality in virtual memory systems. IEEE Transactions on Software Engineering, SE-2(1):54--62, March 1976. [29] Vincent Cate and Thoma
- Add To MetaCart

