VoroNERF is coming along better now that i fixed a huge bug with my Top K selection of sites! It's still not perfect of course, lots of bugs and stuff to fix. This is with 60k voronoi sites, using the 16 closest sites around any sampling position along the render rays.

"Animated Bokeh" has been on my whiteboard for a long time, and this is the result. I thought it would just be for cheesy novelty effects, but it also does lightfield manipulation that was cooler than I expected. www.youtube.com/watch?v=Kg_2...

My MOPs course on Houdini.School is now free! If you want a start to finish course on how (almost) everything works, plus the math background, you can watch it all here: www.houdini.school/courses/mops...

voronoi based NERF training isn't going incredibly well... 😂20k iterations with 80k voronoi sites takes about 10 hours to train. And it still looks dog water. Definitely need more sites and some better approach to accelerating sampling....

Voronoi implicit but this time in 3d. It's not fully NERF mode yet, as I'm not doing any kind of sampling along rays, this is just trying to learn volumetric data. 30,000 Voronoi sites. Probably not enough for the pighead, but it's just a fun first test.

Lebronsketball 2

Lebronsketball 1

*morphs your cat*

Gaboronoi (top) vs Anisotropic Voronoi (bottom), with 5000 Sites. I feel like the anisotropic voronoi's artifacts are more aesthetically pleasing. Gaboronoi is faster to train by a lot! I've compiled all of my recent voronoi experiments into a collab: colab.research.google.com/github/jaker...

I'm once again making neural implicits of my cats. This time we're back to the voronoi. Gabor noise style. We weight the result of the softmax at any site i by sin(F_i*(x_i-x_j)•u_i) where F_i is learned frequency and u_i is a learned anisotropy direction. I call it Gaboroni

Wanted to make a neural implicit that's just layers of anisotropic simplex noise. Turns out it works pretty well. With 24 layers of simplex noise each with a 96x96 texture of anisotropy data we can get this kind of result! It's not at all a good compression method but it's fun and cool :)

I had the idea to incorporate anisotropy into the recent Spherical Voronoi paper. And when we apply their ideas to euclidean problems (not Spherical) the results are pretty great when anisotropy is used. This is 3000 anisotropic sites vs 3000 isotropic sites. Same learning rates for both

Shockingly annoying to find the points of intersection between a plane and an AABB. Even when I know the plane passes through the center of the box. If anyone has a simple method for finding the exact distance to a plane clipped by a bounding box I'd be eternally grateful.

Computing the exact bijection of the optimal transport (OT) problem between very large point sets is completely untractable… In our SIGGRAPH Asia 2025 paper: “BSP-OT: Sparse transport plans between discrete measures in log-linear time” we get one with typically 1% of error in a few seconds on CPU!

For the snow on the hedge maze in Zootopia 2, we cast rays upwards from each leaf and if it didn't collide with anything we instanced a snow chunk onto it. We made a few variants of the snow chunks to add extra variation.

my FX work alone required at least 1 quadrillion of the 3.7 quadrillion rays traced on Zootopia 2. This is FACTUAL and REAL. If you are a journalist, please cite this in your article.

my GOAT 🐐🐐🐐🐐

At 10am this morning at SIGGRAPH, my teammate Nathan Zeichner will be presenting our talk about a texture streaming system for Ptex on the GPU that we built for our in-house interactive pre-viz GPU path tracer; the talk is by Nathan, Mark Lee, and me. s2025.conference-schedule.org/presentation...

New at #SIGGRAPH2025: Can we make Perlin Noise stretch along some underlying vector field? Well it turns out it's possible with two simple additions to the original method! No need for advection or convolutions. Find the paper and implementations here: github.com/jakericedesi...

One of my coworkers, @tearsofjake.bsky.social, has a talk at SIGGRAPH this year about this really cool steerable perlin noise technique that was used on Moana 2. He's just posted some handy reference implementations for Houdini, Unity, Godot, and Blender; check it out! github.com/jakericedesi...

Time for another long blog post... and today it's all about how we handle the temporal aspect of animation data. And more specifically, how to approach things from a signal processing perspective, covering up-sampling, down-sampling, and everything in-between. theorangeduck.com/page/filteri...

A thread on our new, also awesome, Siggraph paper "Linear-Time Transport with Rectified Flows", by K. Do, @dcoeurjo.bsky.social, P. Memari and me. Paper here: perso.liris.cnrs.fr/nicolas.bonn... Results in video: youtu.be/EcfKnSe6mhk

How do I get the discover page to align more with my interests? I've tried following a bunch of people, but it still kinda just shows stuff based off whatever categories I clicked when I signed up...

I know it’s a bit uncool to linkedin-post on here but we’re hiring at work, I’ve been looking at quite a lot of showreels, so I wrote up some tips for making a great fx reel #vfx www.linkedin.com/pulse/creati...

Distances to LP Voronoi Edges :) shadertoy.com/view/MXVyz1

So what is the tiniest possible fluid simulation? Can we get anything interesting from a single cell? For this we'll be using a standard MAC grid, which means we'll represent horizontal velocities (red) on the vertical edges and vertical velocities (green) on the horizontal edges of each cell.

Distances to the boundary of voronoi in L4. shadertoy.com/view/lfKfWV Hopefully it doesn't crash webgl on your device! :)

Recordings for Graphics Programming Conference 2024 are now up. The lineup is packed with amazing talks ranging from rendering for games like Tiny Glade, Hades, and Baldur’s Gate 3, to even a talk on designing your own GPU! youtube.com/playlist?lis...

Is there a robust and fast way of finding the nearest point on a paraboloid of form: (x,y, f(x) + f(y)) where f() could be any range of convex functions, like x^2 or x^4? So like given a point (p0,p1,p2) minimize: (x - p0)^2 + (y-p1)^2 + ((f(x) + f(y)) - p2)^2 With respect to x and y.

is it normal to count as you walk up stairs?