Timeline for Efficient Algorithm for the boundary of a set of tiles
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 17, 2019 at 20:09 | comment | added | BugSquasher | I have fully updated my answer and deleted the extranneous answer below. | |
| Sep 17, 2019 at 19:54 | history | edited | BugSquasher | CC BY-SA 4.0 |
Completed post
|
| May 23, 2019 at 16:08 | comment | added | BugSquasher | It's basically the same but if you only subtract them once it's more efficient | |
| May 23, 2019 at 12:16 | comment | added | ScienceSnake | That's essentially what the algorithm in the OP does, although checking the neighbor tiles before inclusion is slightly faster than removing them all at the end. | |
| May 23, 2019 at 1:27 | history | answered | BugSquasher | CC BY-SA 4.0 |