Jump to content


  • Content count

  • Donations

    10.00 CAD 
  • Joined

  • Last visited

  • Days Won


Everything posted by acey195

  1. 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.
  2. [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
  3. 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.
  4. 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"
  5. 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.
  6. 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.
  7. 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)
  8. 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()
  9. Quads instead of triangles

    Or you could write your own quadrify node, with some wrangles/python and a dissolve node. What we did, was finding for every triangle, the longest edge (out of 3) Then, if a neighboring triangle has the same edge as its longest edge, group it. Afterwards you can just dissolve this group and you have a quite reasonable quadrify process. It will of course keep some triangles this way, depending on how have modeled the "joints" Also can't share the code unfortunately, but that could give you a start.
  10. about parallel processing in VEX

    In general, yes if you only really use point or primitive mode, if the order of processing is not important (or you compensate for it in another way, such as calculating the same data again in other points that need to access it, although this may lower the speed by such an amount that running in detail may be faster anyways) but there are other things you can do, like Skybar mentioned, or simply putting the wrangle in a for loop, potentially using the meta data block Also, don't be afraid to mix and match point and detail mode, and divide your code over multiple wrangles, so you can have the best of both worlds
  11. How do I skin connected curves?

    Not really using the polyExpand2d, you may also want to try the polyWire sop (and then flatten the result and removing the bottom) another solutions is putting a grid under it, making a distance field of the curve on the grid, and then use a clip sop based on this value (by transforming the height using the distance field) but this method creates an unaligned topology (which it sounds like you don't want)
  12. Python: Delete node

    instead of deleting, can't you just check if it already exists, and skip the creation if it already does?
  13. Python: Delete node

    well that error suggests that you are deleting nodes by cooking things I can understand if you write a shelf tool in python to do something like that, or maybe a post-render script in a ROP node, but I'm really curious what kind of thing you want to achieve with this, as it indeed sounds like something that is not without risk
  14. Evenly spaced Z points in position Noise VOP?

    setting one of the components to 0, with a setcomponent vop
  15. Evenly spaced Z points in position Noise VOP?

    what you could try, is flattening the position (make the z position 0) before feeding it into the aanoise, if you want to make the noise more "2D"
  16. Vex anoise

    when you have vex functions that can output different types, its always a good idea to cast them directly for example, if you want a random greyscale color, based on the position: v@Cd = float(rand(v@P)); // this will cast it back to a vector in the end, with the same value for all components. v@Cd = rand(v@P); // this will cast it back to a vector in the end, but with different values for the components.
  17. Scatter points on edges?

    Hey! if you unroll the geometry (with a primitive SOP for example), you may be able to do it. Otherwise after unrolling, you can remove the rest of the geometry with a dissolve sop.
  18. += in setpointattrib?

    The overblown color, is what you get when you go above 1 with your color, so your addition probably works fine, its just that multiple points may be adding to the same target point.
  19. From 9 primitives to 1 primitive

    That kinda depends on what the input primitives are. There's many different ones that can do it: for triangles: *divide sop, with the triangulation disabled, and remove shared edges enabled *Or similarily have a edge group with a dissolve sop for poly lines: *add sop, with remove primitives, and then recreate it in the other tab *polypath *join (if the vertices are pre-sorted)
  20. You could suggest to this artist to put the tools made, on Orbolt too. There you can download any tool, in any kind of licence type, since that is Side-Effects, managed.
  21. Multiply vectors to a plane (Trigonometry questions)

    I'm quite fond of this function: http://www.sidefx.com/docs/houdini/vex/functions/planepointdistance.html pretty sure you would be able to use it in your case (not completely sure how it will operate at the corners, but on the straight bits I imagine it should work pretty well)
  22. 17.5 Launch Event Presentation

    Normally there's more available in indie than core (minus render resolution / profit cap) also if you are talking about PDG, they show demovideos of it in Unity, which would be an exact usecase for Houdini-Indie, so I would sure hope so (disclaimer: have yet to watch the video later today)
  23. Hey! Yup, they are like n-dimensional vector attributes. Binding with @, will generate the attribute for the output if it did not already exist, or read it if it does. One difference between using binding, and using attribute import, is that you can update the attribute throughout the code multiple times with binding. On the other hand, using for example the point() expression, will always fetch the value of the attribute of the input (and not the intermediate value)
  24. if you average the cross products of the vector of the edge directions of the corners: cross(normalize(pos1-pos2), {0,1,0}) and cross(normalize(pos0-pos1), {0,1,0}), you should have your vector (or the anti vector not sure from the top of my head)
  25. Yeah Konstatin's version is basically a worked out version of my ramblings. Forgot to note that the dot product of 2 vectors is equal to the cosine of the angle between those vectors, making the code kind of convenient @konstantin magnus Just realised you got this technique from the genius himself too (in the other thread)