When can you fold a map?
DOI10.1016/j.comgeo.2004.03.012zbMath1063.68099OpenAlexW2118063590MaRDI QIDQ1883580
Esther M. Arkin, Steven S. Skiena, Joseph S. B. Mitchell, Erik D. Demaine, Michael A. Bender, Martin L. Demaine, Saurabh Sethia
Publication date: 13 October 2004
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2004.03.012
Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Geometric constructions in real or complex geometry (51M15) Recreational mathematics (00A08)
Related Items (13)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Folding flat silhouettes and wrapping polyhedral packages: New results in computational origami
- An algorithmic study of manufacturing paperclips and other folded structures.
- Fast Algorithms for Finding Nearest Common Ancestors
- Efficient randomized pattern-matching algorithms
- On Finding Lowest Common Ancestors: Simplification and Parallelization
- Folding and coloring problems in mathematics and physics
- Folding a strip of stamps
- A Map-Folding Problem
- Multi-dimensional map-folding
- Contribution a L'etude Du Probleme Des Timbres Poste
This page was built for publication: When can you fold a map?