Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: An example of geometric origami design with benefit of graph enumeration
  algorithms   This article is concerned with an example of complex planar geometry arising
from flat origami challenges. The complexity of solution algorithms is
illustrated, depending on the depth of the initial analysis of the problem,
starting from brute force enumeration, up to the equivalence to a dedicated
problem in graph theory. This leads to algorithms starting from an untractable
case on modern computers, up to a run of few seconds on a portable personal
computer. This emphasizes the need for a prior analysis by humans before
considering the assistance of computers for complex design problems. The graph
problem is an enumeration of spanning trees from a grid graph, leading to a
coarse scale description of the topology of the paper edge on the flat-folded
state.

35
The categories of this paper are: mtrl-th
34
The categories of this paper are: chem-ph
32
The categories of this paper are: atom-ph
27
The categories of this paper are: comp-gas
24
The categories of this paper are: dg-ga
3
The categories of this paper are: physics
17
The categories of this paper are: q-fin
12
The categories of this paper are: nucl-th
28
The categories of this paper are: alg-geom
5
The categories of this paper are: gr-qc
7
The categories of this paper are: hep-th
36
The categories of this paper are: cmp-lg
10
The categories of this paper are: q-bio
0
The categories of this paper are: hep-ph
4
The categories of this paper are: cond-mat
19
The categories of this paper are: eess