magneto Posted January 10, 2016 Share Posted January 10, 2016 Hi, Which one is better and faster? I like pcfind as it feels nicer to use but you don't get some of the functionality found in pcopen such as "free" "point.distance" since it's already calculated in both anyway I imagine. Which one do you prefer using and why? Thanks Quote Link to comment Share on other sites More sharing options...
amm Posted January 10, 2016 Share Posted January 10, 2016 (edited) Pcfind returns an array, [] , while limits like radius and max number are still here. Can't say about speed comarison. Anyway it works just fine, let's say for bind export, and calling the attribute later. Find closest points before some deformation, do an average of positions after deformation, so on. Edited January 10, 2016 by amm 1 Quote Link to comment Share on other sites More sharing options...
fathom Posted January 11, 2016 Share Posted January 11, 2016 i'm used to pcopen, so that's what i use. the pcopen method seems like the "old" method tho. pcfind's syntax hasn't sunk in yet, but i should probably start using that since it opens up the ability to use pcfind_radius() which has no pcopen equivalent. it'd be interesting to see if there's any difference in speed. it's not hard at all to make pcopen crawl, so finding a test case would be trivial. 1 Quote Link to comment Share on other sites More sharing options...
magneto Posted January 19, 2016 Author Share Posted January 19, 2016 I did a speed test and when I didn't use the results pcfind was super fast which was suspicious, but after I save the number of elements found in an attribute, pcfind was about 15% slower than pcopen. Nothing unusual. pcfind is nicer to use but pcopen has a few nice functions like pcfilter that gives you a nice averaging of attribute values. It's not as easy to do for pcfind as you have to do it for many attribute types yourself. What about pgfind? Anyone used it before? 1 Quote Link to comment Share on other sites More sharing options...
fathom Posted January 19, 2016 Share Posted January 19, 2016 15%... interesting. wonder if that's the overhead of allocating arrays or something. good to know. Quote Link to comment Share on other sites More sharing options...
DaleL Posted May 22, 2023 Share Posted May 22, 2023 Just in case anyone is coming across this after some years: pcfind is appx twice as fast. It uses a different type of search (BVK vs kd-tree), which divides the search area quicker. pcfind doesn't have pcfilter, but if you want the speed you can implement that with not too much trouble. Pragmaticvfx explains it well in the first few videos. Quote Link to comment Share on other sites More sharing options...
Recommended Posts
Join the conversation
You can post now and register later. If you have an account, sign in now to post with your account.
Note: Your post will require moderator approval before it will be visible.