Timeline for 2D Spatial partitioning alternatives to spatial hashes and quadtrees
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 16, 2020 at 10:15 | history | edited | CommunityBot |
Commonmark migration
|
|
| Jul 12, 2012 at 23:11 | history | edited | deft_code | CC BY-SA 3.0 |
grammar fixes
|
| Jul 24, 2011 at 13:59 | comment | added | Vittorio Romeo | Looks... complex! I will take a look at it, though. Someone suggested me using the "sweep and prune" or "sort and sweep" technique but I couldn't find anything about a C# or .NET implementation. I found a c++ example but it's confusing and it didn't work (I tried to implement it anyway). Do you think SAP would be easier to implement? Is there are .NET implementation? | |
| Jul 24, 2011 at 4:02 | history | answered | deft_code | CC BY-SA 3.0 |