html画出的正六边形6个点的坐标是啥,是正六边形内的一个点

你要的是找出一个点是否是凸多边形内部，一个是六边形的一个特定情况下的代码。

我做了修改我的使用该功能，我发现我的版本更加清晰。它的打字稿(你只是眯着眼睛，它的JavaScript)：

function vectorX(v: Vector): number {

return v[1].x - v[0].x;

}

function vectorY(v: Vector): number {

return v[1].y - v[0].y;

}

function crossProduct(v1: Vector, v2: Vector): number {

return vectorX(v1)*vectorY(v2) - vectorY(v1)*vectorX(v2);

}

function isInConvexPolygon(testPoint: Point, polygon: Polygon): boolean {

// https://stackoverflow.com/a/34689268/516188

if (polygon.length < 3) {

throw "Only supporting polygons of length at least 3";

}

// going through all the edges around the polygon. compute the

// vector cross-product http://allenchou.net/2013/07/cross-product-of-2d-vectors/

// to find out for each edge on which side of the edge is the point.

// if the point is on the same side for all the edges, it's inside

let initCrossIsPositive = undefined;

for (var i=0;i

if (polygon[i].x === testPoint.x &&

polygon[i].y === testPoint.y) {

// testPoint is an edge of the polygon

return true;

}

const curPointOnEdge = polygon[i];

const nextPointOnEdge = polygon[(i+1)%polygon.length];

const vector1 = [curPointOnEdge, nextPointOnEdge];

const vector2 = [curPointOnEdge, testPoint];

const cross = crossProduct(vector1, vector2);

if (initCrossIsPositive === undefined) {

initCrossIsPositive = cross > 0;

} else {

if (initCrossIsPositive !== (cross > 0)) {

return false;

}

}

}

// all the cross-products have the same sign: we're inside

return true;

}