[[Template core/front/profile/profileHeader is throwing an error. This theme may be out of date. Run the support tool in the AdminCP to restore the default theme.]]
Recent Profile Visitors
15,398 profile views
-
How to find the closest u-value on a curve intersecting a vector
petz replied to danvenn's topic in General Houdini Questions
well, in this case there is no smart analytical method i know about. what you could try to do is to interpolate a polynomial and solve for the given “chord” length. but i doubt it would be any faster than iteratively searching for the distance … -
How to find the closest u-value on a curve intersecting a vector
petz replied to danvenn's topic in General Houdini Questions
with high resolution geometry most probably yes, in the example i’ve posted above i guess not. however, if speed is important it might be best to skip the second wrangle at all and use copyToPoints instead. packing the geo beforehand might also give you some speed improvements (in both cases) ... -
How to find the closest u-value on a curve intersecting a vector
petz replied to danvenn's topic in General Houdini Questions
here’s another one without relying on an iterative approach geo_along_curve.hipnc -
hey, sorry for my late reply, i didn't check the forum for quite a while … you're right, instead of rotating the prim i did project its points onto the plane given by P (prim centroid) and N (prim normal). this way you don’t have to worry about adjusting size due to the rotation. hth. petz
-
not quite sure if that’s what you are after but please take a look at the attached file: rotate_prim.hiplc
-
please take a look at the attached file. one example is using primuvconvert() to cut by distance the other is using an attribute. i didn’t do much testing but it should be relatively fast. hth. petz cut_curve.hipnc
-
Boolean subtract geometry from curves?
petz replied to Ellyfish's topic in General Houdini Questions
thanks, you're welcome! -
isn't doing dissolveFlatEdges a completely different thing, or did i misunderstood the original question? if you'd like to just remove “flat edges” you could also use cusp polygons in a facet sop followed by a divide sop. it might also be faster ...
-
there's also the primuvconvert() function in vex which can be used to carve/cut curves by absolute length.
-
here's another one. it's not extensively tested but should work quite well. hth. petz clean_geo.hipnc
-
did you have a look at the file i've attached above? it doesn't use loops but ad hoc groups in the xyzdist() function as well as a max search radius to speed up the search. even though xyzdist() is slower when using groups it shouldn't take ages for 100000 lines ...
-
you can exclude the current prim in the xyzdist() function by using groups. i've attached an example. hth. petz xyzdist_1.hipnc
-
Add points at given relative length on a curve, then split the curve
petz replied to AntoineSfx's topic in Modeling
it's easy, just reference the original geo. split_curve1.hipnc hth. petz -
Add points at given relative length on a curve, then split the curve
petz replied to AntoineSfx's topic in Modeling
here's another one: split_curve.hipnc -
Fitting a mesh between curves / Bilinear interpolation?
petz replied to konstantin magnus's topic in Scripting
the attached file shoud do the trick. hth. petz blerp_1.hiplc
