筛选一组点位里面所形成的外接图形面积最大的点
简单来说我的理解就是求最大的外接面积形成的点,算法上就是求凸包。
//根据points点的XY数组计算
function convexHull(points) {
points.sort(function(a, b) {
return a[0] == b[0] ? a[1] - b[1] : a[0] - b[0];
});
var lower = [];
for (var i = 0; i < points.length; i++) {
while (lower.length >= 2 && cross(lower[lower.length - 2], lower[lower.length - 1], points[i]) <= 0) {
lower.pop();
}
lower.push(points[i]);
}
var upper = [];
for (var i = points.length - 1; i >= 0; i--) {
while (upper.length >= 2 && cross(upper[upper.length - 2], upper[upper.length - 1], points[i]) <= 0) {
upper.pop();
}
upper.push(points[i]);
}
upper.pop();
lower.pop();
return lower.concat(upper);
}
//离散点边界轮廓提取
let hull = convexHull(setPoint());
//输出至控制台
console.log(hull);
for (let i = 0; i < hull.length; i++) {
console.log(hull[i][0]+","+hull[i][1]);
}
function cross(a, b, o) {
return (a[0] - o[0]) * (b[1] - o[1]) - (a[1] - o[1]) * (b[0] - o[0])
}
//所有点的经纬度数据
function setPoint(){
let pointList = [];
pointList.push([119.929211,31.13428194]);
pointList.push([119.9276415,31.13384562]);
pointList.push([119.9276062,31.13405752]);
pointList.push([119.929534,31.13459388]);
pointList.push([119.92943,31.13478667]);
return pointList;
} //输出的这些点就是筛选过后的一些点