Timeline for Shamos-Hoey algorithm for checking the self-intersection of a closed shape
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 10, 2020 at 13:24 | history | edited | CommunityBot |
Commonmark migration
|
|
| Sep 22, 2013 at 16:30 | comment | added | flup | Heavens! It can do with a bit more comment, at the very least. | |
| Sep 22, 2013 at 16:22 | comment | added | Rogach |
I updated the code. The compareLines() method is now an abomination, weighting in at 50 lines - but on the bright side, I think I handled all possible corner cases in it. Maybe you know how to simplify it?
|
|
| Sep 22, 2013 at 16:17 | comment | added | Rogach | For example, did you know that Line2D.equals() only takes into account reference equality? I did not, and it took me almost an hour to debug the issue :( | |
| Sep 22, 2013 at 15:42 | comment | added | Rogach | Yes, I most definitely will get problems with vertical lines. I'm rewriting that method again, right now. It turns out that defining that above-below relation properly is no easy task ;) | |
| Sep 22, 2013 at 11:34 | comment | added | flup | First question after quick look: Won't you get nullpointer exceptions for zero values of rx and ry? | |
| Sep 17, 2013 at 15:53 | history | edited | flup | CC BY-SA 3.0 |
added 40 characters in body
|
| Sep 17, 2013 at 15:00 | history | edited | flup | CC BY-SA 3.0 |
added 406 characters in body
|
| Sep 17, 2013 at 14:50 | history | answered | flup | CC BY-SA 3.0 |