Suppose you have some polygon with cornerpoints { p1, p2, ..., pk } and you want to print a regular polygon with n edges along one of its edges (p(j), p(j+1) then you can simply find the first point of the regular n-gon by rotating p(j+1) with centre p(j) over 360/n degrees. You can continue this process until you have found all points or you can calculate the centre of the regular polygon, its orientation and edge-length which you need to print a regular n-gon. Here are some examples.
Examples
 |
| 3-on-4, 4-on-3 and and 5,7,9,11-on 4 (dark-on-light ). |
No comments:
Post a Comment