Jump to content

petz

Members
  • Posts

    373
  • Joined

  • Last visited

  • Days Won

    50

petz last won the day on October 27 2021

petz had the most liked content!

Personal Information

  • Name
    petz

Recent Profile Visitors

15,578 profile views

petz's Achievements

Newbie

Newbie (1/14)

  • Week One Done Rare
  • One Month Later Rare
  • One Year In Rare

Recent Badges

449

Reputation

  1. 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 …
  2. 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) ...
  3. here’s another one without relying on an iterative approach geo_along_curve.hipnc
  4. 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
  5. not quite sure if that’s what you are after but please take a look at the attached file: rotate_prim.hiplc
  6. 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
  7. 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 ...
  8. there's also the primuvconvert() function in vex which can be used to carve/cut curves by absolute length.
  9. here's another one. it's not extensively tested but should work quite well. hth. petz clean_geo.hipnc
  10. 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 ...
  11. you can exclude the current prim in the xyzdist() function by using groups. i've attached an example. hth. petz xyzdist_1.hipnc
  12. it's easy, just reference the original geo. split_curve1.hipnc hth. petz
  13. the attached file shoud do the trick. hth. petz blerp_1.hiplc
×
×
  • Create New...