"We're shipping so much more code with AI!"
"Good, stable code?"
"Oh heavens no. No no no. not at all. We couldn't possibly"
I'm feeling a little brain foggy today, but I'm also so energized that I GOTTA GET CODING! I'll be continuing work on inserting into a dynamic geometry tree 🌳🖥️😺 www.twitch.tv/tawnycodecat
I made a lot of progress, and mostly finished implementing code for inserting into the tree structure for things like raytracing or finding closest points 💜
We raided @thattransknight.bsky.social , who was modelling, texturing, and rigging a femme Link outfit for her 3D vtuber model! 😻
I cleaned up the code from last stream, and I'd gone a bit overkill on findAny, so it was perfect as the basis for findBest and findAll. I wrote those yesterday, so next coding stream, it'll be onto the dreaded insert and remove functions. They'll probably take multiple streams.
findAll is useful for things like finding all transparent polygons hit by a ray, in order, until one is opaque, or finding all of the points within some distance of a query point. Yay, geometry! 💜
I'm PUMPED to get coding! I'm going to try to tackle the function to insert something into this dynamic tree I've been working on 🖥️😺 www.twitch.tv/tawnycodecat
Tawny Code Cat 🖥️😺
Tawny Code Cat 🖥️😺
findBest is useful for things like finding the first polygon hit by a ray if you have a tree of polygons, or finding the closest point to some query point if you have a tree of points.
I got started much later than I'd hoped, so I only got started writing the insert function, though I got the overall idea down. I'm eager for the day when I can render my own art using this code 💜
We raided @glottal.bsky.social who was valiantly battling to get GLTF files imported into Godot ⚔️
