Timeline for Is there a simple criterion to determine if two parallelograms intersect?
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 7, 2015 at 19:51 | history | edited | Ricardo Andrade | CC BY-SA 3.0 |
replaced tags with more appropriate ones; minor edit of text
|
| Sep 11, 2013 at 21:13 | history | edited | user9072 |
edited tags
|
|
| Sep 16, 2010 at 12:23 | answer | added | Pierre Dehornoy | timeline score: 15 | |
| Sep 16, 2010 at 10:26 | answer | added | Joseph O'Rourke | timeline score: 2 | |
| Sep 16, 2010 at 9:56 | comment | added | HenrikRüping | I would use a sweep line algorithm, if a hasd to program such a program. This should have the advantage, that it works in general for any polygon. en.wikipedia.org/wiki/Sweep_line_algorithm | |
| Sep 16, 2010 at 9:42 | answer | added | Vagabond | timeline score: 1 | |
| Sep 16, 2010 at 9:19 | history | asked | Philipp | CC BY-SA 2.5 |