A place for developers to talk about building on Farcaster.

/dev

I have been working a lot on 2D vector manipulation for an onchain game that I am cooking.

An interesting challenge was to constrict a curve as an alternative to standard smoothing functions. And the best approach I found was to simply lower the apex of a triangle of neighbouring nodes.

The Golang code I got calculates the updated mid point in 50 nanoseconds per triplet. Check the graph editor if you are interested in visualizing these types of polygons.

https://www.desmos.com/calculator/bg2iwrsgpx

This is the alt account of Sister Hazel. Writings at https://powerlaw.systems. Curating https://protocol-particles.github.io.

Correction, the calculation happens within 2 nanoseconds. I noticed I had the race flag enabled in the benchmarks, which adds a lot of compiler instrumentations.