Post #3324381
2026-06-11 02:37 UTC
Here's the same meshing algorithm, but with 8 random vertices in the middle instead of just one. Clearly I've got a ways to go yet on this one.
Replies (1)
-
@aeva@mastodon.gamedev.place 2026-06-11 02:43
I doubt this one is going to dazzle siggraph but the gist of it is if you draw a bunch of dots on paper and then sweep a ruler across the page such that it is perpendicular to the axis of movement, and mark runs of vertices it crosses that either all ascend or all descend along the y axis (so if the first three are ascending, and the 4th would be descending that's the end of the run, the 4th starts a new one) you will produce an ordered set of short chains of non-intersecting line segments