|
|
 |
Java postcode algorithm
posted on 30/8/2003
I require a java algoritm that will take a district level postcode (e.g RG12) and find all other district postcodes within a provided distance, e.g 1km, 5km.
If performance is an issue for dynamic calculation then all UK district post codes would need to be stored in a mysql table with further columns of say 1km (concatenated list of all district postcodes within 1km radius), 5km, etc. In this instance the java algorithm would just loop through the first column and populate the other columns using the algorithm on a single occasion.
The accuracy only needs to be 'as the crow flies' not take into account curvature of earth, street routes, etc.
Please reply with estimate of cost & timescale.
We are no longer accepting applications for this project.Back to Project List
|
|
