Erik D. Demaine and Joseph O'Rouke, Review of Geometric Folding Algorithms: Linkages, Origami, Polyhedra , Cambridge University Press (2007).
Luís PaquetePublished in: Eur. J. Oper. Res. (2009)
Keyphrases
- orders of magnitude
- computationally efficient
- learning algorithm
- times faster
- theoretical analysis
- computational cost
- significant improvement
- computational complexity
- benchmark datasets
- classification algorithm
- computational efficiency
- geometric information
- special case
- data structure
- computationally expensive
- real time
- graph theory