Timeline for Is there a simple criterion to determine if two parallelograms intersect?
Current License: CC BY-SA 2.5
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 17, 2010 at 15:08 | comment | added | Philipp | no, this is not possible, unfortunately. | |
| Sep 16, 2010 at 16:44 | history | edited | Pierre Dehornoy | CC BY-SA 2.5 |
added 12 characters in body; deleted 11 characters in body
|
| Sep 16, 2010 at 13:04 | comment | added | sleepless in beantown | Impressive observation. Isn't this more computationally intensive than Joseph's approach here? Or is it possible to translate polygon $A$ by the vertices of $B$ one at a time, and check to see if the origin is contained within the translated polygon $A_{Bi}$ ? (where $B_i$ stands for each of the vertices of polygon $B$) | |
| Sep 16, 2010 at 12:46 | comment | added | Joseph O'Rourke | Very clever! $\mbox{}$ | |
| Sep 16, 2010 at 12:23 | history | answered | Pierre Dehornoy | CC BY-SA 2.5 |