python,numpy,concave,concave-hull

This is a very well known problem in image processing that can be solved using morphological operators. With that, you can use scipy's binary_fill_holes to fill the holes in your mask: >>> import numpy as np >>> from scipy.ndimage import binary_fill_holes >>> data = np.array([[1, 1, 1, 0, 0, 1,...

c#,wpf,computational-geometry,convex,concave-hull

I have implemented this algorithm via JavaScript, may be it will help you. There you can see function that transforms convex hull to concave hull. My implementation of the algorithm is not exactly the same as in the Paper, but it based on it. In my implementation I skipped localMaximumDistance...

javascript,algorithm,image-processing,convex-hull,concave-hull

Alpha shapes is defined by finding the delaunay triangulation of a set of points and then delete edges that exceed alpha. You need the delaunay triangulation but not the circles. It's also works with lines. To calculate the shape with JS you can use TopoJSON or try this answer:Calculate bounding...

javascript,arrays,node.js,concave-hull

Yes, that is exactly it, based on what I read. var j = [{x: 51.2, y: 34.3}, {x: 52.2, y: 37.3}]; console.log(j[0].x); // 51.2 ...