Timeline for How to detect two moving shapes overlapped?
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 27, 2012 at 7:55 | comment | added | Steven Evers | Of interest: going up one dimension and you then have Binary Spacial Partitioning Trees (BSP Tree). | |
| Oct 27, 2012 at 5:13 | comment | added | c69 |
best ? depends on your requirements. good enough ? - probably yes. Check: stackoverflow.com/a/88924/946789 You can try Sweep and Prune, from this link, but that's far beyond my expertise in 2D geometry - so from that point you'll be on your own ;)
|
|
| Oct 27, 2012 at 5:04 | comment | added | peter | This is exactly what i am looking for, but i am wondering is Quadtree the best approach ? | |
| Oct 27, 2012 at 4:57 | history | answered | c69 | CC BY-SA 3.0 |