[Xastir] Off Topic: Method to deterrmine location of N minimum points from a dataset
Sorry for the off topic, but I am not sure where to start and I figured some of you folks probably know.. Any suggestions on what I should search on? I want a method to calculate the locations of N points from a dataset of locations that has a minimum cumulative distance. That, what are the locations of a given number of Basepoints so that the distance from the dataset to one of he basepoints is minimized. Specifically, if I have a set of all the locations in a service area and I want to know where to place service providers in the dataset, were should I put them if I have two service providers, where should I put them if I have three providers, etc. I am sure I did this as a home work problem long ago in a computer programming class, but I can't seem to come up with a simple means of doing it. I am betting the method is detailed out there somewhere, but I can't find the correct search parameters. Please send any suggestions to me at jim at RiverRidge-WI dot net Thanks all jt ___ Xastir mailing list Xastir@lists.xastir.org http://lists.xastir.org/cgi-bin/mailman/listinfo/xastir
Re: [Xastir] Off Topic: Method to deterrmine location of N minimum points from a dataset
You're looking to solve the centroid problem. Your locations describe a polygon and you want the centroid of that. A few Google searches on calculating centroids should lead you the right way. --- On Mon, 1/18/10, Jim Tolbert j...@riverridge-wi.net wrote: From: Jim Tolbert j...@riverridge-wi.net Subject: [Xastir] Off Topic: Method to deterrmine location of N minimum points from a dataset To: XASTIR xas...@xastir.org Date: Monday, January 18, 2010, 8:05 PM Sorry for the off topic, but I am not sure where to start and I figured some of you folks probably know.. Any suggestions on what I should search on? I want a method to calculate the locations of N points from a dataset of locations that has a minimum cumulative distance. That, what are the locations of a given number of Basepoints so that the distance from the dataset to one of he basepoints is minimized. Specifically, if I have a set of all the locations in a service area and I want to know where to place service providers in the dataset, were should I put them if I have two service providers, where should I put them if I have three providers, etc. I am sure I did this as a home work problem long ago in a computer programming class, but I can't seem to come up with a simple means of doing it. I am betting the method is detailed out there somewhere, but I can't find the correct search parameters. Please send any suggestions to me at jim at RiverRidge-WI dot net Thanks all jt ___ Xastir mailing list Xastir@lists.xastir.org http://lists.xastir.org/cgi-bin/mailman/listinfo/xastir ___ Xastir mailing list Xastir@lists.xastir.org http://lists.xastir.org/cgi-bin/mailman/listinfo/xastir
Re: [Xastir] Off Topic: Method to deterrmine location of N minimum points from a dataset
Thanks much Alex. I am off... as it were grin. G'Night... jt Alex Carver wrote: You're looking to solve the centroid problem. Your locations describe a polygon and you want the centroid of that. A few Google searches on calculating centroids should lead you the right way. --- On Mon, 1/18/10, Jim Tolbert j...@riverridge-wi.net wrote: From: Jim Tolbert j...@riverridge-wi.net Subject: [Xastir] Off Topic: Method to deterrmine location of N minimum points from a dataset To: XASTIR xas...@xastir.org Date: Monday, January 18, 2010, 8:05 PM Sorry for the off topic, but I am not sure where to start and I figured some of you folks probably know.. Any suggestions on what I should search on? I want a method to calculate the locations of N points from a dataset of locations that has a minimum cumulative distance. That, what are the locations of a given number of Basepoints so that the distance from the dataset to one of he basepoints is minimized. Specifically, if I have a set of all the locations in a service area and I want to know where to place service providers in the dataset, were should I put them if I have two service providers, where should I put them if I have three providers, etc. I am sure I did this as a home work problem long ago in a computer programming class, but I can't seem to come up with a simple means of doing it. I am betting the method is detailed out there somewhere, but I can't find the correct search parameters. Please send any suggestions to me at jim at RiverRidge-WI dot net Thanks all jt ___ Xastir mailing list Xastir@lists.xastir.org http://lists.xastir.org/cgi-bin/mailman/listinfo/xastir ___ Xastir mailing list Xastir@lists.xastir.org http://lists.xastir.org/cgi-bin/mailman/listinfo/xastir ___ Xastir mailing list Xastir@lists.xastir.org http://lists.xastir.org/cgi-bin/mailman/listinfo/xastir
Re: [Xastir] Off Topic: Method to deterrmine location of N minimum points from a dataset
I use Manifold GIS (www.manifold.net) it has features call find nearest service centers and such. You can see their help manual on line. Great video training series for the software can be found at www.gisadvisor.com Thank You, Brian N2KGC -Original Message- From: xastir-boun...@lists.xastir.org [mailto:xastir-boun...@lists.xastir.org]on Behalf Of Jim Tolbert Sent: Monday, January 18, 2010 8:05 PM To: XASTIR Subject: [Xastir] Off Topic: Method to deterrmine location of N minimum points from a dataset Sorry for the off topic, but I am not sure where to start and I figured some of you folks probably know.. Any suggestions on what I should search on? I want a method to calculate the locations of N points from a dataset of locations that has a minimum cumulative distance. That, what are the locations of a given number of Basepoints so that the distance from the dataset to one of he basepoints is minimized. Specifically, if I have a set of all the locations in a service area and I want to know where to place service providers in the dataset, were should I put them if I have two service providers, where should I put them if I have three providers, etc. I am sure I did this as a home work problem long ago in a computer programming class, but I can't seem to come up with a simple means of doing it. I am betting the method is detailed out there somewhere, but I can't find the correct search parameters. Please send any suggestions to me at jim at RiverRidge-WI dot net Thanks all jt ___ Xastir mailing list Xastir@lists.xastir.org http://lists.xastir.org/cgi-bin/mailman/listinfo/xastir ___ Xastir mailing list Xastir@lists.xastir.org http://lists.xastir.org/cgi-bin/mailman/listinfo/xastir
