(hilbert-curve 0 0 800 0 0 800 5)
[#]clojure
=> More informations about this toot | More toots from jack@berlin.social
@jack I haven't forgotten this 🙂
Where's this algorithm from? Closest I could find to it was https://dl.acm.org/doi/10.1145/290200.290219
@neauoire @qualmist
=> View attached media | View attached media | View attached media
=> More informations about this toot | More toots from akkartik@merveilles.town
@akkartik @neauoire @qualmist From? I improvised it while live coding 🤷🏻♂️
=> More informations about this toot | More toots from jack@berlin.social
@jack 🤯 I need to think about why this algorithm is the same as the L-system based version in Wikipedia.
(Who needs eso-langs, computing is plenty esoteric to begin with.)
=> More informations about this toot | More toots from akkartik@merveilles.town
(hilbert-curve 0 0 800 0 0 800 5)
@jack It's interesting that I get back jank if I replace the (... n 0 0 n ...) pattern with other possibilities.
Does the hilbert curve logo thing you made with curved lines start out from this version?
@qualmist
=> More informations about this toot | More toots from akkartik@merveilles.town
@jack Visualizing leaf calls. x, y in red, xi/yi/xj/yj in green.
@qualmist
=> More informations about this toot | More toots from akkartik@merveilles.town
@jack I better handle when the debug information collides.
@qualmist
=> More informations about this toot | More toots from akkartik@merveilles.town
@jack Even better, show which direction the base vs control points are used in.
@qualmist
=> More informations about this toot | More toots from akkartik@merveilles.town This content has been proxied by September (3851b).Proxy Information
text/gemini