You can attempt to use a BallPivot algo (but if the pts distribution is “not even” (or not “skin deep”) don’t expect very good results - if any at all). Of course contemporary BP is not the thing as invented by IBM Labs years ago … but I doupt that you can find source code that works (and is fast).
That said I have C# stuff that does 3d convex tri meshes (given any collection of points be these “evenly” spread or not: the recursive technique for that shares some points with the classic 2d convex hull algos). It would require major changes and/or several lines of code more in order to make - fast - a 3d concave mesh .
@PeterFotiadis no, haven’t tried any 2d concave hulls. Any widely accepted method?
@laurent_delrieu it’s a laser scan cloud. So they are on a surface of a volumetric form let’s say. Can you upload an alpha-shape definition so I can try with this?
I tried Rhino’s mesh from points. This is the best result so far. However there are two numerical entries which I’m not sure how to automate the knowing what values to insert (in case I manage to call it inside gh through a script). And also the results are not fully satisfactory. I get some holes as you can see in the image.
@Mesrop alpha shape won’t work in this case it would have to have some sort of depth and fairly uniform sample distribution otherwise the output will be unusable I wonder if marching cubes wouldn’t do the job here.
If your collection is “uniform” (and skin deep) a proper Ball Pivot is worth trying: but the quality of the algo is everything: see 10K points (in the usual very slow I5 for testing performance) in auto R mode [yields a closed Mesh] and in user value R mode [yields a List of Meshes and - obviously - some missed stuff]:
Hi Again @PeterFotiadis, sorry to bother again on this matter. Could you share some working definition or component for this? Something that will not expect C# from me, please
Well … it’s most unlikely that you could do anything on that matter without C# (and a well scheduled // approach). Is also unlikely that a similar def would be available to public eyes (i.e. not classified).