|
|
|
|
| LEADER |
01318 am a22002053u 4500 |
| 001 |
121356 |
| 042 |
|
|
|a dc
|
| 100 |
1 |
0 |
|a Butler, Steven Kay
|e author
|
| 100 |
1 |
0 |
|a Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
|e contributor
|
| 700 |
1 |
0 |
|a Demaine, Erik D
|e author
|
| 700 |
1 |
0 |
|a Graham, Ron
|e author
|
| 700 |
1 |
0 |
|a Tachi, Tomohiro
|e author
|
| 245 |
0 |
0 |
|a CONSTRUCTING POINTS THROUGH FOLDING AND INTERSECTION
|
| 260 |
|
|
|b World Scientific Pub Co Pte Lt,
|c 2019-06-19T14:43:28Z.
|
| 856 |
|
|
|z Get fulltext
|u https://hdl.handle.net/1721.1/121356
|
| 520 |
|
|
|a 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.
|
| 546 |
|
|
|a en
|
| 655 |
7 |
|
|a Article
|
| 773 |
|
|
|t 10.1142/S0218195913500039
|
| 773 |
|
|
|t International Journal of Computational Geometry & Applications
|
