Skip to search formSkip to main contentSkip to account menu

Map folding

Known as: Stamp folding 
In combinatorial mathematics the map folding problem is the question of how many ways there are to fold a rectangular map along its creases… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2013
Review
2013
Foldings and meanders
We review the stamp folding problem, the number of ways to fold a strip of $n$ stamps, and the related problem of enumerating… 
2012
2012
Map Folding by Tom Morgan
The idea of the ray diagram was introduced by David Charlton, and further elaborated by Yoyo Zhou, in the context of an open… 
2011
2011
Complexity of the stamp folding problem
2009
2009
Edge Tessellation and Stamp Foldings Puzzles
An edge tessellation is a tiling of the plane generated by reflecting a polygon in its edges. We prove that a polygon generating… 
2008
2008
Techniques for dual forms of Reed-Muller expansion conversion
2008
2008
Meanders and Stamp Foldings : Fast Generation Algorithms
By considering a permutation representation for meanders, semi-meanders, and stamp foldings we construct a new data structure… 
2006
2006
Algorithm in Map Folding Problem
  • N. Ye
  • 2006
  • Corpus ID: 123391882
This paper offers a solution to the problem in searching. This approach analyzes and processes the character string directly and… 
Review
2006
Review
2006
Algorithms in computer-aided design of VLSI circuits
With the increased complexity of Very Large Scale Integrated (VLSI) circuits, Computer Aided Design (CAD) plays an even more… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)