|
0
|
1 /*
|
|
|
2 * Binning.js
|
|
|
3 *
|
|
|
4 * Copyright (c) 2012, Stefan Jänicke. All rights reserved.
|
|
|
5 *
|
|
|
6 * This library is free software; you can redistribute it and/or
|
|
|
7 * modify it under the terms of the GNU Lesser General Public
|
|
|
8 * License as published by the Free Software Foundation; either
|
|
|
9 * version 3 of the License, or (at your option) any later version.
|
|
|
10 *
|
|
|
11 * This library is distributed in the hope that it will be useful,
|
|
|
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
|
|
14 * Lesser General Public License for more details.
|
|
|
15 *
|
|
|
16 * You should have received a copy of the GNU Lesser General Public
|
|
|
17 * License along with this library; if not, write to the Free Software
|
|
|
18 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston,
|
|
|
19 * MA 02110-1301 USA
|
|
|
20 */
|
|
|
21
|
|
|
22 /**
|
|
|
23 * @class Binning
|
|
|
24 * Calculates map aggregation with several binning algorithms
|
|
|
25 * @author Stefan Jänicke (stjaenicke@informatik.uni-leipzig.de)
|
|
|
26 * @release 1.0
|
|
|
27 * @release date: 2012-07-27
|
|
|
28 * @version date: 2012-07-27
|
|
|
29 */
|
|
|
30 Binning = function(map, options) {
|
|
|
31
|
|
|
32 this.map = map;
|
|
|
33 this.options = options;
|
|
|
34 this.reset();
|
|
|
35
|
|
|
36 };
|
|
|
37
|
|
|
38 Binning.prototype = {
|
|
|
39
|
|
|
40 getSet : function() {
|
|
|
41 var type = this.options.binning;
|
|
|
42 if (!type) {
|
|
|
43 return this.getExactBinning();
|
|
|
44 } else if (type == 'generic') {
|
|
|
45 return this.getGenericBinning();
|
|
|
46 } else if (type == 'square') {
|
|
|
47 return this.getSquareBinning();
|
|
|
48 } else if (type == 'hexagonal') {
|
|
|
49 return this.getHexagonalBinning();
|
|
|
50 } else if (type == 'triangular') {
|
|
|
51 return this.getTriangularBinning();
|
|
|
52 }
|
|
|
53 },
|
|
|
54
|
|
|
55 getExactBinning : function() {
|
|
|
56 if ( typeof this.binnings['exact'] == 'undefined') {
|
|
|
57 this.exactBinning();
|
|
|
58 }
|
|
|
59 return this.binnings['exact'];
|
|
|
60 },
|
|
|
61
|
|
|
62 getGenericBinning : function() {
|
|
|
63 if ( typeof this.binnings['generic'] == 'undefined') {
|
|
|
64 this.genericBinning();
|
|
|
65 }
|
|
|
66 return this.binnings['generic'];
|
|
|
67 },
|
|
|
68
|
|
|
69 getSquareBinning : function() {
|
|
|
70 if ( typeof this.binnings['square'] == 'undefined') {
|
|
|
71 this.squareBinning();
|
|
|
72 }
|
|
|
73 return this.binnings['square'];
|
|
|
74 },
|
|
|
75
|
|
|
76 getHexagonalBinning : function() {
|
|
|
77 if ( typeof this.binnings['hexagonal'] == 'undefined') {
|
|
|
78 this.hexagonalBinning();
|
|
|
79 }
|
|
|
80 return this.binnings['hexagonal'];
|
|
|
81 },
|
|
|
82
|
|
|
83 getTriangularBinning : function() {
|
|
|
84 if ( typeof this.binnings['triangular'] == 'undefined') {
|
|
|
85 this.triangularBinning();
|
|
|
86 }
|
|
|
87 return this.binnings['triangular'];
|
|
|
88 },
|
|
|
89
|
|
|
90 reset : function() {
|
|
|
91 this.zoomLevels = this.map.getNumZoomLevels();
|
|
|
92 this.binnings = [];
|
|
|
93 this.minimumRadius = this.options.minimumRadius;
|
|
|
94 this.maximumRadius = this.minimumRadius;
|
|
|
95 this.maximumPoints = 0;
|
|
|
96 this.minArea = 0;
|
|
|
97 this.maxArea = 0;
|
|
|
98 },
|
|
|
99
|
|
|
100 getMaxRadius : function(size) {
|
|
|
101 return 4 * Math.log(size) / Math.log(2);
|
|
|
102 },
|
|
|
103
|
|
|
104 setObjects : function(objects) {
|
|
|
105 this.objects = objects;
|
|
|
106 for (var i = 0; i < this.objects.length; i++) {
|
|
|
107 var weight = 0;
|
|
|
108 for (var j = 0; j < this.objects[i].length; j++) {
|
|
|
109 if (this.objects[i][j].isGeospatial) {
|
|
|
110 weight += this.objects[i][j].weight;
|
|
|
111 }
|
|
|
112 }
|
|
|
113 var r = this.getMaxRadius(weight);
|
|
|
114 if (r > this.maximumRadius) {
|
|
|
115 this.maximumRadius = r;
|
|
|
116 this.maximumPoints = weight;
|
|
|
117 this.maxArea = Math.PI * this.maximumRadius * this.maximumRadius;
|
|
|
118 this.minArea = Math.PI * this.minimumRadius * this.minimumRadius;
|
|
|
119 }
|
|
|
120 }
|
|
|
121 },
|
|
|
122
|
|
|
123 dist : function(x1, y1, x2, y2) {
|
|
|
124 return Math.sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2));
|
|
|
125 },
|
|
|
126
|
|
|
127 exactBinning : function() {
|
|
|
128 var circleSets = [];
|
|
|
129 var hashMaps = [];
|
|
|
130 var selectionHashs = [];
|
|
|
131
|
|
|
132 var circleAggregates = [];
|
|
|
133 var bins = [];
|
|
|
134 for (var i = 0; i < this.objects.length; i++) {
|
|
|
135 bins.push([]);
|
|
|
136 circleAggregates.push([]);
|
|
|
137 for (var j = 0; j < this.objects[i].length; j++) {
|
|
|
138 var o = this.objects[i][j];
|
|
|
139 if (o.isGeospatial) {
|
|
|
140 if ( typeof circleAggregates[i]['' + o.getLongitude(this.options.mapIndex)] == 'undefined') {
|
|
|
141 circleAggregates[i]['' + o.getLongitude(this.options.mapIndex)] = [];
|
|
|
142 }
|
|
|
143 if ( typeof circleAggregates[i][''+o.getLongitude(this.options.mapIndex)]['' + o.getLatitude(this.options.mapIndex)] == 'undefined') {
|
|
|
144 circleAggregates[i][''+o.getLongitude(this.options.mapIndex)]['' + o.getLatitude(this.options.mapIndex)] = [];
|
|
|
145 bins[i].push(circleAggregates[i][''+o.getLongitude(this.options.mapIndex)]['' + o.getLatitude(this.options.mapIndex)]);
|
|
|
146 }
|
|
|
147 circleAggregates[i][''+o.getLongitude(this.options.mapIndex)]['' + o.getLatitude(this.options.mapIndex)].push(o);
|
|
|
148 }
|
|
|
149 }
|
|
|
150 }
|
|
|
151
|
|
|
152 var circles = [];
|
|
|
153 var hashMap = [];
|
|
|
154 var selectionMap = [];
|
|
|
155 for (var i = 0; i < bins.length; i++) {
|
|
|
156 circles.push([]);
|
|
|
157 hashMap.push([]);
|
|
|
158 selectionMap.push([]);
|
|
|
159 for (var j = 0; j < bins[i].length; j++) {
|
|
|
160 var bin = bins[i][j];
|
|
|
161 var p = new OpenLayers.Geometry.Point(bin[0].getLongitude(this.options.mapIndex), bin[0].getLatitude(this.options.mapIndex), null);
|
|
|
162 p.transform(this.map.displayProjection, this.map.projection);
|
|
|
163 var weight = 0;
|
|
|
164 for (var z = 0; z < bin.length; z++) {
|
|
|
165 weight += bin[z].weight;
|
|
|
166 }
|
|
|
167 var radius = this.options.minimumRadius;
|
|
|
168 if (this.options.noBinningRadii == 'dynamic') {
|
|
|
169 radius = this.getRadius(weight);
|
|
|
170 }
|
|
|
171 var circle = new CircleObject(p.x, p.y, 0, 0, bin, radius, i, weight);
|
|
|
172 circles[i].push(circle);
|
|
|
173 for (var z = 0; z < bin.length; z++) {
|
|
|
174 hashMap[i][bin[z].index] = circle;
|
|
|
175 selectionMap[i][bin[z].index] = false;
|
|
|
176 }
|
|
|
177 }
|
|
|
178 }
|
|
|
179 for (var k = 0; k < this.zoomLevels; k++) {
|
|
|
180 circleSets.push(circles);
|
|
|
181 hashMaps.push(hashMap);
|
|
|
182 selectionHashs.push(selectionMap);
|
|
|
183 }
|
|
|
184 this.binnings['exact'] = {
|
|
|
185 circleSets : circleSets,
|
|
|
186 hashMaps : hashMaps,
|
|
|
187 selectionHashs : selectionHashs
|
|
|
188 };
|
|
|
189 },
|
|
|
190
|
|
|
191 genericClustering : function(objects, id) {
|
|
|
192 var binSets = [];
|
|
|
193 var circleSets = [];
|
|
|
194 var hashMaps = [];
|
|
|
195 var selectionHashs = [];
|
|
|
196 var clustering = new Clustering(-20037508.34, -20037508.34, 20037508.34, 20037508.34);
|
|
|
197 for (var i = 0; i < objects.length; i++) {
|
|
|
198 for (var j = 0; j < objects[i].length; j++) {
|
|
|
199 var o = objects[i][j];
|
|
|
200 if (o.isGeospatial) {
|
|
|
201 var p = new OpenLayers.Geometry.Point(o.getLongitude(this.options.mapIndex), o.getLatitude(this.options.mapIndex), null);
|
|
|
202 p.transform(this.map.displayProjection, this.map.projection);
|
|
|
203 var point = new Vertex(Math.floor(p.x), Math.floor(p.y), objects.length, this);
|
|
|
204 point.addElement(o, o.weight, i);
|
|
|
205 clustering.add(point);
|
|
|
206 }
|
|
|
207 }
|
|
|
208 }
|
|
|
209
|
|
|
210 for (var i = 0; i < this.zoomLevels; i++) {
|
|
|
211 var bins = [];
|
|
|
212 var circles = [];
|
|
|
213 var hashMap = [];
|
|
|
214 var selectionMap = [];
|
|
|
215 for (var j = 0; j < objects.length; j++) {
|
|
|
216 circles.push([]);
|
|
|
217 hashMap.push([]);
|
|
|
218 selectionMap.push([]);
|
|
|
219 }
|
|
|
220 var resolution = this.map.getResolutionForZoom(this.zoomLevels - i - 1);
|
|
|
221 clustering.mergeForResolution(resolution, this.options.circleGap, this.options.circleOverlap);
|
|
|
222 for (var j = 0; j < clustering.vertices.length; j++) {
|
|
|
223 var point = clustering.vertices[j];
|
|
|
224 if (!point.legal) {
|
|
|
225 continue;
|
|
|
226 }
|
|
|
227 var balls = [];
|
|
|
228 for (var k = 0; k < point.elements.length; k++) {
|
|
|
229 if (point.elements[k].length > 0) {
|
|
|
230 balls.push({
|
|
|
231 search : k,
|
|
|
232 elements : point.elements[k],
|
|
|
233 radius : point.radii[k],
|
|
|
234 weight : point.weights[k]
|
|
|
235 });
|
|
|
236 }
|
|
|
237 }
|
|
|
238 var orderBalls = function(b1, b2) {
|
|
|
239 if (b1.radius > b2.radius) {
|
|
|
240 return -1;
|
|
|
241 }
|
|
|
242 if (b2.radius > b1.radius) {
|
|
|
243 return 1;
|
|
|
244 }
|
|
|
245 return 0;
|
|
|
246 }
|
|
|
247 var fatherBin = {
|
|
|
248 circles : [],
|
|
|
249 length : 0,
|
|
|
250 radius : point.radius / resolution,
|
|
|
251 x : point.x,
|
|
|
252 y : point.y
|
|
|
253 };
|
|
|
254 for (var k = 0; k < objects.length; k++) {
|
|
|
255 fatherBin.circles.push(false);
|
|
|
256 }
|
|
|
257 var createCircle = function(sx, sy, ball) {
|
|
|
258 var index = id || ball.search;
|
|
|
259 var circle = new CircleObject(point.x, point.y, sx, sy, ball.elements, ball.radius, index, ball.weight, fatherBin);
|
|
|
260 circles[ball.search].push(circle);
|
|
|
261 fatherBin.circles[index] = circle;
|
|
|
262 fatherBin.length++;
|
|
|
263 for (var k = 0; k < ball.elements.length; k++) {
|
|
|
264 hashMap[ball.search][ball.elements[k].index] = circle;
|
|
|
265 selectionMap[ball.search][ball.elements[k].index] = false;
|
|
|
266 }
|
|
|
267 }
|
|
|
268 if (balls.length == 1) {
|
|
|
269 createCircle(0, 0, balls[0]);
|
|
|
270 } else if (balls.length == 2) {
|
|
|
271 var r1 = balls[0].radius;
|
|
|
272 var r2 = balls[1].radius;
|
|
|
273 createCircle(-1 * r2, 0, balls[0]);
|
|
|
274 createCircle(r1, 0, balls[1]);
|
|
|
275 } else if (balls.length == 3) {
|
|
|
276 balls.sort(orderBalls);
|
|
|
277 var r1 = balls[0].radius;
|
|
|
278 var r2 = balls[1].radius;
|
|
|
279 var r3 = balls[2].radius;
|
|
|
280 var d = ((2 / 3 * Math.sqrt(3) - 1) / 2) * r2;
|
|
|
281 var delta1 = point.radius / resolution - r1 - d;
|
|
|
282 var delta2 = r1 - delta1;
|
|
|
283 createCircle(-delta1, 0, balls[0]);
|
|
|
284 createCircle(delta2 + r2 - 3 * d, r2, balls[1]);
|
|
|
285 createCircle(delta2 + r2 - 3 * d, -1 * r3, balls[2]);
|
|
|
286 // createCircle(delta2 + r3 - (3 * d * r3 / r2), -1 * r3, balls[2]);
|
|
|
287 } else if (balls.length == 4) {
|
|
|
288 balls.sort(orderBalls);
|
|
|
289 var r1 = balls[0].radius;
|
|
|
290 var r2 = balls[1].radius;
|
|
|
291 var r3 = balls[2].radius;
|
|
|
292 var r4 = balls[3].radius;
|
|
|
293 var d = (Math.sqrt(2) - 1) * r2;
|
|
|
294 createCircle(-1 * d - r2, 0, balls[0]);
|
|
|
295 createCircle(r1 - r2, -1 * d - r4, balls[3]);
|
|
|
296 createCircle(r1 - r2, d + r3, balls[2]);
|
|
|
297 createCircle(d + r1, 0, balls[1]);
|
|
|
298 }
|
|
|
299 if (fatherBin.length > 1) {
|
|
|
300 bins.push(fatherBin);
|
|
|
301 }
|
|
|
302 }
|
|
|
303 circleSets.push(circles);
|
|
|
304 binSets.push(bins);
|
|
|
305 hashMaps.push(hashMap);
|
|
|
306 selectionHashs.push(selectionMap);
|
|
|
307 }
|
|
|
308 circleSets.reverse();
|
|
|
309 binSets.reverse();
|
|
|
310 hashMaps.reverse();
|
|
|
311 selectionHashs.reverse();
|
|
|
312 return {
|
|
|
313 circleSets : circleSets,
|
|
|
314 binSets : binSets,
|
|
|
315 hashMaps : hashMaps,
|
|
|
316 selectionHashs : selectionHashs
|
|
|
317 };
|
|
|
318 },
|
|
|
319
|
|
|
320 genericBinning : function() {
|
|
|
321 if (this.options.circlePackings || this.objects.length == 1) {
|
|
|
322 this.binnings['generic'] = this.genericClustering(this.objects);
|
|
|
323 } else {
|
|
|
324 var circleSets = [];
|
|
|
325 var hashMaps = [];
|
|
|
326 var selectionHashs = [];
|
|
|
327 for (var i = 0; i < this.objects.length; i++) {
|
|
|
328 var sets = this.genericClustering([this.objects[i]], i);
|
|
|
329 if (i == 0) {
|
|
|
330 circleSets = sets.circleSets;
|
|
|
331 hashMaps = sets.hashMaps;
|
|
|
332 selectionHashs = sets.selectionHashs;
|
|
|
333 } else {
|
|
|
334 for (var j = 0; j < circleSets.length; j++) {
|
|
|
335 circleSets[j] = circleSets[j].concat(sets.circleSets[j]);
|
|
|
336 hashMaps[j] = hashMaps[j].concat(sets.hashMaps[j]);
|
|
|
337 selectionHashs[j] = selectionHashs[j].concat(sets.selectionHashs[j]);
|
|
|
338 }
|
|
|
339 }
|
|
|
340 }
|
|
|
341 this.binnings['generic'] = {
|
|
|
342 circleSets : circleSets,
|
|
|
343 hashMaps : hashMaps,
|
|
|
344 selectionHashs : selectionHashs
|
|
|
345 };
|
|
|
346 }
|
|
|
347 },
|
|
|
348
|
|
|
349 getRadius : function(n) {
|
|
|
350 if (n == 0) {
|
|
|
351 return 0;
|
|
|
352 }
|
|
|
353 if (n == 1) {
|
|
|
354 return this.minimumRadius;
|
|
|
355 }
|
|
|
356 return Math.sqrt((this.minArea + (this.maxArea - this.minArea) / (this.maximumPoints - 1) * (n - 1) ) / Math.PI);
|
|
|
357 },
|
|
|
358
|
|
|
359 getBinRadius : function(n, r_max, N) {
|
|
|
360 if (n == 0) {
|
|
|
361 return 0;
|
|
|
362 }
|
|
|
363 /*
|
|
|
364 function log2(x) {
|
|
|
365 return (Math.log(x)) / (Math.log(2));
|
|
|
366 }
|
|
|
367 var r0 = this.options.minimumRadius;
|
|
|
368 var r;
|
|
|
369 if ( typeof r_max == 'undefined') {
|
|
|
370 return r0 + n / Math.sqrt(this.options.maximumPoints);
|
|
|
371 }
|
|
|
372 return r0 + (r_max - r0 ) * log2(n) / log2(N);
|
|
|
373 */
|
|
|
374 var minArea = Math.PI * this.options.minimumRadius * this.options.minimumRadius;
|
|
|
375 var maxArea = Math.PI * r_max * r_max;
|
|
|
376 return Math.sqrt((minArea + (maxArea - minArea) / (N - 1) * (n - 1) ) / Math.PI);
|
|
|
377 },
|
|
|
378
|
|
|
379 shift : function(type, bin, radius, elements) {
|
|
|
380
|
|
|
381 var x1 = bin.x, x2 = 0;
|
|
|
382 var y1 = bin.y, y2 = 0;
|
|
|
383 for (var i = 0; i < elements.length; i++) {
|
|
|
384 x2 += elements[i].x / elements.length;
|
|
|
385 y2 += elements[i].y / elements.length;
|
|
|
386 }
|
|
|
387
|
|
|
388 var sx = 0, sy = 0;
|
|
|
389
|
|
|
390 if (type == 'square') {
|
|
|
391 var dx = Math.abs(x2 - x1);
|
|
|
392 var dy = Math.abs(y2 - y1);
|
|
|
393 var m = dy / dx;
|
|
|
394 var n = y1 - m * x1;
|
|
|
395 if (dx > dy) {
|
|
|
396 sx = bin.x - (x1 + bin.r - radius );
|
|
|
397 sy = bin.y - (m * bin.x + n );
|
|
|
398 } else {
|
|
|
399 sy = bin.y - (y1 + bin.r - radius );
|
|
|
400 sx = bin.x - (bin.y - n) / m;
|
|
|
401 }
|
|
|
402 }
|
|
|
403
|
|
|
404 return {
|
|
|
405 x : sx,
|
|
|
406 y : sy
|
|
|
407 };
|
|
|
408
|
|
|
409 },
|
|
|
410
|
|
|
411 binSize : function(elements) {
|
|
|
412 var size = 0;
|
|
|
413 for (var i in elements ) {
|
|
|
414 size += elements[i].weight;
|
|
|
415 }
|
|
|
416 return size;
|
|
|
417 },
|
|
|
418
|
|
|
419 setCircleSet : function(id, binData) {
|
|
|
420 var circleSets = [];
|
|
|
421 var hashMaps = [];
|
|
|
422 var selectionHashs = [];
|
|
|
423 for (var i = 0; i < binData.length; i++) {
|
|
|
424 var circles = [];
|
|
|
425 var hashMap = [];
|
|
|
426 var selectionMap = [];
|
|
|
427 for (var j = 0; j < this.objects.length; j++) {
|
|
|
428 circles.push([]);
|
|
|
429 hashMap.push([]);
|
|
|
430 selectionMap.push([]);
|
|
|
431 }
|
|
|
432 var points = [];
|
|
|
433 var max = 0;
|
|
|
434 var radius = 0;
|
|
|
435 var resolution = this.map.getResolutionForZoom(i);
|
|
|
436 for (var j = 0; j < binData[i].length; j++) {
|
|
|
437 for (var k = 0; k < binData[i][j].bin.length; k++) {
|
|
|
438 var bs = this.binSize(binData[i][j].bin[k]);
|
|
|
439 if (bs > max) {
|
|
|
440 max = bs;
|
|
|
441 radius = binData[i][j].r / resolution;
|
|
|
442 }
|
|
|
443 }
|
|
|
444 }
|
|
|
445 for (var j = 0; j < binData[i].length; j++) {
|
|
|
446 var bin = binData[i][j];
|
|
|
447 for (var k = 0; k < bin.bin.length; k++) {
|
|
|
448 if (bin.bin[k].length == 0) {
|
|
|
449 continue;
|
|
|
450 }
|
|
|
451 var weight = this.binSize(bin.bin[k]);
|
|
|
452 var r = this.getBinRadius(weight, radius, max);
|
|
|
453 var shift = this.shift(id, bin, r * resolution, bin.bin[k], i);
|
|
|
454 var circle = new CircleObject(bin.x - shift.x, bin.y - shift.y, 0, 0, bin.bin[k], r, k, weight);
|
|
|
455 circles[k].push(circle);
|
|
|
456 for (var z = 0; z < bin.bin[k].length; z++) {
|
|
|
457 hashMap[k][bin.bin[k][z].index] = circle;
|
|
|
458 selectionMap[k][bin.bin[k][z].index] = false;
|
|
|
459 }
|
|
|
460 }
|
|
|
461 }
|
|
|
462 circleSets.push(circles);
|
|
|
463 hashMaps.push(hashMap);
|
|
|
464 selectionHashs.push(selectionMap);
|
|
|
465 }
|
|
|
466 this.binnings[id] = {
|
|
|
467 circleSets : circleSets,
|
|
|
468 hashMaps : hashMaps,
|
|
|
469 selectionHashs : selectionHashs
|
|
|
470 };
|
|
|
471 },
|
|
|
472
|
|
|
473 squareBinning : function() {
|
|
|
474
|
|
|
475 var l = 20037508.34;
|
|
|
476 var area0 = l * l * 4;
|
|
|
477 var binCount = this.options.binCount;
|
|
|
478
|
|
|
479 var bins = [];
|
|
|
480 var binData = [];
|
|
|
481 for (var k = 0; k < this.zoomLevels; k++) {
|
|
|
482 bins.push([]);
|
|
|
483 binData.push([]);
|
|
|
484 }
|
|
|
485
|
|
|
486 for (var i = 0; i < this.objects.length; i++) {
|
|
|
487 for (var j = 0; j < this.objects[i].length; j++) {
|
|
|
488 var o = this.objects[i][j];
|
|
|
489 if (!o.isGeospatial) {
|
|
|
490 continue;
|
|
|
491 }
|
|
|
492 var p = new OpenLayers.Geometry.Point(o.getLongitude(this.options.mapIndex), o.getLatitude(this.options.mapIndex), null);
|
|
|
493 p.transform(this.map.displayProjection, this.map.projection);
|
|
|
494 o.x = p.x;
|
|
|
495 o.y = p.y;
|
|
|
496 for (var k = 0; k < this.zoomLevels; k++) {
|
|
|
497 var bc = binCount * Math.pow(2, k);
|
|
|
498 var a = 2 * l / bc;
|
|
|
499 var binX = Math.floor((p.x + l) / (2 * l) * bc);
|
|
|
500 var binY = Math.floor((p.y + l) / (2 * l) * bc);
|
|
|
501 if ( typeof bins[k]['' + binX] == 'undefined') {
|
|
|
502 bins[k]['' + binX] = [];
|
|
|
503 }
|
|
|
504 if ( typeof bins[k][''+binX]['' + binY] == 'undefined') {
|
|
|
505 bins[k][''+binX]['' + binY] = [];
|
|
|
506 for (var z = 0; z < this.objects.length; z++) {
|
|
|
507 bins[k][''+binX]['' + binY].push([]);
|
|
|
508 }
|
|
|
509 var x = binX * a + a / 2 - l;
|
|
|
510 var y = binY * a + a / 2 - l;
|
|
|
511 binData[k].push({
|
|
|
512 bin : bins[k][''+binX]['' + binY],
|
|
|
513 x : x,
|
|
|
514 y : y,
|
|
|
515 a : a,
|
|
|
516 r : a / 2
|
|
|
517 });
|
|
|
518 }
|
|
|
519 bins[k][''+binX][''+binY][i].push(o);
|
|
|
520 }
|
|
|
521 }
|
|
|
522 }
|
|
|
523
|
|
|
524 this.setCircleSet('square', binData);
|
|
|
525
|
|
|
526 },
|
|
|
527
|
|
|
528 triangularBinning : function() {
|
|
|
529
|
|
|
530 var l = 20037508.34;
|
|
|
531 var a0 = this.options.binCount;
|
|
|
532 var a1 = Math.sqrt(4 * a0 * a0 / Math.sqrt(3));
|
|
|
533 var binCount = a0 / a1 * a0;
|
|
|
534
|
|
|
535 var bins = [];
|
|
|
536 var binData = [];
|
|
|
537 for (var k = 0; k < this.zoomLevels; k++) {
|
|
|
538 bins.push([]);
|
|
|
539 binData.push([]);
|
|
|
540 }
|
|
|
541
|
|
|
542 for (var i = 0; i < this.objects.length; i++) {
|
|
|
543 for (var j = 0; j < this.objects[i].length; j++) {
|
|
|
544 var o = this.objects[i][j];
|
|
|
545 if (!o.isGeospatial) {
|
|
|
546 continue;
|
|
|
547 }
|
|
|
548 var p = new OpenLayers.Geometry.Point(o.getLongitude(this.options.mapIndex), o.getLatitude(this.options.mapIndex), null);
|
|
|
549 p.transform(this.map.displayProjection, this.map.projection);
|
|
|
550 o.x = p.x;
|
|
|
551 o.y = p.y;
|
|
|
552 for (var k = 0; k < this.zoomLevels; k++) {
|
|
|
553 var x_bc = binCount * Math.pow(2, k);
|
|
|
554 var y_bc = x_bc * x_bc / Math.sqrt(x_bc * x_bc - x_bc * x_bc / 4);
|
|
|
555 var a = 2 * l / x_bc;
|
|
|
556 var h = 2 * l / y_bc;
|
|
|
557 var binY = Math.floor((p.y + l) / (2 * l) * y_bc);
|
|
|
558 if ( typeof bins[k]['' + binY] == 'undefined') {
|
|
|
559 bins[k]['' + binY] = [];
|
|
|
560 }
|
|
|
561 var triangleIndex;
|
|
|
562 var partitionsX = x_bc * 2;
|
|
|
563 var partition = Math.floor((p.x + l) / (2 * l) * partitionsX);
|
|
|
564 var xMax = a / 2;
|
|
|
565 var yMax = h;
|
|
|
566 var x = p.x + l - partition * a / 2;
|
|
|
567 var y = p.y + l - binY * h;
|
|
|
568 if (binY % 2 == 0 && partition % 2 == 1 || binY % 2 == 1 && partition % 2 == 0) {
|
|
|
569 if (y + yMax / xMax * x < yMax) {
|
|
|
570 triangleIndex = partition;
|
|
|
571 } else {
|
|
|
572 triangleIndex = partition + 1;
|
|
|
573 }
|
|
|
574 } else {
|
|
|
575 if (y > yMax / xMax * x) {
|
|
|
576 triangleIndex = partition;
|
|
|
577 } else {
|
|
|
578 triangleIndex = partition + 1;
|
|
|
579 }
|
|
|
580 }
|
|
|
581 if ( typeof bins[k][''+binY]['' + triangleIndex] == 'undefined') {
|
|
|
582 bins[k][''+binY]['' + triangleIndex] = [];
|
|
|
583 for (var z = 0; z < this.objects.length; z++) {
|
|
|
584 bins[k][''+binY]['' + triangleIndex].push([]);
|
|
|
585 }
|
|
|
586 var r = Math.sqrt(3) / 6 * a;
|
|
|
587 var x = (triangleIndex - 1) * a / 2 + a / 2 - l;
|
|
|
588 var y;
|
|
|
589 if (binY % 2 == 0 && triangleIndex % 2 == 0 || binY % 2 == 1 && triangleIndex % 2 == 1) {
|
|
|
590 y = binY * h + h - r - l;
|
|
|
591 } else {
|
|
|
592 y = binY * h + r - l;
|
|
|
593 }
|
|
|
594 binData[k].push({
|
|
|
595 bin : bins[k][''+binY]['' + triangleIndex],
|
|
|
596 x : x,
|
|
|
597 y : y,
|
|
|
598 a : a,
|
|
|
599 r : r
|
|
|
600 });
|
|
|
601 }
|
|
|
602 bins[k][''+binY][''+triangleIndex][i].push(o);
|
|
|
603 }
|
|
|
604 }
|
|
|
605 }
|
|
|
606
|
|
|
607 this.setCircleSet('triangular', binData);
|
|
|
608
|
|
|
609 },
|
|
|
610
|
|
|
611 hexagonalBinning : function() {
|
|
|
612
|
|
|
613 var l = 20037508.34;
|
|
|
614 var a0 = this.options.binCount;
|
|
|
615 var a2 = Math.sqrt(4 * a0 * a0 / Math.sqrt(3)) / Math.sqrt(6);
|
|
|
616 var binCount = a0 / a2 * a0;
|
|
|
617
|
|
|
618 var bins = [];
|
|
|
619 var binData = [];
|
|
|
620 for (var k = 0; k < this.zoomLevels; k++) {
|
|
|
621 bins.push([]);
|
|
|
622 binData.push([]);
|
|
|
623 }
|
|
|
624
|
|
|
625 for (var i = 0; i < this.objects.length; i++) {
|
|
|
626 for (var j = 0; j < this.objects[i].length; j++) {
|
|
|
627 var o = this.objects[i][j];
|
|
|
628 if (!o.isGeospatial) {
|
|
|
629 continue;
|
|
|
630 }
|
|
|
631 var p = new OpenLayers.Geometry.Point(o.getLongitude(this.options.mapIndex), o.getLatitude(this.options.mapIndex), null);
|
|
|
632 p.transform(this.map.displayProjection, this.map.projection);
|
|
|
633 o.x = p.x;
|
|
|
634 o.y = p.y;
|
|
|
635 for (var k = 0; k < this.zoomLevels; k++) {
|
|
|
636 var x_bc = binCount * Math.pow(2, k);
|
|
|
637 var y_bc = x_bc * x_bc / Math.sqrt(x_bc * x_bc - x_bc * x_bc / 4);
|
|
|
638 var a = 2 * l / x_bc;
|
|
|
639 var h = 2 * l / y_bc;
|
|
|
640 var binY = Math.floor((p.y + l) / (2 * l) * y_bc);
|
|
|
641 if ( typeof bins[k]['' + binY] == 'undefined') {
|
|
|
642 bins[k]['' + binY] = [];
|
|
|
643 }
|
|
|
644 var triangleIndex;
|
|
|
645 var partitionsX = x_bc * 2;
|
|
|
646 var partition = Math.floor((p.x + l) / (2 * l) * partitionsX);
|
|
|
647 var xMax = a / 2;
|
|
|
648 var yMax = h;
|
|
|
649 var x = p.x + l - partition * a / 2;
|
|
|
650 var y = p.y + l - binY * h;
|
|
|
651 if (binY % 2 == 0 && partition % 2 == 1 || binY % 2 == 1 && partition % 2 == 0) {
|
|
|
652 if (y + yMax / xMax * x < yMax) {
|
|
|
653 triangleIndex = partition;
|
|
|
654 } else {
|
|
|
655 triangleIndex = partition + 1;
|
|
|
656 }
|
|
|
657 } else {
|
|
|
658 if (y > yMax / xMax * x) {
|
|
|
659 triangleIndex = partition;
|
|
|
660 } else {
|
|
|
661 triangleIndex = partition + 1;
|
|
|
662 }
|
|
|
663 }
|
|
|
664 if ( typeof bins[k][''+binY]['' + triangleIndex] == 'undefined') {
|
|
|
665 bins[k][''+binY]['' + triangleIndex] = [];
|
|
|
666 for (var z = 0; z < this.objects.length; z++) {
|
|
|
667 bins[k][''+binY]['' + triangleIndex].push([]);
|
|
|
668 }
|
|
|
669 var r = Math.sqrt(3) / 6 * a;
|
|
|
670 var x = (triangleIndex - 1) * a / 2 + a / 2 - l;
|
|
|
671 var y;
|
|
|
672 if (binY % 2 == 0 && triangleIndex % 2 == 0 || binY % 2 == 1 && triangleIndex % 2 == 1) {
|
|
|
673 y = binY * h + h - r - l;
|
|
|
674 } else {
|
|
|
675 y = binY * h + r - l;
|
|
|
676 }
|
|
|
677 binData[k].push({
|
|
|
678 bin : bins[k][''+binY]['' + triangleIndex],
|
|
|
679 x : x,
|
|
|
680 y : y,
|
|
|
681 a : a,
|
|
|
682 r : r,
|
|
|
683 h : h,
|
|
|
684 binX : triangleIndex,
|
|
|
685 binY : binY
|
|
|
686 });
|
|
|
687 }
|
|
|
688 bins[k][''+binY][''+triangleIndex][i].push(o);
|
|
|
689 }
|
|
|
690 }
|
|
|
691 }
|
|
|
692
|
|
|
693 var hexaBins = [];
|
|
|
694 var hexaBinData = [];
|
|
|
695 for (var k = 0; k < this.zoomLevels; k++) {
|
|
|
696 hexaBins.push([]);
|
|
|
697 hexaBinData.push([]);
|
|
|
698 }
|
|
|
699
|
|
|
700 for (var i = 0; i < binData.length; i++) {
|
|
|
701 for (var j = 0; j < binData[i].length; j++) {
|
|
|
702 var bin = binData[i][j];
|
|
|
703 var binY = Math.floor(bin.binY / 2);
|
|
|
704 var binX = Math.floor(bin.binX / 3);
|
|
|
705 var x, y;
|
|
|
706 var a = bin.a;
|
|
|
707 var h = bin.h;
|
|
|
708 if (bin.binX % 6 < 3) {
|
|
|
709 if ( typeof hexaBins[i]['' + binY] == 'undefined') {
|
|
|
710 hexaBins[i]['' + binY] = [];
|
|
|
711 }
|
|
|
712 y = binY * 2 * bin.h + bin.h - l;
|
|
|
713 x = binX * 1.5 * bin.a + a / 2 - l;
|
|
|
714 } else {
|
|
|
715 if (bin.binY % 2 == 1) {
|
|
|
716 binY++;
|
|
|
717 }
|
|
|
718 if ( typeof hexaBins[i]['' + binY] == 'undefined') {
|
|
|
719 hexaBins[i]['' + binY] = [];
|
|
|
720 }
|
|
|
721 y = binY * 2 * bin.h - l;
|
|
|
722 x = binX * 1.5 * bin.a + a / 2 - l;
|
|
|
723 }
|
|
|
724 if ( typeof hexaBins[i][''+binY]['' + binX] == 'undefined') {
|
|
|
725 hexaBins[i][''+binY]['' + binX] = [];
|
|
|
726 for (var z = 0; z < this.objects.length; z++) {
|
|
|
727 hexaBins[i][''+binY]['' + binX].push([]);
|
|
|
728 }
|
|
|
729 hexaBinData[i].push({
|
|
|
730 bin : hexaBins[i][''+binY]['' + binX],
|
|
|
731 x : x,
|
|
|
732 y : y,
|
|
|
733 a : bin.a,
|
|
|
734 r : bin.h
|
|
|
735 });
|
|
|
736 }
|
|
|
737 for (var k = 0; k < bin.bin.length; k++) {
|
|
|
738 for (var m = 0; m < bin.bin[k].length; m++) {
|
|
|
739 hexaBins[i][''+binY][''+binX][k].push(bin.bin[k][m]);
|
|
|
740 }
|
|
|
741 }
|
|
|
742 }
|
|
|
743 }
|
|
|
744
|
|
|
745 this.setCircleSet('hexagonal', hexaBinData);
|
|
|
746
|
|
|
747 }
|
|
|
748 }
|
|
|
749
|
