mirror of
https://github.com/placeAtlas/atlas.git
synced 2024-11-09 11:32:37 +01:00
287 lines
5.2 KiB
JavaScript
287 lines
5.2 KiB
JavaScript
|
|
var areasSum = 0;
|
|
var areas = [];
|
|
|
|
for(var q = 0; q < atlas.length; q++){
|
|
|
|
var path = atlas[q].path;
|
|
|
|
var area = 0,
|
|
i,
|
|
j,
|
|
point1,
|
|
point2;
|
|
|
|
for (i = 0, j = path.length - 1; i < path.length; j=i,i++) {
|
|
point1 = path[i];
|
|
point2 = path[j];
|
|
area += point1[0] * point2[1];
|
|
area -= point1[1] * point2[0];
|
|
}
|
|
|
|
area = Math.abs(area/2);
|
|
|
|
if(atlas[q].name == "Companion Cube"){
|
|
var w = atlas[q].path[1][0] - atlas[q].path[0][0];
|
|
var h = atlas[q].path[2][1] - atlas[q].path[1][1];
|
|
console.log(w, h, w*h);
|
|
console.log(area, Math.sqrt(area));
|
|
}
|
|
|
|
areasSum += area;
|
|
areas.push(area);
|
|
|
|
atlas[q].area = area;
|
|
|
|
}
|
|
|
|
areas.sort(function(a, b){
|
|
if (a < b) {
|
|
return -1;
|
|
}
|
|
if (a > b) {
|
|
return 1;
|
|
}
|
|
// a must be equal to b
|
|
return 0;
|
|
});
|
|
|
|
atlas.sort(function(a, b){
|
|
if (a.area < b.area) {
|
|
return -1;
|
|
}
|
|
if (a.area > b.area) {
|
|
return 1;
|
|
}
|
|
// a must be equal to b
|
|
return 0;
|
|
});
|
|
|
|
var el = document.createElement("canvas");
|
|
el.style.position = "absolute";
|
|
el.style.top = "0px";
|
|
el.style.zIndex = "10000";
|
|
var ctx = el.getContext("2d");
|
|
el.width = 1600;
|
|
el.height = 500;
|
|
var steps = 150;
|
|
var max = 1500;
|
|
|
|
var largerThanMax = 0;
|
|
|
|
for(var i in areas){
|
|
if(areas[i] > max){
|
|
largerThanMax++;
|
|
}
|
|
}
|
|
|
|
console.log("There are "+largerThanMax+" entries larger than "+max+", accounting for "+(largerThanMax/areas.length*100)+"% of all entries.");
|
|
console.log("The largest entry has an area of "+areas[areas.length-1]+" pixels.");
|
|
|
|
var counts = [0];
|
|
var brackets = [max/steps];
|
|
|
|
var bracket = 0;
|
|
|
|
var mostCounts = 0;
|
|
|
|
for(var i in areas){
|
|
if(areas[i] > (bracket+1)*(max/steps)){
|
|
mostCounts = Math.max(mostCounts, counts[bracket]);
|
|
bracket++;
|
|
if(bracket >= steps){
|
|
break;
|
|
}
|
|
counts[bracket] = 0;
|
|
brackets[bracket] = (bracket+1)*(max/steps);
|
|
}
|
|
counts[bracket]++;
|
|
}
|
|
//console.log(counts);
|
|
//console.log(brackets);
|
|
//console.log(mostCounts);
|
|
|
|
ctx.fillStyle = "#FFFFFF";
|
|
ctx.fillRect(0, 0, el.width, el.height);
|
|
ctx.strokeStyle = "#F5F5F5";
|
|
|
|
ctx.fillStyle = "#333333";
|
|
ctx.font = "15px sans";
|
|
ctx.textAlign = "right";
|
|
ctx.textBaseline = "middle";
|
|
|
|
var linesDistance = 1;
|
|
|
|
for(var i = 0; i <= Math.ceil((mostCounts/linesDistance)/5)*5; i++){
|
|
ctx.beginPath();
|
|
ctx.moveTo(
|
|
50
|
|
,~~(el.height - 50 - i*(linesDistance/mostCounts)*(el.height-100))+0.5
|
|
);
|
|
ctx.lineTo(
|
|
el.width-25
|
|
,~~(el.height - 50 - i*(linesDistance/mostCounts)*(el.height-100))+0.5
|
|
);
|
|
ctx.stroke();
|
|
}
|
|
|
|
ctx.strokeStyle = "#333333";
|
|
linesDistance = 5;
|
|
|
|
for(var i = 0; i <= Math.ceil(mostCounts/linesDistance); i++){
|
|
ctx.beginPath();
|
|
ctx.moveTo(
|
|
50
|
|
,~~(el.height - 50 - i*(linesDistance/mostCounts)*(el.height-100))+0.5
|
|
);
|
|
ctx.lineTo(
|
|
el.width-25
|
|
,~~(el.height - 50 - i*(linesDistance/mostCounts)*(el.height-100))+0.5
|
|
);
|
|
ctx.stroke();
|
|
|
|
ctx.fillText(
|
|
i*linesDistance
|
|
,40
|
|
,~~(el.height - 50 - i*(linesDistance/mostCounts)*(el.height-100))+0.5
|
|
);
|
|
}
|
|
|
|
var skip = 2;
|
|
|
|
ctx.textAlign = "center";
|
|
ctx.textBaseline = "hanging";
|
|
ctx.font = "10px sans";
|
|
|
|
var a = 0;
|
|
for(var i=0; i <= counts.length; i++){
|
|
if(i%skip == 0){
|
|
var y = 0;
|
|
if(a % 2 == 0){
|
|
y = ~~(el.height - 30)+0.5;
|
|
} else {
|
|
y = ~~(el.height - 45)+0.5;
|
|
}
|
|
a++;
|
|
ctx.beginPath();
|
|
ctx.moveTo(
|
|
~~(((i)/steps)*(el.width-125)+75)+0.5
|
|
,~~(el.height - 50)+0.5
|
|
);
|
|
ctx.lineTo(
|
|
~~(((i)/steps)*(el.width-125)+75)+0.5
|
|
,y
|
|
);
|
|
ctx.stroke();
|
|
|
|
ctx.fillText(
|
|
(i)*(max/steps)
|
|
,~~(((i)/steps)*(el.width-125)+75)-0.5
|
|
,y+5
|
|
);
|
|
}
|
|
}
|
|
|
|
ctx.fillStyle = "#FF0000";
|
|
ctx.strokeStyle = "#CC0000";
|
|
|
|
for(var i = 0; i < counts.length; i++){
|
|
if(i%2 == 0){
|
|
ctx.fillStyle = "#FF0000";
|
|
} else {
|
|
ctx.fillStyle = "#DD0000";
|
|
}
|
|
|
|
ctx.fillRect(
|
|
~~((i/steps)*(el.width-125)+75)
|
|
,el.height - 50
|
|
,Math.ceil(1/steps*(el.width-125))
|
|
,~~(-(counts[i]/mostCounts)*(el.height-100))
|
|
);
|
|
|
|
/*ctx.beginPath();
|
|
ctx.moveTo(
|
|
~~((i/steps)*(el.width-125)+75)+0.5
|
|
,~~(el.height - 50)
|
|
);
|
|
ctx.lineTo(
|
|
~~((i/steps)*(el.width-125)+75)+0.5
|
|
,~~(el.height-(counts[i]/mostCounts)*(el.height-100))-50+0.5
|
|
);
|
|
ctx.lineTo(
|
|
~~(((i+1)/steps)*(el.width-125)+75)+0.5
|
|
,~~(el.height-(counts[i]/mostCounts)*(el.height-100))-50+0.5
|
|
);
|
|
ctx.lineTo(
|
|
~~(((i+1)/steps)*(el.width-125)+75)+0.5
|
|
,~~(el.height - 50)
|
|
);
|
|
ctx.stroke();*/
|
|
}
|
|
|
|
document.getElementById("wrapper").appendChild(el);
|
|
|
|
//console.log(areas);
|
|
|
|
console.log("Median area: "+areas[~~(areas.length/2)]);
|
|
|
|
console.log("Average area: "+(areasSum/atlas.length));
|
|
|
|
var topCount = 50;
|
|
console.log("The "+topCount+" largest entries:");
|
|
|
|
var outstring = "";
|
|
|
|
for(var i = 0; i < topCount; i++){
|
|
outstring += ((i+1)+"|["+atlas[atlas.length-i-1].name +"](http://place-atlas.stefanocoding.me/?id="+atlas[atlas.length-i-1].id+")|"+ ~~atlas[atlas.length-i-1].area+"|"+Math.round(atlas[atlas.length-i-1].area/100)/100+"%\n");
|
|
}
|
|
|
|
console.log(outstring);
|
|
|
|
atlas.sort(function(a, b){
|
|
if (a.center[0] < b.center[0]) {
|
|
return -1;
|
|
}
|
|
if (a.center[0] > b.center[0]) {
|
|
return 1;
|
|
}
|
|
// a must be equal to b
|
|
return 0;
|
|
});
|
|
|
|
console.log("Median x: "+atlas[~~(atlas.length/2)].center[0]);
|
|
|
|
atlas.sort(function(a, b){
|
|
if (a.center[1] < b.center[1]) {
|
|
return -1;
|
|
}
|
|
if (a.center[1] > b.center[1]) {
|
|
return 1;
|
|
}
|
|
// a must be equal to b
|
|
return 0;
|
|
});
|
|
|
|
console.log("Median y: "+atlas[~~(atlas.length/2)].center[1]);
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|