#animatio
ey thank you, I'm very proud of this animatio-, Heyy-- >:(

🐍
November 16, 2026 at 7:22 AM
More stuff on livestream check picarto

#animatio #art #OC
November 11, 2026 at 12:50 AM
THE ENM CONTINUED! MORE NAKIE BOIS FOR ALL! 😳 Plus, a big chunk of #BunHunting3 anim is done! 💪💞

🔴 Kroko's Nakie Delivery Service Uncensored 🔞 Comic Released!
🔴 Animators @mawarisaka.bsky.social & @tartwaa.bsky.social have wrapped up their #BunHunting3 anim!
🔴 Special Illust: Kroko's Aftermatch!
November 11, 2026 at 1:02 PM
👁️ P i n n e d 👁️

🫁 comms: vgen.co/livingmoth
🥩 portfolio: livingmoth.crevado.com
🦷 toyhouse: toyhou.se/livingmoth
November 14, 2026 at 2:54 PM
Did you know the word "animation" comes from the Latin "animatio," meaning "bestowing of life"?

Long before it meant moving images, it simply meant "liveliness." The art form literally means giving life to the inanimate.
November 6, 2026 at 2:00 PM
Data structure animation: stack, queue, hash map and tree as machines (SVG + TypeScript)
_Originally published on Homingo Learn._ _A data structure is state that changes one operation at a time. Animate that state, give every item a stable id and draw each structure as a machine people already understand._ Most data structure animations are boxes sliding around a whiteboard. They show _that_ something moved, but not why, and they get hard to follow the moment two things change at once. This guide builds animations that teach: each structure becomes a physical machine, the animation is driven by a log of operations, and only the parts that actually change are allowed to move. The code is plain TypeScript writing SVG, so the same figure works on a course page, in a lecture slide and in a 1080x1920 explainer reel. ## Animate the state, not the drawing _Operations make snapshots; frames only exist between two snapshots._ Separate three things that tutorials usually mix up: 1. **Operations:** the list of what happens (`push(4)`, `pop()`). This is your script. 2. **Snapshots:** the full state after each operation, every item with a stable id. 3. **Frames:** drawings in between two snapshots. An item that exists in both moves; an item only in the new one enters; an item only in the old one leaves. With that split, the drawing code never needs to know what a stack is, and the data structure code never needs to know about pixels. You can also test the snapshots like any other function. _snapshots.ts: run an operation log on a stack and keep every state. Ids come from a counter, so equal values stay different items._ type Item = { id: string; value: number }; type Op = { kind: 'push'; value: number } | { kind: 'pop' }; export function stackSnapshots(ops: Op[]): Item[][] { let next = 0; let stack: Item[] = []; const out: Item[][] = [[]]; for (const op of ops) { if (op.kind === 'push') stack = [...stack, { id: `i${next++}`, value: op.value }]; else stack = stack.slice(0, -1); out.push(stack); } return out; } // stackSnapshots([{ kind: 'push', value: 4 }, { kind: 'push', value: 7 }, { kind: 'pop' }, { kind: 'push', value: 2 }]) // -> [], [4], [4, 7], [4], [4, 2] (as items with ids i0, i1, i2) > Never key items by their value. Push 4 twice and a value-keyed animation shows one plate jumping instead of a second plate landing. A counter-based id is the cheapest fix. The same idea scales up to whole systems in isometric architecture diagrams as code. ## Stack: a pile of plates _The top plate is the only part that moves, which is the whole lesson of LIFO._ A pile of plates in a canteen is the oldest analogy in computer science, and it works because people know the rule without being told: you take the top one. Make the animation obey the same rule. On `push` the new plate drops from above and lands on top; on `pop` the top plate lifts away. Nothing else moves, so the eye goes straight to the one part that matters. * **Readout beside the stack:** `size` and `top` change on the same frame the plate lands, not before. * **Call stack version:** label each plate with a function name and its arguments. Recursion becomes a pile that grows and then unwinds plate by plate, which is far clearer than an indented trace. * **Overflow:** draw a maximum-height mark beside the pile. When the next plate does not fit, show it, then stop. A stack overflow is a physical event here. ## Queue: a conveyor with two ends, or a ring _Two honest pictures of a queue: the idea (a conveyor) and the usual memory layout (a ring)._ A queue has two ends, so its machine needs two: things go on at the rear and come off at the front. A conveyor belt makes first in, first out obvious. It also shows the cost of the naive array version: every dequeue shifts every item along by one. Then show what fast queues actually do. A ring buffer keeps the items still and moves two pointers instead: `head` marks the next item to leave, `tail` the next empty slot. Both walk round the ring and wrap with `% capacity`. Animate the pointers, not the items, and the point of the data structure is visible in one shot. _ring.ts: a fixed-size ring buffer queue. The animation reads head, tail and slots from each snapshot._ export class Ring<T> { private slots: (T | undefined)[]; head = 0; // next item to dequeue tail = 0; // next empty slot size = 0; constructor(readonly capacity: number) { this.slots = new Array(capacity); } enqueue(v: T): boolean { if (this.size === this.capacity) return false; // full: show it, do not overwrite this.slots[this.tail] = v; this.tail = (this.tail + 1) % this.capacity; this.size++; return true; } dequeue(): T | undefined { if (this.size === 0) return undefined; const v = this.slots[this.head]; this.slots[this.head] = undefined; this.head = (this.head + 1) % this.capacity; this.size--; return v; } snapshot() { return { head: this.head, tail: this.tail, slots: [...this.slots] }; } } ## Hash map: a cabinet of drawers _The hash picks the drawer; a drawer with two cards is a collision._ A hash map is a cabinet with numbered drawers. The hash function turns a key into a drawer number, so finding a key means opening one drawer instead of searching the whole cabinet. When two keys land in the same drawer, that drawer holds a short list: that is separate chaining, and it is why a lookup is fast on average but not always. For the figure you need a hash that is easy to show and still spreads keys well. FNV-1a is short enough to put on screen: _hash.ts: FNV-1a (32-bit) over the UTF-8 bytes of the key, then the drawer index. Good for teaching figures; real hash maps use their language runtime's own hash._ export function fnv1a(key: string): number { let h = 0x811c9dc5; for (const byte of new TextEncoder().encode(key)) { h ^= byte; h = Math.imul(h, 0x01000193) >>> 0; } return h; } export const drawerOf = (key: string, drawers: number) => fnv1a(key) % drawers; // Animation beats for set(key): key card appears -> hash box glows -> index shows // -> drawer slides out -> card drops in -> drawer closes -> load factor ticks up. * **Show the load factor:** items divided by drawers, on screen at all times. When it passes the threshold your map uses (0.75 is a common default), animate the resize: a bigger cabinet appears and every card is re-filed, because its drawer number changes with the drawer count. * **Show a collision on purpose:** pick two keys that really land in the same drawer with your hash and drawer count (with FNV-1a and 8 drawers, “chai” and “dosa” both land in drawer 4). Compute them first; never fake the index in the drawing. Machines like this cabinet are what our Isometric explainers skill has Claude Code draw: crafted isometric figures with live readouts, for docs and for 1080x1920 explainer reels. ## Binary search tree: a sorting machine of gates _Each node is a gate: smaller goes left, larger goes right. The path is the lesson._ Think of every node as a gate with one question: is the new value smaller or larger than me? The value rolls down from the root, turning left or right at each gate, until it reaches an empty spot. For teaching, the path matters more than the final tree, so make the insert function return the path: _bst.ts: insert that records the path for the animation, one comparison per step._ type Node = { id: string; value: number; left?: Node; right?: Node }; type Step = { at: string; cmp: 'left' | 'right' }; export function insert(root: Node | undefined, node: Node): { root: Node; path: Step[] } { if (!root) return { root: node, path: [] }; const path: Step[] = []; let cur = root; for (;;) { const dir = node.value < cur.value ? 'left' : 'right'; path.push({ at: cur.id, cmp: dir }); const child = cur[dir]; if (!child) { cur[dir] = node; return { root, path }; } cur = child; } } // Each step is one beat: highlight the node, show "65 > 50 -> right", move the token along the edge. > This insert changes the tree in place. If you keep snapshots, clone first (`structuredClone(root)`) so every stored snapshot stays a separate tree, exactly like the stack snapshots above. Add a readout for comparisons and tree height. Then insert sorted values (10, 20, 30, 40...) and let the tree lean into a straight line. Viewers see why balanced trees exist without a single formula. ## Tween between snapshots, not inside them Once every item has an id, one small function animates any structure: match items by id, ease the ones that moved, fade or drop in the new ones, lift or fade out the removed ones. _tween.ts: positions for one frame between two snapshots. Layout functions turn a snapshot into { id - > x, y } for each structure._ type Pos = { x: number; y: number; opacity: number }; type Layout = Map<string, { x: number; y: number }>; const ease = (t: number) => (t < 0.5 ? 4 * t * t * t : 1 - (-2 * t + 2) ** 3 / 2); // ease-in-out cubic export function frameAt(from: Layout, to: Layout, t: number): Map<string, Pos> { const k = ease(Math.min(1, Math.max(0, t))); const out = new Map<string, Pos>(); for (const [id, b] of to) { const a = from.get(id); if (a) out.set(id, { x: a.x + (b.x - a.x) * k, y: a.y + (b.y - a.y) * k, opacity: 1 }); // moved else out.set(id, { x: b.x, y: b.y - 60 * (1 - k), opacity: k }); // entered: drops in } for (const [id, a] of from) { if (!to.has(id)) out.set(id, { x: a.x, y: a.y - 60 * k, opacity: 1 - k }); // left: lifts away } return out; } * **One operation per beat.** Give each operation its own beat, roughly half a second to a second, and hold briefly after it so the readout can be read. * **Stagger, do not stack.** When a resize re-files every card, start each card a few frames after the last. Ten cards moving together read as one blur. * **Respect reduced motion.** On a web page, check `prefers-reduced-motion` and jump straight to each snapshot instead of tweening. ## Turn it into a 1080x1920 explainer reel The same snapshots drive a vertical video. Render each frame in a browser at 1080x1920 (with a React video tool like Remotion, or a headless browser plus ffmpeg), keep the structure and its readout in the middle of the frame, and narrate one operation per beat. Plan the shots before you build: open on a question (“why is a hash map lookup fast?”), show the whole machine, run three or four operations, then end on the case that breaks it (a collision chain, a lopsided tree). Camera moves, cutaways and narration cues are covered in our exploded view explainer reel guide, and isometric projection and shading in isometric SVG diagrams for docs. For the storyboard behind a one-concept explainer, in Hinglish: educational animation video kaise banaye. > **Isometric explainers skill** : Our Claude Code agent skill for crafted, interactive isometric figures: live readouts, dark and light themes, timed callouts and built-in layout, motion and geometry checks. One command turns the same figure into a 1080x1920 explainer reel with camera moves, cutaways and callouts. Explain a mechanism as a real, well-made machine. See the skill ## Checklist before you publish 1. **Correct first:** every snapshot comes from running the real code, and you have unit tests for the operations. 2. **Stable ids:** equal values are separate items; nothing teleports. 3. **Only what changes moves:** if an item did not change, it does not animate. 4. **Readouts on screen:** size, top, head and tail, load factor or height, updated on the same frame as the change. 5. **Honest analogy:** say once where the machine stops matching memory (the conveyor shifts; the ring does not). 6. **Readable on a phone:** labels stay large at 1080 px width, and nothing important sits under the app’s buttons. _Disclosure: this guide is by Homingo, the team behind the skill linked above. Everything in it works without it._
dev.to
November 5, 2026 at 12:34 AM
Können wir unsere Ökosysteme noch retten? | KlimaZeit vom 30.10.2026 - YouTube

