CONSTRUCTING POINTS THROUGH FOLDING AND INTERSECTION
Name
13_08_folding.pdf
Description
Accepted version
Size
255.94 KB
Format
Adobe PDF
Checksum (MD5)
0bc51ec996cb24511bbcbe7424598582
Author(s)
Butler, Steven Kay
Demaine, Erik D
Graham, Ron
Tachi, Tomohiro
Date Issued
2013
Journal
International Journal of Computational Geometry & Applications
Publisher
World Scientific Pub Co Pte Lt
Citation
Butler, Steve, Erik Demaine, Ron Graham and Tomohiro Tachi. "Constructing points through folding and intersection." International Journal of Computational Geometry & Applications, Vol. 23 (01) 2016: 49-64.
Version
Author's final manuscript
Abstract
Fix an n ≥ 3. Consider the following two operations: given a line with a specified point on the line we can construct a new line through the point which forms an angle with the new line which is a multiple of π/n (folding); and given two lines we can construct the point where they cross (intersection). Starting with the line y = 0 and the points (0,0) and (1,0) we determine which points in the plane can be constructed using only these two operations for n = 3,4,5,6,8,10,12,24 and also consider the problem of the minimum number of steps it takes to construct such a point.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1142/S0218195913500039
