Geometric Folding Algorithms: Linkages, Origami, Polyhedra is a monograph on the mathematics and computational geometry of mechanical linkages, paper folding, and polyhedral nets, by Erik Demaine and Joseph O'Rourke. It was published in 2007 by Cambridge University Press (ISBN 978-0-521-85757-4).[1][2][3][4]
A Japanese-language translation by Ryuhei Uehara was published in 2009 by the Modern Science Company (ISBN 978-4-7649-0377-7).[5]
^Cite error: The named reference maa was invoked but never defined (see the help page).
^Cite error: The named reference ejor was invoked but never defined (see the help page).
^Cite error: The named reference ems was invoked but never defined (see the help page).
^Cite error: The named reference acm was invoked but never defined (see the help page).
^Cite error: The named reference trans was invoked but never defined (see the help page).
and 24 Related for: Geometric Folding Algorithms information
GeometricFoldingAlgorithms: Linkages, Origami, Polyhedra is a monograph on the mathematics and computational geometry of mechanical linkages, paper folding...
origami foldability problems. In 1893, Indian civil servant T. Sundara Row published Geometric Exercises in Paper Folding which used paper folding to demonstrate...
thesis was later incorporated into his book GeometricFoldingAlgorithms on the mathematics of paper folding published with Joseph O'Rourke in 2007. Demaine...
algorithms (also known as force-directed algorithms or spring-based algorithm) Spectral layout Network analysis Link analysis Girvan–Newman algorithm:...
The napkin folding problem is a problem in geometry and the mathematics of paper folding that explores whether folding a square or a rectangular napkin...
Geometric Exercises in Paper Folding is a book on the mathematics of paper folding. It was written by Indian mathematician T. Sundara Row, first published...
from ori meaning "folding", and kami meaning "paper" (kami changes to gami due to rendaku)) is the Japanese art of paper folding. In modern usage, the...
antiparallelogram linkage. Demaine, Erik; O'Rourke, Joseph (2007), GeometricFoldingAlgorithms, Cambridge University Press, pp. 32–33, doi:10.1017/CBO9780511735172...
History of Folding in Mathematics: Mathematizing the Margins is a book in the history of mathematics on the mathematics of paper folding. It was written...
MR 2341323, S2CID 32897155. Demaine, Erik; O'Rourke, Joseph (2007), GeometricFoldingAlgorithms, Cambridge University Press, p. 424, ISBN 978-0-521-71522-5....
that such constructions are in effect algorithms, making Islamic geometric patterns forerunners of modern algorithmic art. The circle symbolizes unity and...
O'Rourke, Joseph (2007), "3.2 Kempe's Universality Theorem", GeometricFoldingAlgorithms, Cambridge University Press, pp. 31–40, ISBN 978-0-521-71522-5...
keys into fixed length (usually machine word length or less) values, by folding them by words or other units using a parity-preserving operator like ADD...
time t. So exponentially complex algorithms are most often impractical, and the search for more efficient algorithms is one of the central goals of computer...
Demaine, Erik; O'Rourke, Joseph (2007). "24.1.1 Source unfolding". GeometricFoldingAlgorithms. Cambridge University Press. pp. 359–362. ISBN 978-0-521-71522-5...
Demaine, Erik; O'Rourke, Joseph (2007), "24.3 Star unfolding", GeometricFoldingAlgorithms, Cambridge University Press, pp. 366–372, ISBN 978-0-521-71522-5...
separator itself) is small. When a geometric separator exists, it can be used for building divide-and-conquer algorithms for solving various problems in...
the AlphaFold database. AlphaFold's database of predictions achieved state of the art records on benchmark tests for protein foldingalgorithms, although...
Global Information