Timeline for Linear transformation takes a polygon to another one.
Current License: CC BY-SA 2.5
6 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Dec 30, 2012 at 13:25 | answer | added | woodbass | timeline score: 0 | |
Jul 25, 2010 at 18:36 | vote | accept | AAK | ||
Jul 25, 2010 at 18:31 | answer | added | Andrey Rekalo | timeline score: 5 | |
Jul 25, 2010 at 18:14 | comment | added | Will Jagy | That extends easily to a deterministic test for existence, at least under the assumption that three consecutive vertices cannot be collinear. Fix three consecutive vertices $abc$ in $P,$ and for each vertex $v$ in $Q$ take a triple of consecutive vertices $uvw$ centered at $v.$ If the maps taking $abc$ to $uvw$ and $wvu$ both fail to extend to a map taking all of $P$ to all of $Q,$ then you can discard $v.$ If you check all $v$ and get failure that's it. | |
Jul 25, 2010 at 17:59 | comment | added | gowers | If you label the vertices, then an obvious necessary condition is that if you pick any three vertices and take the unique linear map that takes those to their correspondingly labelled vertices, then that map has to take all the other vertices to their corresponding vertices. | |
Jul 25, 2010 at 17:54 | history | asked | AAK | CC BY-SA 2.5 |