-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathgeodna.js
More file actions
332 lines (285 loc) · 10.7 KB
/
geodna.js
File metadata and controls
332 lines (285 loc) · 10.7 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
// ---------------------------------------------------
// geodna.js - (C) KD 2012
// ---------------------------------------------------
// Converts between lat/lon and a "geodna" code,
// which is a single string representing a point
// on the earth's surface. The string is basically
// an approximation to the lat/lon coordinate,
// and the longer the string, the more accurate it
// will be. In general, coordinates that are
// close together will share a string prefix,
// making these codes very useful for providing
// very fast proximity searching using only
// text-based approaches (eg. SQL's "LIKE" operator)
// ---------------------------------------------------
// http://www.geodna.org
// ---------------------------------------------------
var VERSION = "0.4";
var RADIUS_OF_EARTH = 6378100;
var ALPHABET = [ "g", "a", "t", "c", ];
var DECODE_MAP = {
g: 0,
a: 1,
t: 2,
c: 3,
};
// Helper functions used by GeoDNA functions
function _deg2rad ( degrees ) {
return degrees * ( Math.PI / 180 );
}
function _rad2deg ( radians ) {
return radians * ( 180 / Math.PI );
}
function _mod ( x, m) {
return ( x % m + m ) % m;
}
GeoDNA = {
encode: function( latitude, longitude, options ) {
options = options || {};
var precision = options['precision'] || 22;
var geodna = '';
var loni = [];
var lati = [];
if ( options['radians'] ) {
latitude = _rad2deg( latitude );
longitude = _rad2deg( longitude );
}
var bits = GeoDNA.normalise( latitude, longitude );
latitude = bits[0];
longitude = bits[1];
if ( longitude < 0 ) {
geodna = geodna + 'w';
loni = [ -180.0, 0.0 ];
} else {
geodna = geodna + 'e';
loni = [ 0.0, 180.0 ];
}
lati = [ -90.0, 90.0 ];
while ( geodna.length < precision ) {
var ch = 0;
var mid = ( loni[0] + loni[1] ) / 2.0;
if ( longitude > mid ) {
ch = ch | 2;
loni = [ mid, loni[1] ];
} else {
loni = [ loni[0], mid ];
}
mid = ( lati[0] + lati[1] ) / 2.0;
if ( latitude > mid ) {
ch = ch | 1;
lati = [ mid, lati[1] ];
} else {
lati = [ lati[0], mid ];
}
geodna = geodna + ALPHABET[ch];
}
return geodna;
},
decode: function ( geodna, options ) {
options = options || {};
var bits = GeoDNA.boundingBox( geodna );
var lati = bits[0];
var loni = bits[1];
var lat = ( lati[0] + lati[1] ) / 2.0;
var lon = ( loni[0] + loni[1] ) / 2.0;
if ( options['radians'] ) {
return [ _deg2rad( lat ), _deg2rad( lon ) ];
}
return [ lat, lon ];
},
// locates the min/max lat/lons around the geo_dna
boundingBox: function ( geodna ) {
var chars = geodna.split(new RegExp(''));
var loni;
var lati = [ -90.0, 90.0 ];
var first = chars[0];
if ( first == 'w' ) {
loni = [ -180.0, 0.0 ];
} else if ( first == 'e' ) {
loni = [ 0.0, 180.0 ];
}
for ( var i = 1; i < chars.length; i++ ) {
var c = chars[i];
var cd = DECODE_MAP[c];
if ( cd & 2 ) {
loni = [ ( loni[0] + loni[1] ) / 2.0, loni[1] ];
} else {
loni = [ loni[0], ( loni[0] + loni[1] ) / 2.0 ];
}
if ( cd & 1 ) {
lati = [ ( lati[0] + lati[1] ) / 2.0, lati[1] ];
} else {
lati = [ lati[0], ( lati[0] + lati[1] ) / 2.0 ];
}
}
return [ lati, loni ];
},
addVector: function ( geodna, dy, dx ) {
var bits = GeoDNA.decode( geodna );
var lat = bits[0];
var lon = bits[1];
return [
_mod(( lat + 90.0 + dy ), 180.0 ) - 90.0,
_mod(( lon + 180.0 + dx ), 360.0 ) - 180.0
];
},
normalise: function( lat, lon ) {
return [
_mod(( lat + 90.0 ), 180.0 ) - 90.0,
_mod(( lon + 180.0 ), 360.0 ) - 180.0,
];
},
pointFromPointBearingAndDistance: function ( geodna, bearing, distance, options ) {
options = options || {};
var distance = distance * 1000; // make it metres instead of kilometres
var precision = options['precision'] || geodna.length;
var bits = GeoDNA.decode( geodna, { radians: true } );
var lat1 = bits[0];
var lon1 = bits[1];
var lat2 = Math.asin( Math.sin( lat1 ) * Math.cos( distance / RADIUS_OF_EARTH ) +
Math.cos( lat1 ) * Math.sin( distance / RADIUS_OF_EARTH ) * Math.cos( bearing ) );
var lon2 = lon1 + Math.atan2( Math.sin( bearing ) * Math.sin( distance / RADIUS_OF_EARTH ) * Math.cos( lat1 ),
Math.cos( distance / RADIUS_OF_EARTH ) - Math.sin( lat1 ) * Math.sin( lat2 ));
return GeoDNA.encode( lat2, lon2, { precision: precision, radians: true } );
},
distanceInKm: function( ga, gb ) {
var a = GeoDNA.decode( ga );
var b = GeoDNA.decode( gb );
// if a[1] and b[1] have different signs, we need to translate
// everything a bit in order for the formulae to work.
if ( a[1] * b[1] < 0.0 && Math.abs( a[1] - b[1] ) > 180.0 ) {
a = GeoDNA.addVector( ga, 0.0, 180.0 );
b = GeoDNA.addVector( gb, 0.0, 180.0 );
}
var x = ( _deg2rad(b[1]) - _deg2rad(a[1]) ) * Math.cos( ( _deg2rad(a[0]) + _deg2rad(b[0])) / 2 );
var y = ( _deg2rad(b[0]) - _deg2rad(a[0]) );
var d = Math.sqrt( x*x + y*y ) * RADIUS_OF_EARTH;
return d / 1000;
},
neighbours: function ( geodna ) {
var bits = GeoDNA.boundingBox( geodna );
var lati = bits[0];
var loni = bits[1];
var width = Math.abs( loni[1] - loni[0] );
var height = Math.abs( lati[1] - lati[0] );
var neighbours = [];
for (var i = -1; i <= 1; i++ ) {
for ( var j = -1; j <= 1; j++ ) {
if ( i || j ) {
var bits = GeoDNA.addVector ( geodna, height * i, width * j );
neighbours[neighbours.length] = GeoDNA.encode( bits[0], bits[1], { precision: geodna.length } );
}
}
}
return neighbours;
},
// This is experimental!!
// Totally unoptimised - use at your peril!
neighboursWithinRadius: function ( geodna, radius, options) {
options = options || {};
options.precision = options['precision'] || 12;
var neighbours = [];
var rh = radius * Math.SQRT2;
var start = GeoDNA.pointFromPointBearingAndDistance( geodna, -( Math.PI / 4 ), rh, options );
var end = GeoDNA.pointFromPointBearingAndDistance( geodna, Math.PI / 4, rh, options );
var bbox = GeoDNA.boundingBox( start );
var bits = GeoDNA.decode( start );
var slon = bits[1];
bits = GeoDNA.decode( end );
var elon = bits[1];
var dheight = Math.abs( bbox[0][1] - bbox[0][0] );
var dwidth = Math.abs( bbox[1][1] - bbox[1][0] );
var n = GeoDNA.normalise( 0.0, Math.abs( elon - slon ) );
var delta = Math.abs(n[1]);
var tlat = 0.0;
var tlon = 0.0;
var current = start;
while ( tlat <= delta ) {
while ( tlon <= delta ) {
var cbits = GeoDNA.addVector( current, 0.0, dwidth );
current = GeoDNA.encode( cbits[0], cbits[1], options );
var d = GeoDNA.distanceInKm( current, geodna );
if ( d <= radius ) {
neighbours[neighbours.length] = current;
}
tlon = tlon + dwidth;
}
tlat = tlat + dheight;
var bits = GeoDNA.addVector( start, -tlat , 0.0 );
current = GeoDNA.encode( bits[0], bits[1], options );
tlon = 0.0;
}
return neighbours;
},
// This takes an array of GeoDNA codes and reduces it to its
// minimal set of codes covering the same area.
// Needs a more optimal impl.
reduce: function( geodna_codes ) {
// hash all the codes
var codes = {};
for (var i = 0; i < geodna_codes.length; i++ ) {
codes[ geodna_codes[i] ] = 1;
}
var reduced = [];
var code;
for (var i = 0; i < geodna_codes.length; i++ ) {
code = geodna_codes[i];
if ( codes[ code ] ) {
var parent = code.substr( 0, code.length - 1 );
if ( codes [ parent + 'a' ]
&& codes [ parent + 't' ]
&& codes [ parent + 'g' ]
&& codes [ parent + 'c' ]) {
codes[ parent + 'a' ] = null;
codes[ parent + 't' ] = null;
codes[ parent + 'g' ] = null;
codes[ parent + 'c' ] = null;
reduced.push( parent );
} else {
reduced.push( code );
}
}
}
if ( geodna_codes.length == reduced.length ) {
return reduced;
}
return GeoDNA.reduce( reduced );
},
// ********************************
// Google Maps support functions
// ********************************
encodeGoogleLatLng: function( latlng, options ) {
options = options || {};
var lat = latlng.lat();
var lon = latlng.lng();
return GeoDNA.encode( lat, lon, options );
},
decodeGoogleLatLng: function( geodna ) {
var bits = GeoDNA.decode( geodna );
return new google.maps.LatLng( bits[0], bits[1] );
},
boundingBoxPolygon: function( geodna, options ) {
options = options || {};
var bbox = GeoDNA.boundingBox( geodna );
var vertices = [
new google.maps.LatLng( bbox[0][0], bbox[1][0] ),
new google.maps.LatLng( bbox[0][0], bbox[1][1] ),
new google.maps.LatLng( bbox[0][1], bbox[1][1] ),
new google.maps.LatLng( bbox[0][1], bbox[1][0] )
];
options['paths'] = vertices;
return new google.maps.Polygon( options );
},
map: function( geodna, element, options ) {
options = options || {};
var mapOptions = {
center: GeoDNA.decodeGoogleLatLng( geodna ),
mapTypeId: google.maps.MapTypeId.ROADMAP
};
for (var key in options) {
mapOptions[key] = options[key];
}
var map = new google.maps.Map(element, mapOptions);
return map;
}
};