What I need to do is divide a group of geographic points into <n>
clusters such that the convex hulls of each cluster do not overlap.
Each cluster would have approximately the same number of points, and the
perimeter of each cluster would be minimized.
This is the Traveling Salesman Problem, only there are <n> salesmen.
The problem is how to determine the "territory" for each salesman in
order to minimize travel costs.
Thanks
Stephen Woodbridge wrote:
Michael Welter wrote:
Is there an algorithm to divide a group of points into <n> distinct
groups?
A locus is a set of points satisfying a certain condition.
So what are you conditions?
There are a lot of ways an arbitrary grouping can be made from a larger
set. What should determine if any given point should belong to group 1
or 2 or N?
It is hard to solve a problem that is under defined, unless one makes up
arbitrary constraints to satisfy the problem.
-Steve W.
_______________________________________________
postgis-users mailing list
[email protected]
http://postgis.refractions.net/mailman/listinfo/postgis-users
--
Michael Welter
Telecom Matters Corp.
Denver, Colorado US
+1.303.414.4980
[EMAIL PROTECTED]
www.TelecomMatters.net
_______________________________________________
postgis-users mailing list
[email protected]
http://postgis.refractions.net/mailman/listinfo/postgis-users
