Fumiaki Kawahata, "The technique to fold free angles of formative art 'origami'," abstract in proceedings of The Second International Meeting on Origami Science and Scientific Origami, Otsu, Japan, 1994.

Google Scholar

[13]

Toshikazu Kawasaki, "On the relation between mountaincreases and valley-creases of a fiat origami," in Origami Science and Technology, H. Huzita, ed., 1989, p. 229-237.

Google Scholar

[14]

Robert J. Lang, "Mathematical algorithms for origami design," Symmetry: Culture and Science, vol. 5, no. 2, pp. 115-152, 1994.

Google Scholar

[15]

Tom Hull, "On the mathematics of flat origamis," Congressus Numerantium 100, (1994), pp. 215-224.

Google Scholar

[16]

D.A. Huffman, Curvatures and creases: a primer on paper, IEEE Trans. on Computers, Volume C-25, (1976), pp. 1010-1019.

Google Scholar

[17]

Marshall Bern and Barry Hayes, "On the Complexity of Flat Origami," ACM Symposium on Discrete Algorithms, 1996.

Digital Library

Google Scholar

[18]

G.N. Vanderplaats, Numerical Optimization Techniques for Engineering Design, McGraw-Hill, 1984

Google Scholar

[19]

William H. Press, Brian P. Flannery, Saul A. Teukolsky, and William T. Vetterling, Numerical Recipes in C, 2nd Ed., Cambridge, 1994.

Google Scholar

[20]

The program TreeMaker runs on Macintosh computers and is available with documentation via anonymous ftp at rugcis.rug, nl in directory origami/programs.

Google Scholar

[21]

Martin Gardner, "Tangent Circles," Fractal Music and Hypercards, W. H. Freeman, 1992, pp. 149-166, and references therein.

Google Scholar

Cited By

View all

Iiyoshi KLee JDalaq AKhazaaleh SDaqaq MKorres GEid M(2024)Origami-Inspired Haptics: A Literature ReviewIEEE Access10.1109/ACCESS.2024.337148012(33309-33327)Online publication date: 2024
https://doi.org/10.1109/ACCESS.2024.3371480
Shi YLiu LLou XLu YZhang PLiu E(2024)OriBot: a novel origami robot creation system to support children’s STEAM learningMultimedia Tools and Applications10.1007/s11042-024-20438-xOnline publication date: 16-Nov-2024
https://doi.org/10.1007/s11042-024-20438-x
Micheletti ATiero ATomassetti G(2024)Simulation and design of isostatic thick origami structuresMeccanica10.1007/s11012-024-01815-059:9(1403-1423)Online publication date: 17-Jun-2024
https://doi.org/10.1007/s11012-024-01815-0
Show More Cited By

Index Terms

A computational algorithm for origami design

Recommendations

Logical and algebraic view of Huzita's origami axioms with applications to computational origami
SAC '07: Proceedings of the 2007 ACM symposium on Applied computing

We describe Huzita's origami axioms from the logical and algebraic points of view. Observing that Huzita's axioms are statements about the existence of certain origami constructions, we can generate basic origami constructions from those axioms. Origami ...
Legalization algorithm for multiple-row height standard cell design
DAC '16: Proceedings of the 53rd Annual Design Automation Conference

Typical standard cell placement algorithms assume that all cells are of the same height such that cells can be aligned along the placement rows. However, modern standard cell designs are getting more complicated and multiple-row height cell becomes more ...
A routing algorithm for flip-chip design
ICCAD '05: Proceedings of the 2005 IEEE/ACM International conference on Computer-aided design

The flip-chip package gives the highest chip density of any packaging method to support the pad-limited Application-Specific Integrated Circuit (ASIC) designs. In this paper, we propose the first router for the flip-chip package in the literature. The ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

SCG '96: Proceedings of the twelfth annual symposium on Computational geometry

May 1996

406 pages

ISBN:0897918045

DOI:10.1145/237218

Chairman:
Sue Whitesides
McGill Univ.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 May 1996

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

SoCG96

Sponsor:

SoCG96: 12th ACM Symposium on Computational Geometry

May 24 - 26, 1996

Pennsylvania, Philadelphia, USA

Acceptance Rates

SCG '96 Paper Acceptance Rate 48 of 93 submissions, 52%;

Overall Acceptance Rate 625 of 1,685 submissions, 37%

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

122
Total Citations
View Citations
4,286
Total Downloads

Downloads (Last 12 months)1,071
Downloads (Last 6 weeks)152

Reflects downloads up to 21 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Iiyoshi KLee JDalaq AKhazaaleh SDaqaq MKorres GEid M(2024)Origami-Inspired Haptics: A Literature ReviewIEEE Access10.1109/ACCESS.2024.337148012(33309-33327)Online publication date: 2024
https://doi.org/10.1109/ACCESS.2024.3371480
Shi YLiu LLou XLu YZhang PLiu E(2024)OriBot: a novel origami robot creation system to support children’s STEAM learningMultimedia Tools and Applications10.1007/s11042-024-20438-xOnline publication date: 16-Nov-2024
https://doi.org/10.1007/s11042-024-20438-x
Micheletti ATiero ATomassetti G(2024)Simulation and design of isostatic thick origami structuresMeccanica10.1007/s11012-024-01815-059:9(1403-1423)Online publication date: 17-Jun-2024
https://doi.org/10.1007/s11012-024-01815-0
Zhang MZhao Y(2024)Modeling methods of cylindrical and axisymmetric waterbomb origami based on multi-objective optimizationMultimedia Systems10.1007/s00530-024-01326-830:3Online publication date: 25-Apr-2024
https://doi.org/10.1007/s00530-024-01326-8
Maity ADutt MBiswas A(2024)Finding the Straight Skeleton for 3D Orthogonal Polyhedrons: A Combinatorial ApproachArtificial Intelligence and Image Analysis10.1007/978-3-031-63735-3_12(206-217)Online publication date: 23-Jul-2024
https://doi.org/10.1007/978-3-031-63735-3_12
Phetmak NFakcharoenphol J(2023)Folding Every Point on a Polygon Boundary to a PointAlgorithms10.3390/a1606028116:6(281)Online publication date: 31-May-2023
https://doi.org/10.3390/a16060281
Chen WYang WPeach LKoditschek DSung C(2023)Kinegami: Algorithmic Design of Compliant Kinematic Chains From Tubular OrigamiIEEE Transactions on Robotics10.1109/TRO.2022.320671139:2(1260-1280)Online publication date: Apr-2023
https://doi.org/10.1109/TRO.2022.3206711
Yamamoto YMitani J(2023)Continuous deformation of flat-foldable crease patterns via interpretation as set of twist-patternsJournal of Computational Design and Engineering10.1093/jcde/qwad03610:3(979-991)Online publication date: 25-Apr-2023
https://doi.org/10.1093/jcde/qwad036
Geary C(2023)Origami LifeVisions of DNA Nanotechnology at 40 for the Next 4010.1007/978-981-19-9891-1_12(207-227)Online publication date: 5-Jul-2023
https://doi.org/10.1007/978-981-19-9891-1_12
Graciolli CRocha Junior RDa Silva R(2022)Aspectos do pensamento computacional em atividades desplugadas com origami e matemáticaDialogia10.5585/40.2022.21513(1-20)Online publication date: 17-Mar-2022
https://doi.org/10.5585/40.2022.21513
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Logical and algebraic view of Huzita's origami axioms with applications to computational origami

Legalization algorithm for multiple-row height standard cell design

A routing algorithm for flip-chip design