4
votes
1answer
113 views

How to grow several concave hulls until they completely fill a larger area without overlap?

This is my problem: I have a very large point layer with polling station locations across one country; each point belongs to a specific constituency (900k points, 4k constituencies). I wish to use ...
2
votes
2answers
253 views

Is it possible to get the points used for the convex hull in osm2po?

I have a non-convex hull algorithm that I want to use for an app. With OSM2PO, it's possible to get a convexHull, but is there a way to get the points before the hull is constructed? More, it would ...
1
vote
0answers
190 views

How can I use Convex Hull to select an area with a space from the points?

This refer to this post : Read Here My goal is to select an area covering some points, but maintaining some space from points of border, like in the follow picture : I think ST_Convexhull will do ...
7
votes
5answers
2k views

Algorithm to find polygons enclosing points

I'm trying to find an algorithm that can determine the smallest possible polygons to cover a number of points. I know how to get the convex hull around all the points, but say that the points are ...
58
votes
15answers
19k views

What are Definition, Algorithms and Practical Solutions for Concave Hull?

Convex Hull A convex hull of a shape is defined as: In mathematics, the convex hull or convex envelope for a set of points X in a real vector space V is the minimal convex set containing X ...