https://www.youtube.com/watch?v=hAT8Pm1sZgs

KlimaZeit 19:45 Uhr "KlimaZeit" bietet wöchentlich Hintergrundberichte, ordnet Ergebnisse der Klimaforschung ein, erklärt in …

#jakobsweg
#caminodesantiago
#buencamino
Können wir unsere Ökosysteme noch retten? | KlimaZeit vom 30.10.2026
KlimaZeit 19:45 Uhr"KlimaZeit" bietet wöchentlich Hintergrundberichte, ordnet Ergebnisse der Klimaforschung ein, erklärt in aufwändigen Grafiken und Animatio...
www.youtube.com
October 31, 2026 at 2:00 PM
Können wir unsere Ökosysteme noch retten? | KlimaZeit vom 30.10.2026 - YouTube

https://www.youtube.com/watch?v=hAT8Pm1sZgs

KlimaZeit 19:45 Uhr "KlimaZeit" bietet wöchentlich Hintergrundberichte, ordnet Ergebnisse der Klimaforschung ein, erklärt in …

#jakobsweg
#caminodesantiago
#buencamino
Können wir unsere Ökosysteme noch retten? | KlimaZeit vom 30.10.2026
KlimaZeit 19:45 Uhr"KlimaZeit" bietet wöchentlich Hintergrundberichte, ordnet Ergebnisse der Klimaforschung ein, erklärt in aufwändigen Grafiken und Animatio...
www.youtube.com
October 31, 2026 at 2:00 PM
🚀 Fastest-growing AI projects today:

