Skip to main content

Dijkstra pathfinding with python.

I have a lot of half finished things floating around, here is one of them...

Been seeing the dijkstra algorithm around a bit lately, so I had a go at implementing it in Houdini.

http://en.wikipedia.org/wiki/Dijkstra%27s_algorithm

Most of it is in python. ~2000 points and it cooks in about 1.2s so it isn't super slow...

Could probably be faster if I made it A* instead, but I have nothing to use it for so, meh!




hipnc is here.
you will need the otl here too

Comments

  1. Hello Sam,

    I'd love to get a look at the pathfinding files, but the links you supplied in the post don't seem to be active. Any chance you could help me get the files?

    Thanks in advance,
    Marein Könings

    ReplyDelete
  2. My domain expired :/ Should be back up in the next day, but I can email you the stuff if you give me your address :)

    ReplyDelete
  3. That would be great! Please send it to contact@myname.org, where myname is the name under which this comment is posted (without capitals). Measures to prevent spam and such... :)

    ReplyDelete

Post a Comment

Popular posts from this blog

Some SOPs edges and poly line business

Every time I go to extract the border from a mesh I always end up using some strange combo of Group unshared edges, delete and dissolve, I came across a good way of getting unshared edges that I haven't thought of before, and now it seems really obvious ... using the polycap node to trace the border and then deleting all of the source prims, works like a charm! I have also usually had trouble with splitting up a line into multiple primitives, here is a way to create a primitive per edge. This example only works if every point has 2 neighbours but could easily be modified with a copy SOP to allow a dynamic amount of neighbours. (instead of 2 vopsops and a merge to duplicate the points). It works like this: The point number is stored in an attribute to create a unique number for each point The whole mesh goes into 2 streams to duplicate every point. For the first set of points, each point gets the point number of the first neighbour and applies a cantor func...

Worm locomotion with FEM

I have always wanted to do a dynamic locomotion setup, I have tried in the past with wire and sop solver with .... interesting results ;) With FEM in Houdini 13, the rest attribute is stored on vertices which allows a tetra to change its rest state independently of the surrounding tetras. With this, parts can be expanded and shrunk to get a muscle type action. I have started with a worm since it is quite simple, the contractions and expansions move back along the worm in a wave, opposing the travel direction. It took quite a bit of tweaking to get him moving at all. One major element of a real worm's action that's missing is the little hairs that grip the ground. I couldn't find a way to change the friction per point so I have gone a bit hacky and multed down v wherever I didn't want the worm to move. I would love to hear if there is a per point friction control! Here is the video Houdini 13 FEM Worm locomotion from Sam Hancock on Vimeo . ...and the .hip is...

Wire to RBD feedback in DOPs

Normally if a wire is constrained to an RBD, the rbd isn't affected by the wire at all. Which is annoying ... but I had an idea to get it to work. the wire solver can store the internal forces on the geometry. In DOPs I made a point force, the position is set to the position of the constraint and the force is the wire's internal (linear) force. I have put a sopnet in the dopnet to get the wire and the constrained point so I can reference them in the point force. It could be simpler with a python expression to get the position and force directly without going through the sopnet, but this is just a little test... For multiple attachment points, I think a copy data node could be used to copy the point force data for each constrained point ... hip file here Wire to RBD feedback forces from Sam Hancock on Vimeo .