On approximating any regular polygon by folding paper strips
There exists a Euclidean construction of a regular N-gon for very few values of N, and even for these N, we do not know in all cases the explicit constructions.This thesis is an exposition of a better alternative to the Euclidean construction of the regular N-gon. It shows how to construct an approx...
Saved in:
Main Authors: | , |
---|---|
Format: | text |
Language: | English |
Published: |
Animo Repository
1993
|
Subjects: | |
Online Access: | https://animorepository.dlsu.edu.ph/etd_bachelors/16097 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | De La Salle University |
Language: | English |
id |
oai:animorepository.dlsu.edu.ph:etd_bachelors-16610 |
---|---|
record_format |
eprints |
spelling |
oai:animorepository.dlsu.edu.ph:etd_bachelors-166102022-01-27T03:29:30Z On approximating any regular polygon by folding paper strips Lazo, Fernando A. Santos, Rex F. There exists a Euclidean construction of a regular N-gon for very few values of N, and even for these N, we do not know in all cases the explicit constructions.This thesis is an exposition of a better alternative to the Euclidean construction of the regular N-gon. It shows how to construct an approximation, to any desired degree of accuracy, a regular N-gon for any value of N. Explicity and uncomplicated constructions involving only the folding of a straight strip of paper are described and the corresponding mathematical theory is discussed. In the process, an interesting interplay of geometry, analysis and number theory is illustrated. 1993-01-01T08:00:00Z text https://animorepository.dlsu.edu.ph/etd_bachelors/16097 Bachelor's Theses English Animo Repository Approximation theory Polygons Geometry--Problems, exercises, etc. Algorithms Euclid's Elements |
institution |
De La Salle University |
building |
De La Salle University Library |
continent |
Asia |
country |
Philippines Philippines |
content_provider |
De La Salle University Library |
collection |
DLSU Institutional Repository |
language |
English |
topic |
Approximation theory Polygons Geometry--Problems, exercises, etc. Algorithms Euclid's Elements |
spellingShingle |
Approximation theory Polygons Geometry--Problems, exercises, etc. Algorithms Euclid's Elements Lazo, Fernando A. Santos, Rex F. On approximating any regular polygon by folding paper strips |
description |
There exists a Euclidean construction of a regular N-gon for very few values of N, and even for these N, we do not know in all cases the explicit constructions.This thesis is an exposition of a better alternative to the Euclidean construction of the regular N-gon. It shows how to construct an approximation, to any desired degree of accuracy, a regular N-gon for any value of N. Explicity and uncomplicated constructions involving only the folding of a straight strip of paper are described and the corresponding mathematical theory is discussed. In the process, an interesting interplay of geometry, analysis and number theory is illustrated. |
format |
text |
author |
Lazo, Fernando A. Santos, Rex F. |
author_facet |
Lazo, Fernando A. Santos, Rex F. |
author_sort |
Lazo, Fernando A. |
title |
On approximating any regular polygon by folding paper strips |
title_short |
On approximating any regular polygon by folding paper strips |
title_full |
On approximating any regular polygon by folding paper strips |
title_fullStr |
On approximating any regular polygon by folding paper strips |
title_full_unstemmed |
On approximating any regular polygon by folding paper strips |
title_sort |
on approximating any regular polygon by folding paper strips |
publisher |
Animo Repository |
publishDate |
1993 |
url |
https://animorepository.dlsu.edu.ph/etd_bachelors/16097 |
_version_ |
1772834941755719680 |