141 reputation
3
bio website reimers.dk
location
age
visits member for 3 years, 8 months
seen Sep 29 '12 at 15:17

Sep
14
awarded  Popular Question
Mar
25
comment Algorithm to find polygons enclosing points
Thanks for your answer, I've actually gone ahead and made a modified version of the k-means algorithm which clusters by max distance. I blogged about it here - reimers.dk/blogs/jacob_reimers_weblog/archive/2011/03/08/…
Feb
20
comment Algorithm to find polygons enclosing points
I don't know where the groups (islands) will be located, it will depend on the location of the points. So I am trying to find the smallest polygon that encloses the point locations. By move, I meant clustering points in a defined count of clusters as in the k-means clustering.
Feb
20
comment Algorithm to find polygons enclosing points
I don't think I was clear in my initial question. The point was that I don't know where the points are, but the will be in different distinct location, so I needed an algorithm to dynamically create clusters where the points are, not move them to defined areas. I modified the k-means clustering algorithm to search the data set for cluster centroids and then cluster.
Feb
19
awarded  Scholar
Feb
19
comment Algorithm to find polygons enclosing points
Thanks, I'll look into putting those two together.
Feb
19
accepted Algorithm to find polygons enclosing points
Feb
19
awarded  Student
Feb
19
asked Algorithm to find polygons enclosing points