Java平行线算法_求折线两侧平行线算法

不多废话，直接上代码function dist2d(coord1, coord2) {

let dx = coord1[0] - coord2[0];

let dy = coord1[1] - coord2[1];

return Math.sqrt(dx * dx + dy * dy)

}

function equals(coord1, coord2) {

let equals = true;

for (let i = coord1.length - 1; i >= 0; --i){

if (coord1[i] != coord2[i]) {

equals = false;

break

}

}

return equals

}

function offsetCoords(coords, offset) {

var path = [];

var N = coords.length-1;

var max = N;

var mi, mi1, li, li1, ri, ri1, si, si1, Xi1, Yi1;

var p0, p1, p2;

var isClosed = equals(coords[0],coords[N]);

if (!isClosed) {

p0 = coords[0];

p1 = coords[1];

p2 = [

p0[0] + (p1[1] - p0[1]) / dist2d(