blueish

about blender and houdini

[blueish @blueish0930]

You can get my setups on gumroad now:https://t.co/4C3f5vFXgZ

[blueish @blueish0930]

@quackarooners @SpaghetMeN0t just convert the geomtry to NDC, and use a grid to cut out the silhouette. From the boundary of the cutoff grid. We can get exact the same result. The SDF of view silhouette is kinda interesting :P

[blueish @blueish0930]

Find All cells from edge graph
#gn

[blueish @blueish0930]

Recalculate Normals
#gn

[blueish @blueish0930]

Circle Packing again, but this time, convert mesh vertices to circles and each circle is tangent to its neighbors.
#houdini

[blueish @blueish0930]

2D approximate convex decomposition
#houdini

[blueish @blueish0930]

QEM mesh simplification made in GN.
#b3d #gn #qem

[blueish @blueish0930]

@AFX_LAB No, this is detriangulate algorithm. Quad remesher is hard to implement by current gn. But i do make a triangle remesher a few days ago.

[blueish @blueish0930]

Better detriangulate into quad. Most of time it can produce less singularity triangle face than the native algorithm.
#b3d #GN

[blueish @blueish0930]

@KayHilman_ totally based on native nodes

[blueish @blueish0930]

Made a simple remesh, it will be helpful :P
#b3d #gn

[blueish @blueish0930]

Now it also support adaptive remesh where curvature is higher, the more dense the area will be. It's available on my gumroad now:https://t.co/Ng3vUTpz1M
#b3d #gn

[blueish @blueish0930]

@MysteryPancake1 @MatterCg Well, i tried that one a long ago, it really sucks and require a uvmap.

[blueish @blueish0930]

@fmoewe Well, it's a complicated setup. But if u are pursue the effect,you can search straight skeleton, there is 1 addon there

[blueish @blueish0930]

Straight Skeleton. Suffering from precision issue a lot when doing it for characters. But works well on regular polygon.
#b3d #gn

[blueish @blueish0930]

@AFX_LAB No，it is more like a path optimization algorithm . For quad remeshing, you will need a smooth crossfield on the surface

[blueish @blueish0930]

Minimum Spanning Tree using Borůvka's algorithm. Most of videos only talk about Prim's or Kruskal's algorithm. But both are not suitable for geometry node because they execute in sequential orders while Borůvka's algorithm is running in parallel
#b3d #GN #MST

[blueish @blueish0930]

Least Square Sphere fitting. The analysis method is minimize (x-c)²-r² which is a little bit wrong but works fine for sphere-like shape. Gauss-Newton method is minimize (|x-c|-r)², so it's more accurate.
#b3d #gn

[blueish @blueish0930]

@fishwfeet You can see the timings in the video. It's linear to vertex count. Each vertex will have a event. By computing when it happens for each vertex and then select the closest one will happen.

[blueish @blueish0930]

@seanterelle Cool！how did you make this rigid sim? Fully gn?