MIT Libraries logoDSpace@MIT

MIT
View Item 
  • DSpace@MIT Home
  • MIT Open Access Articles
  • MIT Open Access Articles
  • View Item
  • DSpace@MIT Home
  • MIT Open Access Articles
  • MIT Open Access Articles
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

CONSTRUCTING POINTS THROUGH FOLDING AND INTERSECTION

Author(s)
Butler, Steven Kay; Demaine, Erik D; Graham, Ron; Tachi, Tomohiro
Thumbnail
DownloadAccepted version (255.9Kb)
Terms of use
Creative Commons Attribution-Noncommercial-Share Alike http://creativecommons.org/licenses/by-nc-sa/4.0/
Metadata
Show full item record
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.
Date issued
2013
URI
https://hdl.handle.net/1721.1/121356
Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
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
ISSN
0218-1959

Collections
  • MIT Open Access Articles

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

Login

Statistics

OA StatisticsStatistics by CountryStatistics by Department
MIT Libraries
PrivacyPermissionsAccessibilityContact us
MIT
Content created by the MIT Libraries, CC BY-NC unless otherwise noted. Notify us about copyright concerns.