Jump to content


  • Content count

  • Donations

    10.00 CAD 
  • Joined

  • Last visited

  • Days Won


acey195 last won the day on August 10 2019

acey195 had the most liked content!

Community Reputation

167 Excellent

1 Follower

About acey195

  • Rank
    Houdini Master
  • Birthday 01/10/1991

Contact Methods

  • Website URL

Personal Information

  • Name
  • Location

Recent Profile Visitors

7,747 profile views
  1. Random link of interest

    For those who want reference for a liquid methane explosion, or are otherwise interested in rocketry. There's many angles, slow motion footage and commentary from someone who knows his stuff :
  2. Covid will delay H18.5?

    They are still working on it (currently) No idea about the release date though.
  3. Grouping unshared "in-line" edges

    Hey Just something I would do in a wrangle or group expression SOP // running over points: @group_entryPt = neighbourcount(0, @ptnum)==2; // then you just add a group promote, converting it to an edge group (with the checkbox ticked of only include complete entities (or whatever it was called, don't have hou open atm )) Edit: That should at least work for the single extreme edge-entry points. For the doubles and up, you probably have to do a bit more, but generally speaking, using the amount of neigbours of a point and the amount of vertices on a point together should work on "2d" geometry, I think but you may have to create the groups directly in vex, to avoid grouping unintended edges. But to avoid selecting edges on both sides of a corner separately, you would have to add additional logic (as soon as you allow those double-edge entry points) if its only 1 and 2 edges you probably can get away with case-by-case handling, if you want to go up to an arbitrary amount of edges, its just will have to get more complicated I guess
  4. Learn Processing before VEX?

    Yes and no. The stuff he teaches is indeed great and some of it will be transferable (at least the basic coding logic) However, the syntax of that language is quite different from Vex, and it would work the closest to Vex, run over "detail (only once)", which while valid for some purposes, is not the most efficient use of VEX. In this case using a Python SOP will be about the same speed, which is probably easier to learn (has more learning resources outside of Houdini) VEX is kind of designed to process existing data, rather than generating everything from scratch. (but note that it CAN do it) When VEX is run over "points" or "primitives", it acts more like a shader, executing exactly the same code for each of them, which allows multi-threading, unlocking its true power. Hope that helps!
  5. Creating smooth curve from imported curve geometry

    Hey, Welcome to Houdini! May I suggest using the convert SOP (converting it to third order NURBS) you may also find it useful to: use the facet SOP using the "Remove Inline Points" toggle and then play with the distance to remove some "oversampling" use the fuse SOP to merge nearby points in corners (to avoid having sharp corners using convert) resample with a large value for "Maximum Segment Length" to reduce the noise in your samples Or alternatively, you can also keep your geometry at polygons with the resample SOP, setting the "Treat Polygon As" dropdown to "Subdivision Curves"
  6. FBXoutput

    The easiest way is to use a python sop in a forloop, causing the renderbutton to be pressed. note that your node may have to be "unlocked", so having it inside a locked hda will require some additional work something along the lines of: #python code: hou.parm("../ropnet1/fbxnode/execute).pressButton()
  7. FBXoutput

    I thought it was mainly, so it would be able to save animations (using the time frame) but yeah you'll need some kind of looping structure, or shenanigans using the pre/post render scripts
  8. Vertex Point Order Issue

    Instead of poly extrude, you could try to use some work around using the "Skin" SOP, together with some copy/transform logic that way you inherently maintain the point ordering.
  9. [SOLVED] vex groups question

    Note that @ikoon's method is faster than the partition SOP at least in 17.0x and earlier, have not yet tested in later versions. Difference is of course going to be very small, but can make a difference on heavy geo
  10. For me it reaaaally depends what the end goal is. (Speaking from a Gamedev perspective) I would say #1 is not a trap, as soon as you know what you are doing, for me building something efficient right from the bat (using a lot of vex) is way faster, than building something with a lot of nodes, only to tear it all down later and rebuild it. Especially as you lose a lot of time, tracking all the attributes and stuff, and getting lost in a node network that is presumably larger, than it really needs to be Edit: basically give yourself some time to think of the general process/flow of the process beforehand, instead of diving headfirst into anything. Especially if you keep building on top of it, then it always turns into a mess I find. for #2 this is Only wrong, if this process is a step in the process near the very end. The earlier on in the chain of processes the system is, the more annoying fixing things by hand will be. In my experience spending an Hour of work on the procedure, that saves one second of hand edit, is almost Always worth it, if you sum up all those seconds of hand editing (and having to completely redo all the steps after. For example, an HDA that turns a triangle mesh into a quad mesh, has to work 100% of the time, unless you have specific manpower assigned to fix the results every time. (and I'm not going to myself ) for UI, the Houdini interface can do a lot with the basic stuff. The trick is to not have too many parameters to begin with, trying to make as many things as possible relative to each other (providing overrides for people who think they know better than you :P) but yeah, python created dropdown menu's are very nice to have in a lot of cases.
  11. Had the pleasure to meet him in person a few times, great person! For me whenever old school people get back into houdini (or when people look at outdated tutorials) and need to understand "stamping" I always point them to the following video: "Geometry Workflows in Houdini 16 // Jeff Wagner // Illume Webinar"
  12. xyzdist function check

    ok, had some time to actually at the file, what I suggested earlier should work for your case, since you are only checking the center of every primitive, once. So for the final code, I would just do this: int outPr; float maxdist = chf("radius"); vector outUV; //to use the range overflow of the xyzdist() you also have to query the primitive and uv for some reason string grp = sprintf("!%d", @primnum); f@test = xyzdist(0, grp, @P, outPr, outUV, maxdist + 0.001); if(@test<maxdist){ s@near = "close"; } with a lot more primitives, its going to be more costly of course, but probably still less than putting it in a loop. That said, with a very large amount of geometry, you may have to do the calculation in multiple steps, so not every primitive has to check Every other primitive, but just the ones that are close. Also, you could add an heuristic, resampling all primitives, adding a center point to all edges and check those first with a nearpoint() expression, then afterwards, doing the xyzdist() for all the remaining primitives. That way you could greatly optimize all the plots that have similarly sized buildings next to each other, as those points will in a lot of cases, nicely line up with the center of the neighbouring primitive in that case, if you are really afraid about performance.
  13. xyzdist function check

    Well, resampling will indeed increase the usage of RAM, and GPU if you are display it, but in terms of calculation, using nearpoints() is a way faster (lighter on the CPU) operation than xyzdist() Also, you could set your resample node's parameter "Create Only Points" (destroying the primitives for the calculation) which will greatly lower the GPU and a bit of the RAM usage. It of course matters, what kind of fidelity you need for this, if you really need 0.001m accuracy this method is of course not going to work. Though, there are certain work-arounds, like measuring the distance to the 2 closest points (instead of 1) and using some geometry math, to find out where along that edge, lies the actual closest position.
  14. about parallel processing in VEX

    the meta data block, (which you can generate with a button from the input of a foreach) will give you a detail attribute, with the current data its looping over "value", incase you are running over numbers as well as an "iteration" attribute, you can use in other cases. you can use those values, to make sure your wrangle fetches the right data/does the right thing, depending on the iteration of the loop. Also, generally speaking, putting everything in a single wrangle only gives you a very slight performance increase in terms of overhead, which is almost always outweighed, by the multi threading benefit you get from using multiple nodes. In addition, the overhead can be completely eliminated by using a compile block (which only really starts to make sense with larger numbers of nodes, or if you are taking the loop approach)
  15. xyzdist function check

    yeah looping over all primitives like this, even using groups is going to be very expensive. One optimization, is giving it a maximum search range (which will speed up the function a lot) if you have more or less similar expected distances. float xyzdist(<geometry>geometry, vector origin, int &prim, vector &uv, float maxdist) or float xyzdist(<geometry>geometry, string primgroup, vector origin, int &prim, vector &uv,float maxdist) https://www.sidefx.com/docs/houdini/vex/functions/xyzdist.html generally what I would do is: int outPr; float range = chf("range"); vector outUV; float dist = xyzdist(1, v@P, outPr, outUV, range+0.001); if(dist > range) return;//or continue if in loop Alternatively, if you are dealing with reaaaly large amounts of geo, I would suggest just resampling your primitives, saving the primitive number to those new points, and check the nearest points, instead of using xyzdist()