1. One standout trend the integration of AI into creative industries such as game animatio...
2. CrocSwap/integer-mult-bounds a repository focused on conditional integer multiplication...
3. With a growth score of 54.06 and over 300 stars, thproject appears
October 30, 2026 at 11:30 PM
@cartoonbrew.bsky.social: ‘A Great Person, A Great Talent, And A Great Friend’: Animation Community Pays Tribute To Eric Bauza

www.cartoonbrew.com/rip/animatio...
Animation Community Pays Tribute To Eric Bauza’s Legacy
Friends and collaborators remember Eric Bauza as a gifted performer, artist, animation advocate, and generous friend who brought people together.
www.cartoonbrew.com
October 28, 2026 at 2:15 PM
'The only thing bigger than Eric’s talent was his heart.'

Friends and collaborators are remembering prolific voice actor Eric Bauza’s artistry, generosity, and tireless love of animation.
www.cartoonbrew.com/rip/animatio...
Animation Community Pays Tribute To Eric Bauza’s Legacy
Friends and collaborators remember Eric Bauza as a gifted performer, artist, animation advocate, and generous friend who brought people together.
www.cartoonbrew.com
October 27, 2026 at 3:02 PM
very cute animatio- BLENDER??
October 27, 2026 at 8:14 AM
This looks fab!! I’ve been doing my screen recordings with screen.studio the past few years, they’re a delight
Screen Studio — Professional screen recorder for macOS
Screen recorder for macOS. Create engaging product demos, courses, tutorial and social media videos. Add automatic zoom on mouse actions, smooth mouse movement, and other powerful effects and animatio...
screen.studio
October 26, 2026 at 7:37 PM
Viviziepop and her consequences on the indie animatio industry
October 21, 2026 at 9:52 PM
Oh hey that’s a great animatio-
Gru Reacts to El Macho
ALT: Gru Reacts to El Macho
static.klipy.com
October 21, 2026 at 7:22 AM
「この世界で、生き残れ」―TVアニメ『DARK MACHINE THE ANIMATION』新グッズがCOSPA(コスパ)から登場!!【株式会社コスパ】
「この世界で、生き残れ」―TVアニメ『DARK MACHINE THE ANIMATION』新グッズがCOSPA(コスパ)から登場!!【株式会社コスパ】
コスパグループ株式会社のプレスリリース 公式キャラクターコスチュームやアパレルなどの企画、開発、製造を行う株式会社コスパ(所在地:東京都渋谷区、代表取締役:松永芳幸)は『DARK MACHINE THE ANIMATIO ...
animebox.jp
October 19, 2026 at 5:09 AM
「この世界で、生き残れ」―TVアニメ『DARK MACHINE THE ANIMATION』新グッズがCOSPA(コスパ)から登場!!【株式会社コスパ】
「この世界で、生き残れ」―TVアニメ『DARK MACHINE THE ANIMATION』新グッズがCOSPA(コスパ)から登場!!【株式会社コスパ】
コスパグループ株式会社のプレスリリース 公式キャラクターコスチュームやアパレルなどの企画、開発、製造を行う株式会社コスパ(所在地:東京都渋谷区、代表取締役:松永芳幸)は『DARK MACHINE THE ANIMATIO ...
gamehack.jp
October 19, 2026 at 5:18 AM
I used a 3D model of Zanzanburo to help with the animatio , which was made by 戀坂胃炎(www.pixiv.net/en/users/940...)
戀坂胃炎
www.pixiv.net
October 17, 2026 at 5:03 PM
Fresh graduates and those who are familiar with the said fields (even their profession/job is not aligned) can also participate.

forms.gle/3VixRjt3TtCC...
DAYONE - Animated Short Film Survey for Multimedia Experts
I am Shane Russell C. Magtoto from BSEMC 4-Y1-1 at Our Lady of Fatima University – College of Computer Studies; Bachelor of Science in Entertainment and Multimedia Computing: Major in Digital Animatio...
forms.gle
October 17, 2026 at 7:47 PM