Category: hou-general

Archived post by WaffleboyTom

someone said , group + blast is much faster than an if statement + “removepoint()“ so I ran some tests (20 million points) and it is indeed true, although the absolute fastest is grouping using an integer attribute instead then doing “ @my_attrib>0“ in the blast (0.174 seconds compared to 1.594 for “if + removepoint()“, maybe this is helpful to someone 😄

Attachments in this post:
http://fx-td.com/houdiniandchill/wp-content/uploads/discord/20230002/25/23/image.png
http://fx-td.com/houdiniandchill/wp-content/uploads/discord/20230002/25/23/removepoint_blast_comparison.hiplc

Archived post by WaffleboyTom

“`nodes = hou.selectedNodes()
#get pane editor = hou.ui.paneTabOfType(hou.paneTabType.NetworkEditor)
#reset images
editor.setBackgroundImages([])
#get images
b_img = [img for img in editor.backgroundImages()]
for node in nodes: for parm in node.parms(): if(len(parm.keyframes())>0): #create image img = hou.NetworkImage() size = node.size() img.setRect(hou.BoundingRect(-2,-0.5,size[0],size[1])) img.setRelativeToPath(node.path()) img.setPath(‘$SIDEFXLABS/misc/stickers/emoji/SIDEFX_CUSTOM_EMBLEMS 08.png’) b_img.append(img) break editor.setBackgroundImages(b_img)“`

use this one instead

takes the size of node in consideration

Archived post by Nick D

@mestela `Sure! Here’s a short rap about Matt Estela:
Verse 1: Meet Matt Estela, the man with the plan He runs Cg Wiki, where graphics fans Can find all the knowledge they need to grow And learn about Houdini, the software pro
Chorus: Matt’s got the skills, he’s got the drive He makes the graphics come alive With Houdini in his hands, he’s a king Making stunning visuals, that’s his thing!`

Archived post by PaqWak

So I was looking for a way to find the longest path in a network of edges, like the opposite from what the ‘find shortest path’ does. I remember looking for a solution previously without succes. So I asked Skynet (Chat-GPT), and here’s his solution :

The doc don’t mention that, actually the shortest path OP complain about the negative weight … but it indeed output the longest path as far as I can tell 🥳

Attachments in this post:
http://fx-td.com/houdiniandchill/wp-content/uploads/discord/20234501/11/23/image.png