Closed lordhoengy closed 7 years ago
Instead of connecting the points a different approach could be implementing an "Voronoi-diagram"-algorithm with the dots as a seed.
The plus of this approach would be one would not have to figure out what/where/... the shapes are, because every "not Hull"-point (so basically every point in the middle of the grid) would automatically represent a cell.
seems to be a duplicate of #164. if so please close and comment/upvote there
Hey!
My challenge would be coding a Minesweeper clone but to make it a little more challenging you could combine it with your Poisson-disc sampling from coding challenge #130 (Or #33 for the youtube video) and make something like a "random shaped grid"-Minesweeper.