= 0 ? min : 0.1;\n\n if (this.isInside(poly)) {\n return [this];\n }\n\n clip.AddPaths(sp1, ptyp.ptSubject, true);\n clip.AddPaths(sp2, ptyp.ptClip, true);\n\n if (clip.Execute(ctyp.ctIntersection, ctre, cfil.pftNonZero, cfil.pftNonZero)) {\n let inter = POLY\n .fromClipperTreeUnion(ctre, poly.getZ(), minarea)\n // .filter(p => p.isEquivalent(this) || p.isInside(this))\n .filter(p => p.isInside(this));\n return inter;\n }\n\n return null;\n }","title":""},{"docid":"346327bcbcae036811d183ab263a6fd3","score":"0.653041","text":"function intersectsPolygon( a, b ) {\n\n\tvar p = a;\n\n\tdo {\n\n\t\tif ( p.i !== a.i && p.next.i !== a.i && p.i !== b.i && p.next.i !== b.i &&\n\t\t\t\t\t\tintersects( p, p.next, a, b ) ) {\n\n\t\t\treturn true;\n\n\t\t}\n\n\t\tp = p.next;\n\n\t} while ( p !== a );\n\n\treturn false;\n\n}","title":""},{"docid":"346327bcbcae036811d183ab263a6fd3","score":"0.653041","text":"function intersectsPolygon( a, b ) {\n\n\tvar p = a;\n\n\tdo {\n\n\t\tif ( p.i !== a.i && p.next.i !== a.i && p.i !== b.i && p.next.i !== b.i &&\n\t\t\t\t\t\tintersects( p, p.next, a, b ) ) {\n\n\t\t\treturn true;\n\n\t\t}\n\n\t\tp = p.next;\n\n\t} while ( p !== a );\n\n\treturn false;\n\n}","title":""},{"docid":"346327bcbcae036811d183ab263a6fd3","score":"0.653041","text":"function intersectsPolygon( a, b ) {\n\n\tvar p = a;\n\n\tdo {\n\n\t\tif ( p.i !== a.i && p.next.i !== a.i && p.i !== b.i && p.next.i !== b.i &&\n\t\t\t\t\t\tintersects( p, p.next, a, b ) ) {\n\n\t\t\treturn true;\n\n\t\t}\n\n\t\tp = p.next;\n\n\t} while ( p !== a );\n\n\treturn false;\n\n}","title":""},{"docid":"346327bcbcae036811d183ab263a6fd3","score":"0.653041","text":"function intersectsPolygon( a, b ) {\n\n\tvar p = a;\n\n\tdo {\n\n\t\tif ( p.i !== a.i && p.next.i !== a.i && p.i !== b.i && p.next.i !== b.i &&\n\t\t\t\t\t\tintersects( p, p.next, a, b ) ) {\n\n\t\t\treturn true;\n\n\t\t}\n\n\t\tp = p.next;\n\n\t} while ( p !== a );\n\n\treturn false;\n\n}","title":""},{"docid":"346327bcbcae036811d183ab263a6fd3","score":"0.653041","text":"function intersectsPolygon( a, b ) {\n\n\tvar p = a;\n\n\tdo {\n\n\t\tif ( p.i !== a.i && p.next.i !== a.i && p.i !== b.i && p.next.i !== b.i &&\n\t\t\t\t\t\tintersects( p, p.next, a, b ) ) {\n\n\t\t\treturn true;\n\n\t\t}\n\n\t\tp = p.next;\n\n\t} while ( p !== a );\n\n\treturn false;\n\n}","title":""},{"docid":"6b31cafa5aa5979bccf3e7832bd03e92","score":"0.64700776","text":"function linePolygonIntersect(a1x, a1y, a2x, a2y, points) {\n for (var i = 0, p2 = points[points.length - 1]; i < points.length; i++) {\n var p = points[i];\n\n if (lineLineIntersect(a1x, a1y, a2x, a2y, p[0], p[1], p2[0], p2[1])) {\n return true;\n }\n\n p2 = p;\n }\n }","title":""},{"docid":"8edaa6470b94a53e65d9c88e2af61a66","score":"0.63777554","text":"function do_polygons_collide(poly1, poly2) {\n // Use the SAT theorem for determining if the two convex polygons collide.\n return no_separation_axis(poly1, poly2) && no_separation_axis(poly2, poly1);\n}","title":""},{"docid":"7423752e9f22e8869e9841c44d6f9047","score":"0.63772386","text":"parseGeom(geometry){\n let polyLineCollection = [];\n let polyLineCollectionOtherWorld = [];\n let edgeOfMap = 10 \n let leftEdge=false // close to left edge\n let rightEdge = false // close to right edge\n \n // convert \n geometry.coordinates.forEach(feature => {\n feature.forEach(polygon => {\n let lineCoord = {\n \"type\": \"LineString\",\n \"coordinates\": []\n }\n let lineCoordCopy = {\n \"type\": \"LineString\",\n \"coordinates\": []\n }\n let crossed22 = false\n for(let i=0; i < polygon.length; i++){\n let coordinates = polygon[i]\n if ((coordinates[0] < -179.99 || coordinates[0] > 179.99) && lineCoord.coordinates.length) {\n if(lineCoord.coordinates.length > 1){\n polyLineCollection.push(lineCoord)\n if (crossed22) {\n lineCoordCopy = {\n \"type\": \"LineString\",\n \"coordinates\": []\n }\n // eslint-disable-next-line \n lineCoord.coordinates.forEach((coordinates) => {\n lineCoordCopy.coordinates.push([coordinates[0] - 360, coordinates[1]])\n })\n polyLineCollectionOtherWorld.push(lineCoordCopy)\n }\n }\n lineCoord = {\n \"type\": \"LineString\",\n \"coordinates\": []\n }\n }\n if (coordinates[0] > -179.99 && coordinates[0] < 179.99) {\n lineCoord.coordinates.push(coordinates)\n if (coordinates[0] > 22.5) crossed22 = true\n if (coordinates[0] > 180 - edgeOfMap) rightEdge = true\n if (coordinates[0] < -180 + edgeOfMap) leftEdge = true\n }\n else{\n if(i+1 < polygon.length && polygon[i+1][0] > -179.99 && polygon[i+1][0] < 179.99){\n lineCoord.coordinates.push(coordinates)\n }\n }\n \n }\n\n polyLineCollection.push(lineCoord)\n if (crossed22) {\n lineCoordCopy = {\n \"type\": \"LineString\",\n \"coordinates\": []\n }\n lineCoord.coordinates.forEach(coordinates => {\n lineCoordCopy.coordinates.push([coordinates[0] - 360, coordinates[1]])\n })\n polyLineCollectionOtherWorld.push(lineCoordCopy)\n }\n })\n });\n \n if(rightEdge && leftEdge){ // if its close to both edges draw on both sides of map\n polyLineCollectionOtherWorld.forEach(line =>{\n polyLineCollection.push(line)\n })\n }\n let lines = polyLineCollection.map((p)=>{\n return p.coordinates\n })\n let result = {\n type: 'MultiLineString',\n coordinates : lines\n }\n return result\n }","title":""},{"docid":"31a96509b730cd0cda3b73d8dd5222f0","score":"0.63668406","text":"function simplifyPolygon(points) {\n\t\tif (points.length < 4) {\n\t\t\treturn null;\n\t\t}\n\n\t\tvar slices = [];\n\t\tvar bestSlice = null;\n\t\tvar addPoint = null;\n\t\tfunction updateBestSlice(begin, end, intersection) {\n\t\t\tif (!bestSlice) {\n\t\t\t\t// First slice, so it's the best slice so far\n\t\t\t\tbestSlice = [begin, end];\n\t\t\t\taddPoint = intersection;\n\t\t\t} else {\n\t\t\t\t// Check if this slice overlaps a known intersecting slice\n\t\t\t\tvar overlaps = false;\n\t\t\t\tfor (var i = 0; i < slices.length; ++i) {\n\t\t\t\t\tif (begin <= slices[i][1] && slices[i][0] <= end) {\n\t\t\t\t\t\toverlaps = true;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tif (!overlaps && (end - begin) > bestSlice[1] - bestSlice[0]) {\n\t\t\t\t\t/* Does not contain a subslice with an intersection, and\n\t\t\t\t\t contains more points than the best slice, so this is our\n\t\t\t\t\t new best slice. Using actual distance rather than\n\t\t\t\t\t number of points may make more sense here, but this\n\t\t\t\t\t seems to work well and is much less expensive. */\n\t\t\t\t\tbestSlice = [begin, end];\n\t\t\t\t\taddPoint = intersection;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t// Add to slices list for overlap checking next time around\n\t\t\tslices.push([begin, end]);\n\t\t}\n\n\t\tfor (var i = 0; i < points.length - 3; ++i) {\n\t\t\tvar p0 = points[i];\n\t\t\tvar p1 = points[i + 1];\n\n\t\t\tvar foundIntersection = false;\n\t\t\tfor (var j = i + 2; j < points.length - 1 && !foundIntersection; ++j) {\n\t\t\t\tvar p2 = points[j];\n\t\t\t\tvar p3 = points[j + 1];\n\n\t\t\t\t// Check for an actual line intersection\n\t\t\t\tvar intersection = lineIntersection(p0, p1, p2, p3);\n\t\t\t\tif (intersection) {\n\t\t\t\t\tupdateBestSlice(i, j, intersection);\n\t\t\t\t\tfoundIntersection = true;\n\t\t\t\t} else if (j > i + 4) {\n\t\t\t\t\t// Check if endpoints are close enough to be considered intersecting\n\t\t\t\t\tif (distance(p0.x, p0.y, p2.x, p2.y) <= polyDistance) {\n\t\t\t\t\t\tupdateBestSlice(i, j, null);\n\t\t\t\t\t\tfoundIntersection = true;\n\t\t\t\t\t} else if (distance(p1.x, p1.y, p2.x, p2.y) <= polyDistance) {\n\t\t\t\t\t\tupdateBestSlice(i + 1, j, null);\n\t\t\t\t\t\tfoundIntersection = true;\n\t\t\t\t\t} else if (distance(p0.x, p0.y, p3.x, p3.y) <= polyDistance) {\n\t\t\t\t\t\tupdateBestSlice(i, j + 1, null);\n\t\t\t\t\t\tfoundIntersection = true;\n\t\t\t\t\t} else if (distance(p1.x, p1.y, p3.x, p3.y) <= polyDistance) {\n\t\t\t\t\t\tupdateBestSlice(i + 1, j + 1, null);\n\t\t\t\t\t\tfoundIntersection = true;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif (foundIntersection) {\n\t\t\t\t// Found an intersection, so no point in checking overlapping intervals\n\t\t\t\ti = j;\n\t\t\t\tfoundIntersection = false;\n\t\t\t}\n\t\t}\n\n\t\tif (bestSlice) {\n\t\t\tvar poly = points.slice(bestSlice[0], bestSlice[1]);\n\t\t\tif (addPoint) {\n\t\t\t\tpoly.push(addPoint);\n\t\t\t}\n\t\t\treturn poly;\n\t\t}\n\n\t\treturn null;\n\t}","title":""},{"docid":"e5f3603664f19fbb5870dad04e5f0d6b","score":"0.63302964","text":"function collided_polygon_polygon(polygonA, polygonB) {\n // NB: the clipping library expects polygons to be explicitly closed lists of pairs of numbers\n let A = polygonA.concat(polygonA[0]);\n let B = polygonB.concat(polygonB[0]);\n /* Note that the clipping library expects geometry of the form [number, number][][] \n * The reason is that it works with multipolygons, where rings after the first represent holes \n */\n let result = GreinerHormann.intersection([A], [B]);\n /* I have no idea why, but sometimes the intersection function rejects with a null, and sometimes it rejects with an empty array \n * ¯\\_(ツ)_/¯\n */\n return result !== null && result.length > 0;\n}","title":""},{"docid":"2408c09f15ba9593380b463adc24f7ce","score":"0.6319244","text":"intersect(p1, p2, p3, p4, dir) {\n let x1 = p1.x\n let y1 = p1.y\n let x2 = p2.x\n let y2 = p2.y\n let x3 = p3.x\n let y3 = p3.y\n let x4 = p4.x\n let y4 = p4.y\n\n let denom = ((y4-y3) * (x2-x1)) - ((x4-x3) * (y2-y1))\n if (denom != 0) {\n let ua = (((x4-x3) * (y1-y3)) - ((y4-y3) * (x1-x3))) / denom\n if ((ua >= 0) && (ua <= 1)) {\n let ub = (((x2-x1) * (y1-y3)) - ((y2-y1) * (x1-x3))) / denom\n if ((ub >= 0) && (ub <= 1)) {\n var x = x1 + (ua * (x2-x1))\n var y = y1 + (ua * (y2-y1))\n return { x: x, y: y, dir: dir }\n }\n }\n }\n return null\n }","title":""},{"docid":"82d9cd6fe6fbf66f444de52ff5f4f9ea","score":"0.63071746","text":"static intersection(hs: Halfspace[]): Polytope { throw new NotImplementedError(); }","title":""},{"docid":"e565a0a0e86a9751b9658619edba4734","score":"0.6271381","text":"static slice(poly, intersections) {\n // if (intersections.length <= 1) return [poly];\n if (intersections.length == 2) return this.sliceSimplePolygonIntersection( poly, intersections);\n if (intersections.length > 2) return this.sliceComplexPolygonIntersection(poly, intersections);\n return [poly];\n }","title":""},{"docid":"e0108084ce711af04879ff4d6129951e","score":"0.6256869","text":"function d3_geom_polygonIntersect(c, d, a, b) {\n var x1 = c[0], x2 = d[0], x3 = a[0], x4 = b[0],\n y1 = c[1], y2 = d[1], y3 = a[1], y4 = b[1],\n x13 = x1 - x3,\n x21 = x2 - x1,\n x43 = x4 - x3,\n y13 = y1 - y3,\n y21 = y2 - y1,\n y43 = y4 - y3,\n ua = (x43 * y13 - y43 * x13) / (y43 * x21 - x43 * y21);\n return [x1 + ua * x21, y1 + ua * y21];\n}","title":""},{"docid":"0866e1cbb40820930258369d439db548","score":"0.6256282","text":"function replicaPoly(p1){\n \nvar p2 = p1.map(function (p) {return [p[0], p[1], p[2]-4]});\nvar p3 = p2.map(function (p) {return [p[0], p[1], p[2]-4]});\nvar p4 = p3.map(function (p) {return [p[0], p[1], p[2]-4]});\nvar p5 = p4.map(function (p) {return [p[0], p[1], p[2]-4]});\nvar p6 = p5.map(function (p) {return [p[0], p[1], p[2]-4]});\nvar p7 = p6.map(function (p) {return [p[0], p[1], p[2]-4]});\nvar p8 = p7.map(function (p) {return [p[0], p[1], p[2]-4]});\n\nvar poly1 = POLYLINE(p1);\nvar poly2 = POLYLINE(p2);\nvar poly3 = POLYLINE(p3);\nvar poly4 = POLYLINE(p4);\nvar poly5 = POLYLINE(p5);\nvar poly6 = POLYLINE(p6);\nvar poly7 = POLYLINE(p7);\nvar poly8 = POLYLINE(p8);\nvar str_poly =STRUCT([poly1,poly2,poly3,poly4,poly5,poly6,poly7,poly8]);\nDRAW(str_poly);\n}","title":""},{"docid":"ff24118afc4364f15044b029ade2841d","score":"0.62405753","text":"function determineIntersect(userShapes)\n{\n for (var i = 0; i < userShapes.length; i++){\n var userShape = userShapes[i];\n for (var j = 0; j < tracts.features.length; j++){\n var tract = tracts.features[j];\n var intersection = turf.intersect(userShape, tract['geometry']);\n if (intersection != null){\n tract.properties.intersection = true;\n var tractArea = turf.area(tract);\n var intersectionArea = turf.area(intersection);\n tract.properties.overlap = intersectionArea / tractArea;\n }\n }\n }\n}","title":""},{"docid":"546205f0cc7c185eba2a6fbad1f6f5d5","score":"0.6211785","text":"createPolygon(cornerPoints) {\n // Shorthand varibles\n let cs = game.cellSize; // Cell width and height are always the same\n\n // Prepare the point data\n let pointsObj = {};\n\n for (let i = 0; i < cornerPoints.length; i++) {\n let key = cornerPoints[i][0] + \"_\" + cornerPoints[i][1];\n if (pointsObj[key]) {\n pointsObj[key]++;\n } else {\n pointsObj[key] = 1;\n }\n\n if (pointsObj[key] == 4)\n delete pointsObj[key]; // Remove internal points (which have four instances)\n }\n\n // Make a point set from point object (removes duplicates)\n let pointsSet = new Set(Object.keys(pointsObj).map(key => key));\n\n // Convert the set of strings into an array of numbers\n let points = [];\n for (let value of pointsSet)\n points.push(value.split(\"_\").map(Number));\n\n // Find the polygon points of the shape\n let polygonArray = [];\n let firstPoint = points[0];\n\n // Add the first point to polygon\n polygonArray.push(firstPoint);\n let lastAddedPoint = firstPoint;\n points.splice(0, 1); // Remove the first point\n\n // Does the points array contain this point\n function hasPoint(x, y) {\n for (let p of points)\n if (p[0] === x && p[1] === y)\n return true;\n return false;\n }\n\n // Helper function used inside the loop\n function addNextPolygonPoint(horDir, verDir) {\n let x = lastAddedPoint[0] + horDir * cs;\n let y = lastAddedPoint[1] + verDir * cs;\n\n if (firstPoint[0] === x && firstPoint[1] === y) {\n polygonDone = true;\n return true;\n }\n\n // Special case if direction is up\n // Do not go up if there is a cell on the left\n if (verDir === -1) {\n if (hasPoint(x - cs, y) && hasPoint(x - cs, y + cs))\n return false;\n }\n\n for (let i = 0; i < points.length; i++) {\n if (x === points[i][0] && y === points[i][1]) {\n polygonArray.push(points[i]); // Next point\n lastAddedPoint = points[i];\n points.splice(i, 1); // Remove the added point\n return true; // Found and added\n }\n }\n return false; // Not found\n }\n\n let polygonDone = false;\n let i = 0; // Counter\n while (!polygonDone) {\n\n if (++i > 50) {\n if (points.length !== 0)\n console.log(\"Bad Shape! Points left.\");\n console.log(\"Bad Shape! Max iterations of 50 reached.\");\n polygonDone = true; // Just of safety. This should never happen with correct shapes!\n }\n\n // Above\n if (addNextPolygonPoint(0, -1))\n continue;\n\n // Right\n if (addNextPolygonPoint(1, 0))\n continue;\n\n // Below\n if (addNextPolygonPoint(0, 1))\n continue;\n\n // Right\n if (addNextPolygonPoint(-1, 0))\n continue;\n\n }\n\n /*\n // Debug. Draw the points and order\n for (let i = 0; i < polygonArray.length; i++) {\n let circle = game.s.circle(polygonArray[i][0], polygonArray[i][1], 4);\n circle.attr({\n fill: \"red\"\n });\n let text = game.s.text(polygonArray[i][0] + 5, polygonArray[i][1] - 5, i + 1);\n }\n */\n return polygonArray;\n }","title":""},{"docid":"84240d8a2aa6727de3e6fb2dc40810f8","score":"0.61476344","text":"function calcIntersect(vertices){\r\n var newArr = [];\r\n var count = 0;\r\n \r\n for(var i = 0; i<12; i++) newArr.push(vertices[i]); \r\n\r\n //Calculate the intersecting circle using points with matching z axis from \r\n //each of the 4 unit circles forming 2 connecting cylinders.\r\n for(var i = 0; i < (points.length-2)*24; i++){\r\n var Ax = vertices[i].x; var Ay = vertices[i].y;\r\n var Bx = vertices[i+12].x; var By = vertices[i+12].y;\r\n var Cx = vertices[i+24].x; var Cy = vertices[i+24].y;\r\n var Dx = vertices[i+36].x; var Dy = vertices[i+36].y;\r\n \r\n var a = Bx - Ax; var d = Dy - Cy;\r\n var b = Dx - Cx; var e = Cx - Ax;\r\n var c = By - Ay; var f = Cy - Ay;\r\n\r\n var h = (1/(a*d-b*c))*(d*e+(-b)*f);\r\n \r\n var Lx = Ax+(Bx-Ax)*h; \r\n var Ly = Ay+(By-Ay)*h;\r\n \r\n newArr.push(new coord(Lx,Ly,vertices[i+12].z)); \r\n\r\n if((i+1)%12 == 0){\r\n i+=12;\r\n }\r\n }\r\n \r\n for(var i = 12; i>0; i--) newArr.push(vertices[vertices.length-i]);\r\n \r\n //Duplicate each vertex for flat shading\r\n var arr = newArr;\r\n newArr = [];\r\n for(var i = 0; i < arr.length; i++){\r\n newArr.push(arr[i]);\r\n if(i!=0 && i%12 != 0){ \r\n newArr.push(arr[i]);\r\n }\r\n if(i!=0 && (i+1)%12 == 0){\r\n newArr.push(arr[i-11]);\r\n //change the last one to not duplicate if its the last set. HOW TO!?\r\n if(count!=0 && count%2!=0 && (count/2) < points.length-2) i-=12;\r\n count++; \r\n }\r\n } \r\n \r\n return newArr;\r\n}","title":""},{"docid":"d01e56e327ac5aca505c47fbfeaa7f06","score":"0.61339337","text":"_intersectPolytope(other: T): T {\n return other.constructor.intersection([...this.halfspaces, ...other.halfspaces]);\n }","title":""},{"docid":"d10de95f114c7a59314cf0cd8ef03060","score":"0.6100022","text":"function splitone(shape, p0, p1) {\n var l = shape.length;\n var isect_indecies = [];\n var newPoints = [];\n\n // Find intersection points\n for (let i = 0; i < l; i++) {\n newPoints.push(shape[i]);\n begin_index = i;\n end_index = ((i + 1) % l);\n\n print(\"testing p\" + begin_index + \" - p\" + end_index);\n\n let newp = lineLine(p0.x, p0.y, p1.x, p1.y,\n shape[begin_index].x, shape[begin_index].y,\n shape[end_index].x, shape[end_index].y)\n\n if (newp) {\n newPoints.push(newp);\n isect_indecies.push(i + 1 + isect_indecies.length);\n }\n }\n\n // If the line intersects with the shape, make resultant shapes. \n // TODO, more complicated is this shape negative space of the other shape logic\n if (isect_indecies.length) {\n\n let newShapeArrays = [];\n newShapeArrays[0] = [];\n\n let start = isect_indecies[0]\n for (let i = start; i < newPoints.length + start; ++i) {\n let index = i % newPoints.length\n let thisPoint = newPoints[index]\n\n // Add this point to the last shape\n newShapeArrays[newShapeArrays.length - 1].push(thisPoint)\n\n // If this point is an intersection, make a new array, and begin it with this point.\n if (isect_indecies.indexOf(index) != -1) {\n let a = []\n a.push(thisPoint);\n newShapeArrays.push(a);\n }\n }\n\n let fix = newShapeArrays.shift();\n newShapeArrays[newShapeArrays.length - 1].push(fix[0]);\n\n // subshapeinfo[j] == the shape I belong to.\n subshapeinfo = new Map();\n for (let i = 0; i < newShapeArrays.length; i++) {\n for (let j = 0; j < newShapeArrays.length; j++) {\n if (i != j) {\n if (isSubShape(newShapeArrays[i], newShapeArrays[j])) {\n subshapeinfo.set(j, i);\n }\n }\n }\n }\n finalShapeArrays = []\n\n newShapeArrays.forEach(function(item, index) {\n let finalshape = item;\n\n // if this shape index is a key in the map,\n // don't do anything with it.\n if (subshapeinfo.has(index)) {} else {\n subshapeinfo.forEach(function(value, key, map) {\n if (index == value) {\n finalshape = finalshape.concat(newShapeArrays[key])\n }\n })\n f = deepCopyShape(finalshape)\n finalShapeArrays.push(f)\n }\n // if this shape index appears as a value for any keys in the map,\n // concatinate those shapes onto this shape.\n })\n\n //\n // Some debug code:\n\n finalShapeArrays.forEach(function(item, index) {\n print(\"SHAPE \" + index + \"!!!!!\");\n shiftShape(item, 10, true);\n shapeArrayDraw(item);\n })\n\n }\n}","title":""},{"docid":"1c82e28a87f4b6943012ac8a219e0e2f","score":"0.6084591","text":"function splitPolygon (geoPts)\r\n{\r\n var retPolys = []\r\n \r\n}","title":""},{"docid":"501a2a9f59ce976623deeb2cc6822231","score":"0.60716444","text":"function get_line_intersection(p0_x, p0_y, p1_x, p1_y, \r\n\t\tp2_x, p2_y, p3_x, p3_y) {\r\n\t\t\r\n\t\tvar inter_points = {\r\n\t\t\tinter_x: null,\r\n\t\t\tinter_y: null \r\n\t\t}\r\n\t\t\r\n\t\tvar s1_x, s1_y, s2_x, s2_y;\r\n\t\ts1_x = p1_x - p0_x; \r\n\t\ts1_y = p1_y - p0_y;\r\n\t\ts2_x = p3_x - p2_x; \r\n\t\ts2_y = p3_y - p2_y;\r\n\r\n\t\tvar s, t;\r\n\t\ts = (-s1_y * (p0_x - p2_x) + s1_x * (p0_y - p2_y)) / (-s2_x * s1_y + s1_x * s2_y);\r\n\t\tt = ( s2_x * (p0_y - p2_y) - s2_y * (p0_x - p2_x)) / (-s2_x * s1_y + s1_x * s2_y);\r\n\r\n\t\tif (s >= 0 && s <= 1 && t >= 0 && t <= 1)\r\n\t\t{\r\n\t\t\t// Collision detected\r\n\t\t\tinter_points.inter_x = p0_x + (t * s1_x);\r\n\t\t\tinter_points.inter_y = p0_y + (t * s1_y);\r\n\t\t\treturn inter_points; \r\n\t\t}\r\n\r\n\t\treturn 0; // No collision\r\n\t}","title":""},{"docid":"3525f858161b747d9007281bd83a8e58","score":"0.60589087","text":"function patchIntersects(intersections, event) {\n const {\n internal\n } = store.getState(); // If the interaction is captured, make all capturing targets part of the\n // intersect.\n\n if ('pointerId' in event && internal.capturedMap.has(event.pointerId)) {\n for (let captureData of internal.capturedMap.get(event.pointerId).values()) {\n intersections.push(captureData.intersection);\n }\n }\n\n return intersections;\n }","title":""},{"docid":"b82f08560b69e9e5e5954ddd25f825dd","score":"0.6057803","text":"function generateIntersections(intersectionDatas){\n var x = [], y = [], r = [];\n for(var i=0;i<3;i++){\n x[i] = intersectionDatas['x'][i];\n y[i] = intersectionDatas['y'][i];\n r[i] = intersectionDatas['r'][i];\n //console.log('x : '+x[i]+' y : '+y[i]+' r : '+r[i]);\n }\n var interPoints = [];\n interPoints[0] = intersection(x[0], y[0], r[0], x[1], y[1], r[1]);\n interPoints[1] = intersection(x[1], y[1], r[1], x[2], y[2], r[2]);\n interPoints[2] = intersection(x[0], y[0], r[0], x[2], y[2], r[2]);\n\n //We need to send the radius data too\n interPoints[3] = r[0];\n interPoints[4] = r[1];\n interPoints[5] = r[2];\n\n //If there is an intersection\n if(interPoints[0] && interPoints[1] && interPoints[2]){\n return interPoints;\n }\n return false;\n}","title":""},{"docid":"11cf1733125f41521f6338425074815b","score":"0.6053105","text":"clip() {\n if (!this.visible)\n return;\n if (this.shapesManager == null)\n return;\n const A = new math.Vector2();\n const C = new math.Vector2();\n const b = this.shapesManager.getWorldBounds();\n const xmin = b[0];\n const ymin = b[1];\n const xmax = b[2];\n const ymax = b[3];\n const pts = (new java.util.ArrayList());\n const line = geom.Conic2D.TMP_SEGMENT_$LI$();\n line.set$math_Vector2$math_Vector2(A.set$double$double(xmin, ymin), C.set$double$double(xmin, ymax));\n let intersections = this.intersections(line);\n for (let index = 0; index < intersections.length; index++) {\n let d = intersections[index];\n pts.add(d);\n }\n line.set$math_Vector2$math_Vector2(A.set$double$double(xmin, ymax), C.set$double$double(xmax, ymax));\n intersections = this.intersections(line);\n for (let index = 0; index < intersections.length; index++) {\n let d = intersections[index];\n pts.add(d);\n }\n line.set$math_Vector2$math_Vector2(A.set$double$double(xmax, ymax), C.set$double$double(xmax, ymin));\n intersections = this.intersections(line);\n for (let index = 0; index < intersections.length; index++) {\n let d = intersections[index];\n pts.add(d);\n }\n line.set$math_Vector2$math_Vector2(A.set$double$double(xmax, ymin), C.set$double$double(xmin, ymin));\n intersections = this.intersections(line);\n for (let index = 0; index < intersections.length; index++) {\n let d = intersections[index];\n pts.add(d);\n }\n const posBranch = (new java.util.ArrayList());\n const negBranch = (new java.util.ArrayList());\n for (let index = pts.iterator(); index.hasNext();) {\n let t = index.next();\n {\n if (Math.abs(t) < 1)\n posBranch.add(t);\n else\n negBranch.add(1 / t);\n }\n }\n java.util.Collections.sort(posBranch);\n java.util.Collections.sort(negBranch);\n if (posBranch.size() > 1) {\n this.clipt0 = posBranch.get(0);\n this.clipt1 = posBranch.get(posBranch.size() - 1);\n }\n else {\n this.clipt0 = 0;\n this.clipt1 = 0;\n }\n if (negBranch.size() > 1) {\n this.clipt2 = negBranch.get(0);\n this.clipt3 = negBranch.get(negBranch.size() - 1);\n }\n else {\n this.clipt2 = 1;\n this.clipt3 = 1;\n }\n }","title":""},{"docid":"e21fcdc5979bb47a75612ba94924c185","score":"0.60433304","text":"function clipPolygon(coordinates) {\n var polygons = [],\n ring = [],\n unvisited = 0, // number of unvisited entering intersections\n intersections = [];\n // Clip each ring into segments.\n var segments = [];\n coordinates.forEach(function(ring) {\n var ringSegments = clipLine(ring);\n // Since these are closed rings, we join segments if necessary.\n var n = ringSegments.length;\n if (n > 1) {\n var firstSegment = ringSegments[0],\n lastSegment = ringSegments[n - 1],\n p0 = firstSegment[0],\n p1 = lastSegment[lastSegment.length - 1];\n if (p0[0] === p1[0] && p0[1] === p1[1]) {\n ringSegments.shift();\n ringSegments.pop();\n ringSegments.push(lastSegment.concat(firstSegment));\n }\n }\n segments = segments.concat(ringSegments);\n });\n // Create a circular linked list using the intersected segment start and\n // end points, sorted by relative angles.\n segments.forEach(function(segment) {\n var p0 = segment[0],\n p1 = segment[segment.length - 1];\n if (p0[0] !== p1[0] || p0[1] !== p1[1]) {\n var b = {xyz: clipCartesian(p1, center), points: []},\n a = {xyz: clipCartesian(p0, center), points: segment, other: b};\n intersections.push(a, b);\n unvisited++;\n } else {\n // TODO attach subsumed holes to the correct Polygons. For now, we can\n // add these as separate Polygons, since typically we draw everything\n // as a subpath in SVG so it doesn't matter if the holes don't match\n // their polygons. This would be done by calculating some kind of\n // winding number.\n polygons.push([segment]);\n }\n });\n if (!unvisited) return polygons;\n // Sort intersection points by relative angles.\n intersections.forEach(function(intersection, i) {\n intersection.angle = angle(intersection.xyz, reference);\n });\n var start = intersections[0];\n intersections.sort(function(a, b) {\n return b.angle - a.angle;\n });\n // Construct circular linked list.\n for (var i = 0; i < intersections.length;) {\n intersections[i].next = intersections[++i % intersections.length];\n }\n while (unvisited) {\n // Look for unvisited entering intersections.\n while (start.visited || !start.other) start = start.next;\n var intersection = start;\n do {\n intersection.visited = true;\n ring = ring.concat(intersection.points);\n intersection = intersection.other;\n var from = intersection.angle;\n intersection = intersection.next;\n var to = intersection.angle;\n ring = ring.concat(interpolate(from, to));\n unvisited--;\n } while (intersection !== start);\n if (ring.length) {\n polygons.push([ring]);\n ring = [];\n }\n start = start.next;\n }\n return polygons;\n }","title":""},{"docid":"01b5201bf2a7bc49a9e0886751b7a6dc","score":"0.6040053","text":"function insidePolygon(P, transformed) {\n var ref = crossProduct(transformed[transformed.length-1], transformed[0], P);\n for (var i = 0; i < transformed.length-1; i++) {\n if (vec3.dot(ref, crossProduct(transformed[i], transformed[i+1], P)) <= 0) {\n //// no intersection if P on the line of an edge (when crossProduct==0)\n return false;\n }\n } \n return true;\n}","title":""},{"docid":"b5e0e008021a424206c2f3662e824ed1","score":"0.6036691","text":"function detect_collision(corner, polygon) {\n var x = corner[0], y = corner[1]; \n var found = false;\n for (var i = 0, j = polygon.length - 1; i < polygon.length; j = i++) {\n var xi = polygon[i][0], yi = polygon[i][1];\n var xj = polygon[j][0], yj = polygon[j][1];\n \n var intersection = ((yi > y) != (yj > y))\n && (x < (xj - xi) * (y - yi) / (yj - yi) + xi);\n if (intersection){\n found = !found;\n } \n } \n return found;\n}","title":""},{"docid":"fac94367bddab2ec7e8745465b846bd9","score":"0.603625","text":"function computeIntersections(px,py,lx,ly)\r\n\t{\r\n\t var X=Array();\r\n\r\n\t var A=ly[1]-ly[0];\t //A=y2-y1\r\n\t\tvar B=lx[0]-lx[1];\t //B=x1-x2\r\n\t\tvar C=lx[0]*(ly[0]-ly[1]) +\r\n\t\t ly[0]*(lx[1]-lx[0]);\t//C=x1*(y1-y2)+y1*(x2-x1)\r\n\r\n\t\tvar bx = bezierCoeffs(px[0],px[1],px[2],px[3]);\r\n\t\tvar by = bezierCoeffs(py[0],py[1],py[2],py[3]);\r\n\r\n\t var P = Array();\r\n\t\tP[0] = A*bx[0]+B*by[0];\t\t/*t^3*/\r\n\t\tP[1] = A*bx[1]+B*by[1];\t\t/*t^2*/\r\n\t\tP[2] = A*bx[2]+B*by[2];\t\t/*t*/\r\n\t\tP[3] = A*bx[3]+B*by[3] + C;\t/*1*/\r\n\r\n\t\tvar r=cubicRoots(P);\r\n\r\n\t /*verify the roots are in bounds of the linear segment*/\r\n\t for (var i=0;i<3;i++)\r\n\t {\r\n\t\tt=r[i];\r\n\r\n\t\tX[0]=bx[0]*t*t*t+bx[1]*t*t+bx[2]*t+bx[3];\r\n\t\tX[1]=by[0]*t*t*t+by[1]*t*t+by[2]*t+by[3];\r\n\r\n\t\t/*above is intersection point assuming infinitely long line segment,\r\n\t\t make sure we are also in bounds of the line*/\r\n\t\tvar s;\r\n\t\tif ((lx[1]-lx[0])!=0) /*if not vertical line*/\r\n\t\t s=(X[0]-lx[0])/(lx[1]-lx[0]);\r\n\t\telse\r\n\t\t s=(X[1]-ly[0])/(ly[1]-ly[0]);\r\n\r\n\t\t/*in bounds?*/\r\n\t\tif (t<0 || t>1.0 || s<0 || s>1.0)\r\n\t\t{\r\n\t\t X[0]=-100; /*move off screen*/\r\n\t\t X[1]=-100;\r\n\t\t}\r\n\r\n\t\t/*move intersection point*/\r\n\t\tI[i].setAttributeNS(null,\"cx\",X[0]);\r\n\t\tI[i].setAttributeNS(null,\"cy\",X[1]);\r\n\t }\r\n\r\n\t}","title":""},{"docid":"a912310a7ceb1823814b3f47949f264a","score":"0.603405","text":"cut(polys, inter) {\n let target = this;\n\n if (!target.open) {\n target = this.clone(true).setOpen();\n target.push(target.first());\n if (target.inner) {\n target.inner.forEach(ip => {\n ip.setOpen();\n ip.push(ip.first());\n });\n }\n }\n\n let clip = new clib.Clipper(),\n ctre = new clib.PolyTree(),\n type = inter ? ctyp.ctIntersection : ctyp.ctDifference,\n sp1 = target.toClipper(),\n sp2 = POLY.toClipper(polys);\n\n clip.AddPaths(sp1, ptyp.ptSubject, false);\n clip.AddPaths(sp2, ptyp.ptClip, true);\n\n if (clip.Execute(type, ctre, cfil.pftEvenOdd, cfil.pftEvenOdd)) {\n let cuts = POLY.fromClipperTree(ctre, target.getZ(), null, null, 0);\n cuts.forEach(no => {\n // heal open but really closed polygons because cutting\n // has to open the poly to perform the cut. but the result\n // may have been no intersection leaving an open poly\n if (no.open && no.first().distTo2D(no.last()) < 0.001) {\n no.open = false;\n no.points.pop();\n }\n no.depth = this.depth;\n });\n return cuts;\n } else {\n return null;\n }\n }","title":""},{"docid":"75cf313ddc816514af86c36d06a7bbc7","score":"0.60271895","text":"function offsetPolygon( polygon, offset, output ){\n var tmp = [];\n var points = polygon.points;\n var count = points.length;\n for(var j = 0; j < count; j++){\n\n // finds the previous, current and next point\n var i = (j - 1);\n if (i < 0) i += count;\n var k = (j + 1) % count;\n\n var pre = points[ i ];\n var cur = points[ j ];\n var nex = points[ k ];\n\n //create 2 lines, parallel to both edges at a given distance 'offset'\n\n //computes a normal vector to the direction of the: prev -> current edge of length offset\n var l1 = distance(cur, pre);\n var n1 = [\n -( ( cur[1] - pre[1] ) / l1 ) * offset,\n ( ( cur[0] - pre[0] ) / l1 ) * offset\n ];\n\n //does the same for the : current -> next edge\n var l2 = distance(cur, nex);\n var n2 = [\n -( ( nex[1] - cur[1] ) / l2 ) * offset,\n ( ( nex[0] - cur[0] ) / l2 ) * offset\n ];\n\n //and create 2 points at both ends of the edge to obtain a parallel line\n var p1 = [ pre[0]+n1[0], pre[1]+n1[1]];\n var p2 = [ cur[0]+n1[0], cur[1]+n1[1]];\n var p3 = [ cur[0]+n2[0], cur[1]+n2[1]];\n var p4 = [ nex[0]+n2[0], nex[1]+n2[1]];\n\n // console.log( p1, p2, p3, p4 );\n var ip = lineIntersection( p1, p2, p3, p4 );\n if( ip != null ) {\n tmp.push( ip );\n }\n\n }\n polygon.points = tmp;\n return tmp;\n}","title":""},{"docid":"b0673ac6dc75b02ee7cd4c3cc13cee67","score":"0.6025368","text":"clip() {\n if (!this.visible)\n return;\n if (this.shapesManager == null)\n return;\n const A = new math.Vector2();\n const C = new math.Vector2();\n const b = this.shapesManager.getWorldBounds();\n const xmin = b[0];\n const ymin = b[1];\n const xmax = b[2];\n const ymax = b[3];\n const pts = (new java.util.ArrayList());\n const line = geom.Conic2D.TMP_SEGMENT_$LI$();\n line.set$math_Vector2$math_Vector2(A.set$double$double(xmin, ymin), C.set$double$double(xmin, ymax));\n let intersections = this.intersections(line);\n for (let index = 0; index < intersections.length; index++) {\n let d = intersections[index];\n pts.add(d);\n }\n line.set$math_Vector2$math_Vector2(A.set$double$double(xmin, ymax), C.set$double$double(xmax, ymax));\n intersections = this.intersections(line);\n for (let index = 0; index < intersections.length; index++) {\n let d = intersections[index];\n pts.add(d);\n }\n line.set$math_Vector2$math_Vector2(A.set$double$double(xmax, ymax), C.set$double$double(xmax, ymin));\n intersections = this.intersections(line);\n for (let index = 0; index < intersections.length; index++) {\n let d = intersections[index];\n pts.add(d);\n }\n line.set$math_Vector2$math_Vector2(A.set$double$double(xmax, ymin), C.set$double$double(xmin, ymin));\n intersections = this.intersections(line);\n for (let index = 0; index < intersections.length; index++) {\n let d = intersections[index];\n pts.add(d);\n }\n if (pts.size() > 1) {\n java.util.Collections.sort(pts);\n this.clipt0 = pts.get(0);\n this.clipt1 = pts.get(pts.size() - 1);\n }\n }","title":""},{"docid":"54bfb487192aec563900ccd57632c27e","score":"0.60164773","text":"clip() {\n if (!this.visible)\n return;\n this.clipt0 = 0;\n this.clipt1 = 2 * Math.PI;\n if (this.shapesManager == null)\n return;\n let A = new math.Vector2();\n const C = new math.Vector2();\n const b = this.shapesManager.getWorldBounds();\n const xmin = b[0];\n const ymin = b[1];\n const xmax = b[2];\n const ymax = b[3];\n const pts = (new java.util.ArrayList());\n const line = geom.Conic2D.TMP_SEGMENT_$LI$();\n line.set$math_Vector2$math_Vector2(A.set$double$double(xmin, ymin), C.set$double$double(xmin, ymax));\n let intersections = this.intersections(line);\n for (let index = 0; index < intersections.length; index++) {\n let d = intersections[index];\n pts.add(d);\n }\n line.set$math_Vector2$math_Vector2(A.set$double$double(xmin, ymax), C.set$double$double(xmax, ymax));\n intersections = this.intersections(line);\n for (let index = 0; index < intersections.length; index++) {\n let d = intersections[index];\n pts.add(d);\n }\n line.set$math_Vector2$math_Vector2(A.set$double$double(xmax, ymax), C.set$double$double(xmax, ymin));\n intersections = this.intersections(line);\n for (let index = 0; index < intersections.length; index++) {\n let d = intersections[index];\n pts.add(d);\n }\n line.set$math_Vector2$math_Vector2(A.set$double$double(xmax, ymin), C.set$double$double(xmin, ymin));\n intersections = this.intersections(line);\n for (let index = 0; index < intersections.length; index++) {\n let d = intersections[index];\n pts.add(d);\n }\n if (pts.size() === 2) {\n java.util.Collections.sort(pts);\n this.clipt0 = pts.get(0);\n this.clipt1 = pts.get(pts.size() - 1);\n let t = (this.clipt0 + this.clipt1) / 2;\n A = this.point(t);\n if (xmin >= A.x || xmax <= A.x || ymin >= A.y || ymax <= A.y) {\n t = this.clipt0;\n this.clipt0 = this.clipt1;\n this.clipt1 = t + 2 * Math.PI - this.clipt1 + this.clipt0;\n }\n }\n }","title":""},{"docid":"856069753d0ffc45c9379d1a2eea7171","score":"0.60014707","text":"getLineIntersections (a, b) {\n const l = [{}, {}]\n l[0].y = a + b * this.upperLeft.x\n l[0].y = Math.max(l[0].y, this.upperLeft.y)\n l[0].y = Math.min(l[0].y, this.bottomRight.y)\n l[0].x = (l[0].y - a) / b\n\n l[1].y = a + b * this.bottomRight.x\n l[1].y = Math.max(l[1].y, this.upperLeft.y)\n l[1].y = Math.min(l[1].y, this.bottomRight.y)\n l[1].x = (l[1].y - a) / b\n return l\n }","title":""},{"docid":"a79717569a0289853c9f3fa2824de464","score":"0.59907234","text":"function PolygonOverlap(p1, p2)\n{\n var points = p2.toArray();\n for(var v in points)\n {\n if(p1.containsPoint(v))\n return true;\n }\n return false;\n}","title":""},{"docid":"2f0f7a73de430d2ea12d4a3b55beaba3","score":"0.5986664","text":"intersects(other: Region): boolean {\n for (let p of other.polytopes) {\n if (!this.intersect(p).isEmpty) return true;\n }\n return false;\n }","title":""}],"string":"[\n {\n \"docid\": \"9a4021709bff000bb41a14820ff67192\",\n \"score\": \"0.7063792\",\n \"text\": \"function intersectsPolygon(a, b) {\\n var p = a;\\n do {\\n if (p.i !== a.i && p.next.i !== a.i && p.i !== b.i && p.next.i !== b.i &&\\n intersects(p, p.next, a, b)) return true;\\n p = p.next;\\n } while (p !== a);\\n\\n return false;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"096126a9de78f82fcbd254863a2c343a\",\n \"score\": \"0.70030093\",\n \"text\": \"intersects(shape)\\r\\n {\\r\\n let thisPoly = new Polygon(this.getPoints())\\r\\n if(shape instanceof Polygon)\\r\\n {\\r\\n return thisPoly.intersects(shape)\\r\\n }\\r\\n else\\r\\n {\\r\\n let rangePoly = new Polygon(this.getPoints())\\r\\n return thisPoly.intersects(rangePoly)\\r\\n }\\r\\n \\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8591135c0debbfd64b1af36e1e19b35c\",\n \"score\": \"0.698029\",\n \"text\": \"intersectsWith(other) {\\n let axis = { x: 0, y: 0 };\\n let tmp, minA, maxA, minB, maxB;\\n let side, i;\\n let smallest = null;\\n let overlap = 99999999;\\n\\n /* test polygon A's sides */\\n for (side = 0; side < this.getNumberOfSides(); side++) {\\n /* get the axis that we will project onto */\\n if (side == 0) {\\n axis.x = this.points[this.getNumberOfSides() - 1].y - this.points[0].y;\\n axis.y = this.points[0].x - this.points[this.getNumberOfSides() - 1].x;\\n } else {\\n axis.x = this.points[side - 1].y - this.points[side].y;\\n axis.y = this.points[side].x - this.points[side - 1].x;\\n }\\n\\n /* normalize the axis */\\n tmp = Math.sqrt(axis.x * axis.x + axis.y * axis.y);\\n axis.x /= tmp;\\n axis.y /= tmp;\\n\\n /* project polygon A onto axis to determine the min/max */\\n minA = maxA = this.points[0].x * axis.x + this.points[0].y * axis.y;\\n for (i = 1; i < this.getNumberOfSides(); i++) {\\n tmp = this.points[i].x * axis.x + this.points[i].y * axis.y;\\n if (tmp > maxA) maxA = tmp;\\n else if (tmp < minA) minA = tmp;\\n }\\n /* correct for offset */\\n tmp = this.center.x * axis.x + this.center.y * axis.y;\\n minA += tmp;\\n maxA += tmp;\\n\\n /* project polygon B onto axis to determine the min/max */\\n minB = maxB = other.points[0].x * axis.x + other.points[0].y * axis.y;\\n for (i = 1; i < other.getNumberOfSides(); i++) {\\n tmp = other.points[i].x * axis.x + other.points[i].y * axis.y;\\n if (tmp > maxB) maxB = tmp;\\n else if (tmp < minB) minB = tmp;\\n }\\n /* correct for offset */\\n tmp = other.center.x * axis.x + other.center.y * axis.y;\\n minB += tmp;\\n maxB += tmp;\\n\\n /* test if lines intersect, if not, return false */\\n if (maxA < minB || minA > maxB) {\\n return false\\n } else {\\n let o = maxA > maxB ? maxB - minA : maxA - minB;\\n if (o < overlap) {\\n overlap = o;\\n smallest = { x: axis.x, y: axis.y };\\n }\\n }\\n }\\n\\n /* test polygon B's sides */\\n for (side = 0; side < other.getNumberOfSides(); side++) {\\n /* get the axis that we will project onto */\\n if (side == 0) {\\n axis.x = other.points[other.getNumberOfSides() - 1].y - other.points[0].y;\\n axis.y = other.points[0].x - other.points[other.getNumberOfSides() - 1].x;\\n } else {\\n axis.x = other.points[side - 1].y - other.points[side].y;\\n axis.y = other.points[side].x - other.points[side - 1].x;\\n }\\n\\n /* normalize the axis */\\n tmp = Math.sqrt(axis.x * axis.x + axis.y * axis.y);\\n axis.x /= tmp;\\n axis.y /= tmp;\\n\\n /* project polygon A onto axis to determine the min/max */\\n minA = maxA = this.points[0].x * axis.x + this.points[0].y * axis.y;\\n for (i = 1; i < this.getNumberOfSides(); i++) {\\n tmp = this.points[i].x * axis.x + this.points[i].y * axis.y;\\n if (tmp > maxA) maxA = tmp;\\n else if (tmp < minA) minA = tmp;\\n }\\n /* correct for offset */\\n tmp = this.center.x * axis.x + this.center.y * axis.y;\\n minA += tmp;\\n maxA += tmp;\\n\\n /* project polygon B onto axis to determine the min/max */\\n minB = maxB = other.points[0].x * axis.x + other.points[0].y * axis.y;\\n for (i = 1; i < other.getNumberOfSides(); i++) {\\n tmp = other.points[i].x * axis.x + other.points[i].y * axis.y;\\n if (tmp > maxB) maxB = tmp;\\n else if (tmp < minB) minB = tmp;\\n }\\n /* correct for offset */\\n tmp = other.center.x * axis.x + other.center.y * axis.y;\\n minB += tmp;\\n maxB += tmp;\\n\\n /* test if lines intersect, if not, return false */\\n if (maxA < minB || minA > maxB) {\\n return false\\n } else {\\n let o = maxA > maxB ? maxB - minA : maxA - minB;\\n if (o < overlap) {\\n overlap = o;\\n smallest = { x: axis.x, y: axis.y };\\n }\\n }\\n }\\n return { overlap: overlap + 0.001, axis: smallest }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"98a233cc4b9c70f992908dad9a0bd098\",\n \"score\": \"0.69431394\",\n \"text\": \"function intersectsPolygon(a, b) {\\n\\t\\t var p = a;\\n\\t\\t do {\\n\\t\\t if (p.i !== a.i && p.next.i !== a.i && p.i !== b.i && p.next.i !== b.i &&\\n\\t\\t intersects(p, p.next, a, b)) { return true; }\\n\\t\\t p = p.next;\\n\\t\\t } while (p !== a);\\n\\n\\t\\t return false;\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"94c56eb70482417785891c6bb3af077d\",\n \"score\": \"0.6929379\",\n \"text\": \"function clipPolygon(segments, compareIntersection, startInside, interpolate, stream) {\\n\\t\\t var subject = [],\\n\\t\\t clip = [],\\n\\t\\t i,\\n\\t\\t n;\\n\\n\\t\\t segments.forEach(function(segment) {\\n\\t\\t if ((n = segment.length - 1) <= 0) return;\\n\\t\\t var n, p0 = segment[0], p1 = segment[n], x;\\n\\n\\t\\t // If the first and last points of a segment are coincident, then treat as a\\n\\t\\t // closed ring. TODO if all rings are closed, then the winding order of the\\n\\t\\t // exterior ring should be checked.\\n\\t\\t if (pointEqual(p0, p1)) {\\n\\t\\t stream.lineStart();\\n\\t\\t for (i = 0; i < n; ++i) stream.point((p0 = segment[i])[0], p0[1]);\\n\\t\\t stream.lineEnd();\\n\\t\\t return;\\n\\t\\t }\\n\\n\\t\\t subject.push(x = new Intersection(p0, segment, null, true));\\n\\t\\t clip.push(x.o = new Intersection(p0, null, x, false));\\n\\t\\t subject.push(x = new Intersection(p1, segment, null, false));\\n\\t\\t clip.push(x.o = new Intersection(p1, null, x, true));\\n\\t\\t });\\n\\n\\t\\t if (!subject.length) return;\\n\\n\\t\\t clip.sort(compareIntersection);\\n\\t\\t link$1(subject);\\n\\t\\t link$1(clip);\\n\\n\\t\\t for (i = 0, n = clip.length; i < n; ++i) {\\n\\t\\t clip[i].e = startInside = !startInside;\\n\\t\\t }\\n\\n\\t\\t var start = subject[0],\\n\\t\\t points,\\n\\t\\t point;\\n\\n\\t\\t while (1) {\\n\\t\\t // Find first unvisited intersection.\\n\\t\\t var current = start,\\n\\t\\t isSubject = true;\\n\\t\\t while (current.v) if ((current = current.n) === start) return;\\n\\t\\t points = current.z;\\n\\t\\t stream.lineStart();\\n\\t\\t do {\\n\\t\\t current.v = current.o.v = true;\\n\\t\\t if (current.e) {\\n\\t\\t if (isSubject) {\\n\\t\\t for (i = 0, n = points.length; i < n; ++i) stream.point((point = points[i])[0], point[1]);\\n\\t\\t } else {\\n\\t\\t interpolate(current.x, current.n.x, 1, stream);\\n\\t\\t }\\n\\t\\t current = current.n;\\n\\t\\t } else {\\n\\t\\t if (isSubject) {\\n\\t\\t points = current.p.z;\\n\\t\\t for (i = points.length - 1; i >= 0; --i) stream.point((point = points[i])[0], point[1]);\\n\\t\\t } else {\\n\\t\\t interpolate(current.x, current.p.x, -1, stream);\\n\\t\\t }\\n\\t\\t current = current.p;\\n\\t\\t }\\n\\t\\t current = current.o;\\n\\t\\t points = current.z;\\n\\t\\t isSubject = !isSubject;\\n\\t\\t } while (!current.v);\\n\\t\\t stream.lineEnd();\\n\\t\\t }\\n\\t\\t }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3199b7890f371e561a7e6333a8db1e91\",\n \"score\": \"0.69278437\",\n \"text\": \"function intersectsPolygon(a, b) {\\n\\t\\t var p = a;\\n\\t\\t do {\\n\\t\\t if (p.i !== a.i && p.next.i !== a.i && p.i !== b.i && p.next.i !== b.i &&\\n\\t\\t intersects(p, p.next, a, b)) return true;\\n\\t\\t p = p.next;\\n\\t\\t } while (p !== a);\\n\\t\\n\\t\\t return false;\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"266cb139245441bb9652eaad5d18967d\",\n \"score\": \"0.68857735\",\n \"text\": \"function intersectsPolygon$4(a, b) {\\n var p = a;\\n do {\\n if (p.i !== a.i && p.next.i !== a.i && p.i !== b.i && p.next.i !== b.i &&\\n intersects$5(p, p.next, a, b)) return true;\\n p = p.next;\\n } while (p !== a);\\n\\n return false;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d9b5f2c4dfb3d1aefd90c2738d69cd88\",\n \"score\": \"0.68739295\",\n \"text\": \"function intersectsPolygon(a, b) {\\n var p = a;\\n do {\\n if (\\n p.i !== a.i &&\\n p.next.i !== a.i &&\\n p.i !== b.i &&\\n p.next.i !== b.i &&\\n intersects(p, p.next, a, b)\\n )\\n return true;\\n p = p.next;\\n } while (p !== a);\\n \\n return false;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"941b77d64b60b974b12df1acca6da288\",\n \"score\": \"0.68600774\",\n \"text\": \"function intersectsPolygon(a, b) {\\n\\t var p = a;\\n\\t do {\\n\\t if (p.i !== a.i && p.next.i !== a.i && p.i !== b.i && p.next.i !== b.i &&\\n\\t intersects(p, p.next, a, b)) { return true; }\\n\\t p = p.next;\\n\\t } while (p !== a);\\n\\n\\t return false;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"afc52f9728b7d30730f58d18a621d170\",\n \"score\": \"0.6850942\",\n \"text\": \"function intersectsPolygon(a, b) {\\n\\t var p = a;\\n\\t do {\\n\\t if (p.i !== a.i && p.next.i !== a.i && p.i !== b.i && p.next.i !== b.i &&\\n\\t intersects(p, p.next, a, b)) return true;\\n\\t p = p.next;\\n\\t } while (p !== a);\\n\\n\\t return false;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"afc52f9728b7d30730f58d18a621d170\",\n \"score\": \"0.6850942\",\n \"text\": \"function intersectsPolygon(a, b) {\\n\\t var p = a;\\n\\t do {\\n\\t if (p.i !== a.i && p.next.i !== a.i && p.i !== b.i && p.next.i !== b.i &&\\n\\t intersects(p, p.next, a, b)) return true;\\n\\t p = p.next;\\n\\t } while (p !== a);\\n\\n\\t return false;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"afc52f9728b7d30730f58d18a621d170\",\n \"score\": \"0.6850942\",\n \"text\": \"function intersectsPolygon(a, b) {\\n\\t var p = a;\\n\\t do {\\n\\t if (p.i !== a.i && p.next.i !== a.i && p.i !== b.i && p.next.i !== b.i &&\\n\\t intersects(p, p.next, a, b)) return true;\\n\\t p = p.next;\\n\\t } while (p !== a);\\n\\n\\t return false;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d30eae306db7056ed80cf30037140c3e\",\n \"score\": \"0.68361056\",\n \"text\": \"function intersectsPolygon(a, b) {\\n var p = a;\\n\\n do {\\n if (\\n p.i !== a.i &&\\n p.next.i !== a.i &&\\n p.i !== b.i &&\\n p.next.i !== b.i &&\\n intersects(p, p.next, a, b)\\n ) {\\n return true;\\n }\\n\\n p = p.next;\\n } while (p !== a);\\n\\n return false;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"26258cc70da989d50e2c0e0528e82644\",\n \"score\": \"0.6832306\",\n \"text\": \"function intersectsPolygon(a, b) {\\n var p = a;\\n do {\\n if (p.i !== a.i && p.next.i !== a.i && p.i !== b.i && p.next.i !== b.i && intersects(p, p.next, a, b))\\n { return true; }\\n p = p.next;\\n } while (p !== a);\\n return false;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a848519d141d0d630564ab25d08e660f\",\n \"score\": \"0.6832048\",\n \"text\": \"function PolyIntersect(polyArray)\\n{\\n var pUnion = polyArray[0]; //Using npm Polygon.clip package\\n for(var p in polyArray)\\n {\\n var pC = clip(p);\\n pUnion = pC.clip(pUnion, 'union');\\n }\\n return pUnion;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a96b2f2cf4c3fc0d69ca7284228754a8\",\n \"score\": \"0.6827409\",\n \"text\": \"function intersectsPolygon(a, b) {\\n\\t var p = a;\\n\\t do {\\n\\t if (p.i !== a.i && p.next.i !== a.i && p.i !== b.i && p.next.i !== b.i &&\\n\\t intersects(p, p.next, a, b)) return true;\\n\\t p = p.next;\\n\\t } while (p !== a);\\n\\t\\n\\t return false;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a96b2f2cf4c3fc0d69ca7284228754a8\",\n \"score\": \"0.6827409\",\n \"text\": \"function intersectsPolygon(a, b) {\\n\\t var p = a;\\n\\t do {\\n\\t if (p.i !== a.i && p.next.i !== a.i && p.i !== b.i && p.next.i !== b.i &&\\n\\t intersects(p, p.next, a, b)) return true;\\n\\t p = p.next;\\n\\t } while (p !== a);\\n\\t\\n\\t return false;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e64d583bfe0830fcd8ecd4d527ce86af\",\n \"score\": \"0.6812073\",\n \"text\": \"function clipPolygon(segments, compareIntersection, startInside, interpolate, stream) {\\n \\t var subject = [],\\n \\t clip = [],\\n \\t i,\\n \\t n;\\n\\n \\t segments.forEach(function(segment) {\\n \\t if ((n = segment.length - 1) <= 0) return;\\n \\t var n, p0 = segment[0], p1 = segment[n], x;\\n\\n \\t // If the first and last points of a segment are coincident, then treat as a\\n \\t // closed ring. TODO if all rings are closed, then the winding order of the\\n \\t // exterior ring should be checked.\\n \\t if (pointEqual(p0, p1)) {\\n \\t stream.lineStart();\\n \\t for (i = 0; i < n; ++i) stream.point((p0 = segment[i])[0], p0[1]);\\n \\t stream.lineEnd();\\n \\t return;\\n \\t }\\n\\n \\t subject.push(x = new Intersection(p0, segment, null, true));\\n \\t clip.push(x.o = new Intersection(p0, null, x, false));\\n \\t subject.push(x = new Intersection(p1, segment, null, false));\\n \\t clip.push(x.o = new Intersection(p1, null, x, true));\\n \\t });\\n\\n \\t if (!subject.length) return;\\n\\n \\t clip.sort(compareIntersection);\\n \\t link(subject);\\n \\t link(clip);\\n\\n \\t for (i = 0, n = clip.length; i < n; ++i) {\\n \\t clip[i].e = startInside = !startInside;\\n \\t }\\n\\n \\t var start = subject[0],\\n \\t points,\\n \\t point;\\n\\n \\t while (1) {\\n \\t // Find first unvisited intersection.\\n \\t var current = start,\\n \\t isSubject = true;\\n \\t while (current.v) if ((current = current.n) === start) return;\\n \\t points = current.z;\\n \\t stream.lineStart();\\n \\t do {\\n \\t current.v = current.o.v = true;\\n \\t if (current.e) {\\n \\t if (isSubject) {\\n \\t for (i = 0, n = points.length; i < n; ++i) stream.point((point = points[i])[0], point[1]);\\n \\t } else {\\n \\t interpolate(current.x, current.n.x, 1, stream);\\n \\t }\\n \\t current = current.n;\\n \\t } else {\\n \\t if (isSubject) {\\n \\t points = current.p.z;\\n \\t for (i = points.length - 1; i >= 0; --i) stream.point((point = points[i])[0], point[1]);\\n \\t } else {\\n \\t interpolate(current.x, current.p.x, -1, stream);\\n \\t }\\n \\t current = current.p;\\n \\t }\\n \\t current = current.o;\\n \\t points = current.z;\\n \\t isSubject = !isSubject;\\n \\t } while (!current.v);\\n \\t stream.lineEnd();\\n \\t }\\n \\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bd95efb666483b8552b6384445bbe025\",\n \"score\": \"0.67967457\",\n \"text\": \"function intersectsPolygon ( a, b )\\r\\n {\\r\\n var p = a;\\r\\n do\\r\\n {\\r\\n if ( p.i !== a.i && p.next.i !== a.i && p.i !== b.i && p.next.i !== b.i &&\\r\\n intersects( p, p.next, a, b ) ) {return true;}\\r\\n p = p.next;\\r\\n } while ( p !== a );\\r\\n\\r\\n return false;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"531d4e77ae5f81db56a9c8c4281d0473\",\n \"score\": \"0.67937934\",\n \"text\": \"function intersectsPolygon( a, b ) {\\n\\n \\tvar p = a;\\n \\tdo {\\n\\n \\t\\tif ( p.i !== a.i && p.next.i !== a.i && p.i !== b.i && p.next.i !== b.i &&\\n \\t\\t\\t\\tintersects( p, p.next, a, b ) ) return true;\\n \\t\\tp = p.next;\\n\\n \\t} while ( p !== a );\\n\\n \\treturn false;\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3c7960ef67450b5e5a23f259cb4a79c4\",\n \"score\": \"0.6773428\",\n \"text\": \"function intersectsPolygon(a, b) {\\n var p = a;\\n do {\\n if (p.i !== a.i && p.next.i !== a.i && p.i !== b.i && p.next.i !== b.i &&\\n intersects(p, p.next, a, b)) return true;\\n p = p.next;\\n } while (p !== a);\\n\\n return false;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3c7960ef67450b5e5a23f259cb4a79c4\",\n \"score\": \"0.6773428\",\n \"text\": \"function intersectsPolygon(a, b) {\\n var p = a;\\n do {\\n if (p.i !== a.i && p.next.i !== a.i && p.i !== b.i && p.next.i !== b.i &&\\n intersects(p, p.next, a, b)) return true;\\n p = p.next;\\n } while (p !== a);\\n\\n return false;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3c7960ef67450b5e5a23f259cb4a79c4\",\n \"score\": \"0.6773428\",\n \"text\": \"function intersectsPolygon(a, b) {\\n var p = a;\\n do {\\n if (p.i !== a.i && p.next.i !== a.i && p.i !== b.i && p.next.i !== b.i &&\\n intersects(p, p.next, a, b)) return true;\\n p = p.next;\\n } while (p !== a);\\n\\n return false;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3c7960ef67450b5e5a23f259cb4a79c4\",\n \"score\": \"0.6773428\",\n \"text\": \"function intersectsPolygon(a, b) {\\n var p = a;\\n do {\\n if (p.i !== a.i && p.next.i !== a.i && p.i !== b.i && p.next.i !== b.i &&\\n intersects(p, p.next, a, b)) return true;\\n p = p.next;\\n } while (p !== a);\\n\\n return false;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3c7960ef67450b5e5a23f259cb4a79c4\",\n \"score\": \"0.6773428\",\n \"text\": \"function intersectsPolygon(a, b) {\\n var p = a;\\n do {\\n if (p.i !== a.i && p.next.i !== a.i && p.i !== b.i && p.next.i !== b.i &&\\n intersects(p, p.next, a, b)) return true;\\n p = p.next;\\n } while (p !== a);\\n\\n return false;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3c7960ef67450b5e5a23f259cb4a79c4\",\n \"score\": \"0.6773428\",\n \"text\": \"function intersectsPolygon(a, b) {\\n var p = a;\\n do {\\n if (p.i !== a.i && p.next.i !== a.i && p.i !== b.i && p.next.i !== b.i &&\\n intersects(p, p.next, a, b)) return true;\\n p = p.next;\\n } while (p !== a);\\n\\n return false;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3c7960ef67450b5e5a23f259cb4a79c4\",\n \"score\": \"0.6773428\",\n \"text\": \"function intersectsPolygon(a, b) {\\n var p = a;\\n do {\\n if (p.i !== a.i && p.next.i !== a.i && p.i !== b.i && p.next.i !== b.i &&\\n intersects(p, p.next, a, b)) return true;\\n p = p.next;\\n } while (p !== a);\\n\\n return false;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3c7960ef67450b5e5a23f259cb4a79c4\",\n \"score\": \"0.6773428\",\n \"text\": \"function intersectsPolygon(a, b) {\\n var p = a;\\n do {\\n if (p.i !== a.i && p.next.i !== a.i && p.i !== b.i && p.next.i !== b.i &&\\n intersects(p, p.next, a, b)) return true;\\n p = p.next;\\n } while (p !== a);\\n\\n return false;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3c7960ef67450b5e5a23f259cb4a79c4\",\n \"score\": \"0.6773428\",\n \"text\": \"function intersectsPolygon(a, b) {\\n var p = a;\\n do {\\n if (p.i !== a.i && p.next.i !== a.i && p.i !== b.i && p.next.i !== b.i &&\\n intersects(p, p.next, a, b)) return true;\\n p = p.next;\\n } while (p !== a);\\n\\n return false;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3c7960ef67450b5e5a23f259cb4a79c4\",\n \"score\": \"0.6773428\",\n \"text\": \"function intersectsPolygon(a, b) {\\n var p = a;\\n do {\\n if (p.i !== a.i && p.next.i !== a.i && p.i !== b.i && p.next.i !== b.i &&\\n intersects(p, p.next, a, b)) return true;\\n p = p.next;\\n } while (p !== a);\\n\\n return false;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3c7960ef67450b5e5a23f259cb4a79c4\",\n \"score\": \"0.6773428\",\n \"text\": \"function intersectsPolygon(a, b) {\\n var p = a;\\n do {\\n if (p.i !== a.i && p.next.i !== a.i && p.i !== b.i && p.next.i !== b.i &&\\n intersects(p, p.next, a, b)) return true;\\n p = p.next;\\n } while (p !== a);\\n\\n return false;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3c7960ef67450b5e5a23f259cb4a79c4\",\n \"score\": \"0.6773428\",\n \"text\": \"function intersectsPolygon(a, b) {\\n var p = a;\\n do {\\n if (p.i !== a.i && p.next.i !== a.i && p.i !== b.i && p.next.i !== b.i &&\\n intersects(p, p.next, a, b)) return true;\\n p = p.next;\\n } while (p !== a);\\n\\n return false;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3c7960ef67450b5e5a23f259cb4a79c4\",\n \"score\": \"0.6773428\",\n \"text\": \"function intersectsPolygon(a, b) {\\n var p = a;\\n do {\\n if (p.i !== a.i && p.next.i !== a.i && p.i !== b.i && p.next.i !== b.i &&\\n intersects(p, p.next, a, b)) return true;\\n p = p.next;\\n } while (p !== a);\\n\\n return false;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3c7960ef67450b5e5a23f259cb4a79c4\",\n \"score\": \"0.6773428\",\n \"text\": \"function intersectsPolygon(a, b) {\\n var p = a;\\n do {\\n if (p.i !== a.i && p.next.i !== a.i && p.i !== b.i && p.next.i !== b.i &&\\n intersects(p, p.next, a, b)) return true;\\n p = p.next;\\n } while (p !== a);\\n\\n return false;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3c7960ef67450b5e5a23f259cb4a79c4\",\n \"score\": \"0.6773428\",\n \"text\": \"function intersectsPolygon(a, b) {\\n var p = a;\\n do {\\n if (p.i !== a.i && p.next.i !== a.i && p.i !== b.i && p.next.i !== b.i &&\\n intersects(p, p.next, a, b)) return true;\\n p = p.next;\\n } while (p !== a);\\n\\n return false;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3c7960ef67450b5e5a23f259cb4a79c4\",\n \"score\": \"0.6773428\",\n \"text\": \"function intersectsPolygon(a, b) {\\n var p = a;\\n do {\\n if (p.i !== a.i && p.next.i !== a.i && p.i !== b.i && p.next.i !== b.i &&\\n intersects(p, p.next, a, b)) return true;\\n p = p.next;\\n } while (p !== a);\\n\\n return false;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3c7960ef67450b5e5a23f259cb4a79c4\",\n \"score\": \"0.6773428\",\n \"text\": \"function intersectsPolygon(a, b) {\\n var p = a;\\n do {\\n if (p.i !== a.i && p.next.i !== a.i && p.i !== b.i && p.next.i !== b.i &&\\n intersects(p, p.next, a, b)) return true;\\n p = p.next;\\n } while (p !== a);\\n\\n return false;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3c7960ef67450b5e5a23f259cb4a79c4\",\n \"score\": \"0.6773428\",\n \"text\": \"function intersectsPolygon(a, b) {\\n var p = a;\\n do {\\n if (p.i !== a.i && p.next.i !== a.i && p.i !== b.i && p.next.i !== b.i &&\\n intersects(p, p.next, a, b)) return true;\\n p = p.next;\\n } while (p !== a);\\n\\n return false;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3c7960ef67450b5e5a23f259cb4a79c4\",\n \"score\": \"0.6773428\",\n \"text\": \"function intersectsPolygon(a, b) {\\n var p = a;\\n do {\\n if (p.i !== a.i && p.next.i !== a.i && p.i !== b.i && p.next.i !== b.i &&\\n intersects(p, p.next, a, b)) return true;\\n p = p.next;\\n } while (p !== a);\\n\\n return false;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3c7960ef67450b5e5a23f259cb4a79c4\",\n \"score\": \"0.6773428\",\n \"text\": \"function intersectsPolygon(a, b) {\\n var p = a;\\n do {\\n if (p.i !== a.i && p.next.i !== a.i && p.i !== b.i && p.next.i !== b.i &&\\n intersects(p, p.next, a, b)) return true;\\n p = p.next;\\n } while (p !== a);\\n\\n return false;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3f85d475581d1c0df8bcaa69d6fe7385\",\n \"score\": \"0.67687804\",\n \"text\": \"function checkPolygonPolygonIntersections(pol0, pol1){\\n\\tvar intersections = [];\\n\\tfor(var i=0, j=pol0.length-1; i= 0 ? min : 0.1;\\n\\n if (this.isInside(poly)) {\\n return [this];\\n }\\n\\n clip.AddPaths(sp1, ptyp.ptSubject, true);\\n clip.AddPaths(sp2, ptyp.ptClip, true);\\n\\n if (clip.Execute(ctyp.ctIntersection, ctre, cfil.pftNonZero, cfil.pftNonZero)) {\\n let inter = POLY\\n .fromClipperTreeUnion(ctre, poly.getZ(), minarea)\\n // .filter(p => p.isEquivalent(this) || p.isInside(this))\\n .filter(p => p.isInside(this));\\n return inter;\\n }\\n\\n return null;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"346327bcbcae036811d183ab263a6fd3\",\n \"score\": \"0.653041\",\n \"text\": \"function intersectsPolygon( a, b ) {\\n\\n\\tvar p = a;\\n\\n\\tdo {\\n\\n\\t\\tif ( p.i !== a.i && p.next.i !== a.i && p.i !== b.i && p.next.i !== b.i &&\\n\\t\\t\\t\\t\\t\\tintersects( p, p.next, a, b ) ) {\\n\\n\\t\\t\\treturn true;\\n\\n\\t\\t}\\n\\n\\t\\tp = p.next;\\n\\n\\t} while ( p !== a );\\n\\n\\treturn false;\\n\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"346327bcbcae036811d183ab263a6fd3\",\n \"score\": \"0.653041\",\n \"text\": \"function intersectsPolygon( a, b ) {\\n\\n\\tvar p = a;\\n\\n\\tdo {\\n\\n\\t\\tif ( p.i !== a.i && p.next.i !== a.i && p.i !== b.i && p.next.i !== b.i &&\\n\\t\\t\\t\\t\\t\\tintersects( p, p.next, a, b ) ) {\\n\\n\\t\\t\\treturn true;\\n\\n\\t\\t}\\n\\n\\t\\tp = p.next;\\n\\n\\t} while ( p !== a );\\n\\n\\treturn false;\\n\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"346327bcbcae036811d183ab263a6fd3\",\n \"score\": \"0.653041\",\n \"text\": \"function intersectsPolygon( a, b ) {\\n\\n\\tvar p = a;\\n\\n\\tdo {\\n\\n\\t\\tif ( p.i !== a.i && p.next.i !== a.i && p.i !== b.i && p.next.i !== b.i &&\\n\\t\\t\\t\\t\\t\\tintersects( p, p.next, a, b ) ) {\\n\\n\\t\\t\\treturn true;\\n\\n\\t\\t}\\n\\n\\t\\tp = p.next;\\n\\n\\t} while ( p !== a );\\n\\n\\treturn false;\\n\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"346327bcbcae036811d183ab263a6fd3\",\n \"score\": \"0.653041\",\n \"text\": \"function intersectsPolygon( a, b ) {\\n\\n\\tvar p = a;\\n\\n\\tdo {\\n\\n\\t\\tif ( p.i !== a.i && p.next.i !== a.i && p.i !== b.i && p.next.i !== b.i &&\\n\\t\\t\\t\\t\\t\\tintersects( p, p.next, a, b ) ) {\\n\\n\\t\\t\\treturn true;\\n\\n\\t\\t}\\n\\n\\t\\tp = p.next;\\n\\n\\t} while ( p !== a );\\n\\n\\treturn false;\\n\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"346327bcbcae036811d183ab263a6fd3\",\n \"score\": \"0.653041\",\n \"text\": \"function intersectsPolygon( a, b ) {\\n\\n\\tvar p = a;\\n\\n\\tdo {\\n\\n\\t\\tif ( p.i !== a.i && p.next.i !== a.i && p.i !== b.i && p.next.i !== b.i &&\\n\\t\\t\\t\\t\\t\\tintersects( p, p.next, a, b ) ) {\\n\\n\\t\\t\\treturn true;\\n\\n\\t\\t}\\n\\n\\t\\tp = p.next;\\n\\n\\t} while ( p !== a );\\n\\n\\treturn false;\\n\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6b31cafa5aa5979bccf3e7832bd03e92\",\n \"score\": \"0.64700776\",\n \"text\": \"function linePolygonIntersect(a1x, a1y, a2x, a2y, points) {\\n for (var i = 0, p2 = points[points.length - 1]; i < points.length; i++) {\\n var p = points[i];\\n\\n if (lineLineIntersect(a1x, a1y, a2x, a2y, p[0], p[1], p2[0], p2[1])) {\\n return true;\\n }\\n\\n p2 = p;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8edaa6470b94a53e65d9c88e2af61a66\",\n \"score\": \"0.63777554\",\n \"text\": \"function do_polygons_collide(poly1, poly2) {\\n // Use the SAT theorem for determining if the two convex polygons collide.\\n return no_separation_axis(poly1, poly2) && no_separation_axis(poly2, poly1);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7423752e9f22e8869e9841c44d6f9047\",\n \"score\": \"0.63772386\",\n \"text\": \"parseGeom(geometry){\\n let polyLineCollection = [];\\n let polyLineCollectionOtherWorld = [];\\n let edgeOfMap = 10 \\n let leftEdge=false // close to left edge\\n let rightEdge = false // close to right edge\\n \\n // convert \\n geometry.coordinates.forEach(feature => {\\n feature.forEach(polygon => {\\n let lineCoord = {\\n \\\"type\\\": \\\"LineString\\\",\\n \\\"coordinates\\\": []\\n }\\n let lineCoordCopy = {\\n \\\"type\\\": \\\"LineString\\\",\\n \\\"coordinates\\\": []\\n }\\n let crossed22 = false\\n for(let i=0; i < polygon.length; i++){\\n let coordinates = polygon[i]\\n if ((coordinates[0] < -179.99 || coordinates[0] > 179.99) && lineCoord.coordinates.length) {\\n if(lineCoord.coordinates.length > 1){\\n polyLineCollection.push(lineCoord)\\n if (crossed22) {\\n lineCoordCopy = {\\n \\\"type\\\": \\\"LineString\\\",\\n \\\"coordinates\\\": []\\n }\\n // eslint-disable-next-line \\n lineCoord.coordinates.forEach((coordinates) => {\\n lineCoordCopy.coordinates.push([coordinates[0] - 360, coordinates[1]])\\n })\\n polyLineCollectionOtherWorld.push(lineCoordCopy)\\n }\\n }\\n lineCoord = {\\n \\\"type\\\": \\\"LineString\\\",\\n \\\"coordinates\\\": []\\n }\\n }\\n if (coordinates[0] > -179.99 && coordinates[0] < 179.99) {\\n lineCoord.coordinates.push(coordinates)\\n if (coordinates[0] > 22.5) crossed22 = true\\n if (coordinates[0] > 180 - edgeOfMap) rightEdge = true\\n if (coordinates[0] < -180 + edgeOfMap) leftEdge = true\\n }\\n else{\\n if(i+1 < polygon.length && polygon[i+1][0] > -179.99 && polygon[i+1][0] < 179.99){\\n lineCoord.coordinates.push(coordinates)\\n }\\n }\\n \\n }\\n\\n polyLineCollection.push(lineCoord)\\n if (crossed22) {\\n lineCoordCopy = {\\n \\\"type\\\": \\\"LineString\\\",\\n \\\"coordinates\\\": []\\n }\\n lineCoord.coordinates.forEach(coordinates => {\\n lineCoordCopy.coordinates.push([coordinates[0] - 360, coordinates[1]])\\n })\\n polyLineCollectionOtherWorld.push(lineCoordCopy)\\n }\\n })\\n });\\n \\n if(rightEdge && leftEdge){ // if its close to both edges draw on both sides of map\\n polyLineCollectionOtherWorld.forEach(line =>{\\n polyLineCollection.push(line)\\n })\\n }\\n let lines = polyLineCollection.map((p)=>{\\n return p.coordinates\\n })\\n let result = {\\n type: 'MultiLineString',\\n coordinates : lines\\n }\\n return result\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"31a96509b730cd0cda3b73d8dd5222f0\",\n \"score\": \"0.63668406\",\n \"text\": \"function simplifyPolygon(points) {\\n\\t\\tif (points.length < 4) {\\n\\t\\t\\treturn null;\\n\\t\\t}\\n\\n\\t\\tvar slices = [];\\n\\t\\tvar bestSlice = null;\\n\\t\\tvar addPoint = null;\\n\\t\\tfunction updateBestSlice(begin, end, intersection) {\\n\\t\\t\\tif (!bestSlice) {\\n\\t\\t\\t\\t// First slice, so it's the best slice so far\\n\\t\\t\\t\\tbestSlice = [begin, end];\\n\\t\\t\\t\\taddPoint = intersection;\\n\\t\\t\\t} else {\\n\\t\\t\\t\\t// Check if this slice overlaps a known intersecting slice\\n\\t\\t\\t\\tvar overlaps = false;\\n\\t\\t\\t\\tfor (var i = 0; i < slices.length; ++i) {\\n\\t\\t\\t\\t\\tif (begin <= slices[i][1] && slices[i][0] <= end) {\\n\\t\\t\\t\\t\\t\\toverlaps = true;\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tif (!overlaps && (end - begin) > bestSlice[1] - bestSlice[0]) {\\n\\t\\t\\t\\t\\t/* Does not contain a subslice with an intersection, and\\n\\t\\t\\t\\t\\t contains more points than the best slice, so this is our\\n\\t\\t\\t\\t\\t new best slice. Using actual distance rather than\\n\\t\\t\\t\\t\\t number of points may make more sense here, but this\\n\\t\\t\\t\\t\\t seems to work well and is much less expensive. */\\n\\t\\t\\t\\t\\tbestSlice = [begin, end];\\n\\t\\t\\t\\t\\taddPoint = intersection;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\t// Add to slices list for overlap checking next time around\\n\\t\\t\\tslices.push([begin, end]);\\n\\t\\t}\\n\\n\\t\\tfor (var i = 0; i < points.length - 3; ++i) {\\n\\t\\t\\tvar p0 = points[i];\\n\\t\\t\\tvar p1 = points[i + 1];\\n\\n\\t\\t\\tvar foundIntersection = false;\\n\\t\\t\\tfor (var j = i + 2; j < points.length - 1 && !foundIntersection; ++j) {\\n\\t\\t\\t\\tvar p2 = points[j];\\n\\t\\t\\t\\tvar p3 = points[j + 1];\\n\\n\\t\\t\\t\\t// Check for an actual line intersection\\n\\t\\t\\t\\tvar intersection = lineIntersection(p0, p1, p2, p3);\\n\\t\\t\\t\\tif (intersection) {\\n\\t\\t\\t\\t\\tupdateBestSlice(i, j, intersection);\\n\\t\\t\\t\\t\\tfoundIntersection = true;\\n\\t\\t\\t\\t} else if (j > i + 4) {\\n\\t\\t\\t\\t\\t// Check if endpoints are close enough to be considered intersecting\\n\\t\\t\\t\\t\\tif (distance(p0.x, p0.y, p2.x, p2.y) <= polyDistance) {\\n\\t\\t\\t\\t\\t\\tupdateBestSlice(i, j, null);\\n\\t\\t\\t\\t\\t\\tfoundIntersection = true;\\n\\t\\t\\t\\t\\t} else if (distance(p1.x, p1.y, p2.x, p2.y) <= polyDistance) {\\n\\t\\t\\t\\t\\t\\tupdateBestSlice(i + 1, j, null);\\n\\t\\t\\t\\t\\t\\tfoundIntersection = true;\\n\\t\\t\\t\\t\\t} else if (distance(p0.x, p0.y, p3.x, p3.y) <= polyDistance) {\\n\\t\\t\\t\\t\\t\\tupdateBestSlice(i, j + 1, null);\\n\\t\\t\\t\\t\\t\\tfoundIntersection = true;\\n\\t\\t\\t\\t\\t} else if (distance(p1.x, p1.y, p3.x, p3.y) <= polyDistance) {\\n\\t\\t\\t\\t\\t\\tupdateBestSlice(i + 1, j + 1, null);\\n\\t\\t\\t\\t\\t\\tfoundIntersection = true;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\tif (foundIntersection) {\\n\\t\\t\\t\\t// Found an intersection, so no point in checking overlapping intervals\\n\\t\\t\\t\\ti = j;\\n\\t\\t\\t\\tfoundIntersection = false;\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tif (bestSlice) {\\n\\t\\t\\tvar poly = points.slice(bestSlice[0], bestSlice[1]);\\n\\t\\t\\tif (addPoint) {\\n\\t\\t\\t\\tpoly.push(addPoint);\\n\\t\\t\\t}\\n\\t\\t\\treturn poly;\\n\\t\\t}\\n\\n\\t\\treturn null;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e5f3603664f19fbb5870dad04e5f0d6b\",\n \"score\": \"0.63302964\",\n \"text\": \"function collided_polygon_polygon(polygonA, polygonB) {\\n // NB: the clipping library expects polygons to be explicitly closed lists of pairs of numbers\\n let A = polygonA.concat(polygonA[0]);\\n let B = polygonB.concat(polygonB[0]);\\n /* Note that the clipping library expects geometry of the form [number, number][][] \\n * The reason is that it works with multipolygons, where rings after the first represent holes \\n */\\n let result = GreinerHormann.intersection([A], [B]);\\n /* I have no idea why, but sometimes the intersection function rejects with a null, and sometimes it rejects with an empty array \\n * ¯\\\\_(ツ)_/¯\\n */\\n return result !== null && result.length > 0;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2408c09f15ba9593380b463adc24f7ce\",\n \"score\": \"0.6319244\",\n \"text\": \"intersect(p1, p2, p3, p4, dir) {\\n let x1 = p1.x\\n let y1 = p1.y\\n let x2 = p2.x\\n let y2 = p2.y\\n let x3 = p3.x\\n let y3 = p3.y\\n let x4 = p4.x\\n let y4 = p4.y\\n\\n let denom = ((y4-y3) * (x2-x1)) - ((x4-x3) * (y2-y1))\\n if (denom != 0) {\\n let ua = (((x4-x3) * (y1-y3)) - ((y4-y3) * (x1-x3))) / denom\\n if ((ua >= 0) && (ua <= 1)) {\\n let ub = (((x2-x1) * (y1-y3)) - ((y2-y1) * (x1-x3))) / denom\\n if ((ub >= 0) && (ub <= 1)) {\\n var x = x1 + (ua * (x2-x1))\\n var y = y1 + (ua * (y2-y1))\\n return { x: x, y: y, dir: dir }\\n }\\n }\\n }\\n return null\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"82d9cd6fe6fbf66f444de52ff5f4f9ea\",\n \"score\": \"0.63071746\",\n \"text\": \"static intersection(hs: Halfspace[]): Polytope { throw new NotImplementedError(); }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e565a0a0e86a9751b9658619edba4734\",\n \"score\": \"0.6271381\",\n \"text\": \"static slice(poly, intersections) {\\n // if (intersections.length <= 1) return [poly];\\n if (intersections.length == 2) return this.sliceSimplePolygonIntersection( poly, intersections);\\n if (intersections.length > 2) return this.sliceComplexPolygonIntersection(poly, intersections);\\n return [poly];\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e0108084ce711af04879ff4d6129951e\",\n \"score\": \"0.6256869\",\n \"text\": \"function d3_geom_polygonIntersect(c, d, a, b) {\\n var x1 = c[0], x2 = d[0], x3 = a[0], x4 = b[0],\\n y1 = c[1], y2 = d[1], y3 = a[1], y4 = b[1],\\n x13 = x1 - x3,\\n x21 = x2 - x1,\\n x43 = x4 - x3,\\n y13 = y1 - y3,\\n y21 = y2 - y1,\\n y43 = y4 - y3,\\n ua = (x43 * y13 - y43 * x13) / (y43 * x21 - x43 * y21);\\n return [x1 + ua * x21, y1 + ua * y21];\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0866e1cbb40820930258369d439db548\",\n \"score\": \"0.6256282\",\n \"text\": \"function replicaPoly(p1){\\n \\nvar p2 = p1.map(function (p) {return [p[0], p[1], p[2]-4]});\\nvar p3 = p2.map(function (p) {return [p[0], p[1], p[2]-4]});\\nvar p4 = p3.map(function (p) {return [p[0], p[1], p[2]-4]});\\nvar p5 = p4.map(function (p) {return [p[0], p[1], p[2]-4]});\\nvar p6 = p5.map(function (p) {return [p[0], p[1], p[2]-4]});\\nvar p7 = p6.map(function (p) {return [p[0], p[1], p[2]-4]});\\nvar p8 = p7.map(function (p) {return [p[0], p[1], p[2]-4]});\\n\\nvar poly1 = POLYLINE(p1);\\nvar poly2 = POLYLINE(p2);\\nvar poly3 = POLYLINE(p3);\\nvar poly4 = POLYLINE(p4);\\nvar poly5 = POLYLINE(p5);\\nvar poly6 = POLYLINE(p6);\\nvar poly7 = POLYLINE(p7);\\nvar poly8 = POLYLINE(p8);\\nvar str_poly =STRUCT([poly1,poly2,poly3,poly4,poly5,poly6,poly7,poly8]);\\nDRAW(str_poly);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ff24118afc4364f15044b029ade2841d\",\n \"score\": \"0.62405753\",\n \"text\": \"function determineIntersect(userShapes)\\n{\\n for (var i = 0; i < userShapes.length; i++){\\n var userShape = userShapes[i];\\n for (var j = 0; j < tracts.features.length; j++){\\n var tract = tracts.features[j];\\n var intersection = turf.intersect(userShape, tract['geometry']);\\n if (intersection != null){\\n tract.properties.intersection = true;\\n var tractArea = turf.area(tract);\\n var intersectionArea = turf.area(intersection);\\n tract.properties.overlap = intersectionArea / tractArea;\\n }\\n }\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"546205f0cc7c185eba2a6fbad1f6f5d5\",\n \"score\": \"0.6211785\",\n \"text\": \"createPolygon(cornerPoints) {\\n // Shorthand varibles\\n let cs = game.cellSize; // Cell width and height are always the same\\n\\n // Prepare the point data\\n let pointsObj = {};\\n\\n for (let i = 0; i < cornerPoints.length; i++) {\\n let key = cornerPoints[i][0] + \\\"_\\\" + cornerPoints[i][1];\\n if (pointsObj[key]) {\\n pointsObj[key]++;\\n } else {\\n pointsObj[key] = 1;\\n }\\n\\n if (pointsObj[key] == 4)\\n delete pointsObj[key]; // Remove internal points (which have four instances)\\n }\\n\\n // Make a point set from point object (removes duplicates)\\n let pointsSet = new Set(Object.keys(pointsObj).map(key => key));\\n\\n // Convert the set of strings into an array of numbers\\n let points = [];\\n for (let value of pointsSet)\\n points.push(value.split(\\\"_\\\").map(Number));\\n\\n // Find the polygon points of the shape\\n let polygonArray = [];\\n let firstPoint = points[0];\\n\\n // Add the first point to polygon\\n polygonArray.push(firstPoint);\\n let lastAddedPoint = firstPoint;\\n points.splice(0, 1); // Remove the first point\\n\\n // Does the points array contain this point\\n function hasPoint(x, y) {\\n for (let p of points)\\n if (p[0] === x && p[1] === y)\\n return true;\\n return false;\\n }\\n\\n // Helper function used inside the loop\\n function addNextPolygonPoint(horDir, verDir) {\\n let x = lastAddedPoint[0] + horDir * cs;\\n let y = lastAddedPoint[1] + verDir * cs;\\n\\n if (firstPoint[0] === x && firstPoint[1] === y) {\\n polygonDone = true;\\n return true;\\n }\\n\\n // Special case if direction is up\\n // Do not go up if there is a cell on the left\\n if (verDir === -1) {\\n if (hasPoint(x - cs, y) && hasPoint(x - cs, y + cs))\\n return false;\\n }\\n\\n for (let i = 0; i < points.length; i++) {\\n if (x === points[i][0] && y === points[i][1]) {\\n polygonArray.push(points[i]); // Next point\\n lastAddedPoint = points[i];\\n points.splice(i, 1); // Remove the added point\\n return true; // Found and added\\n }\\n }\\n return false; // Not found\\n }\\n\\n let polygonDone = false;\\n let i = 0; // Counter\\n while (!polygonDone) {\\n\\n if (++i > 50) {\\n if (points.length !== 0)\\n console.log(\\\"Bad Shape! Points left.\\\");\\n console.log(\\\"Bad Shape! Max iterations of 50 reached.\\\");\\n polygonDone = true; // Just of safety. This should never happen with correct shapes!\\n }\\n\\n // Above\\n if (addNextPolygonPoint(0, -1))\\n continue;\\n\\n // Right\\n if (addNextPolygonPoint(1, 0))\\n continue;\\n\\n // Below\\n if (addNextPolygonPoint(0, 1))\\n continue;\\n\\n // Right\\n if (addNextPolygonPoint(-1, 0))\\n continue;\\n\\n }\\n\\n /*\\n // Debug. Draw the points and order\\n for (let i = 0; i < polygonArray.length; i++) {\\n let circle = game.s.circle(polygonArray[i][0], polygonArray[i][1], 4);\\n circle.attr({\\n fill: \\\"red\\\"\\n });\\n let text = game.s.text(polygonArray[i][0] + 5, polygonArray[i][1] - 5, i + 1);\\n }\\n */\\n return polygonArray;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"84240d8a2aa6727de3e6fb2dc40810f8\",\n \"score\": \"0.61476344\",\n \"text\": \"function calcIntersect(vertices){\\r\\n var newArr = [];\\r\\n var count = 0;\\r\\n \\r\\n for(var i = 0; i<12; i++) newArr.push(vertices[i]); \\r\\n\\r\\n //Calculate the intersecting circle using points with matching z axis from \\r\\n //each of the 4 unit circles forming 2 connecting cylinders.\\r\\n for(var i = 0; i < (points.length-2)*24; i++){\\r\\n var Ax = vertices[i].x; var Ay = vertices[i].y;\\r\\n var Bx = vertices[i+12].x; var By = vertices[i+12].y;\\r\\n var Cx = vertices[i+24].x; var Cy = vertices[i+24].y;\\r\\n var Dx = vertices[i+36].x; var Dy = vertices[i+36].y;\\r\\n \\r\\n var a = Bx - Ax; var d = Dy - Cy;\\r\\n var b = Dx - Cx; var e = Cx - Ax;\\r\\n var c = By - Ay; var f = Cy - Ay;\\r\\n\\r\\n var h = (1/(a*d-b*c))*(d*e+(-b)*f);\\r\\n \\r\\n var Lx = Ax+(Bx-Ax)*h; \\r\\n var Ly = Ay+(By-Ay)*h;\\r\\n \\r\\n newArr.push(new coord(Lx,Ly,vertices[i+12].z)); \\r\\n\\r\\n if((i+1)%12 == 0){\\r\\n i+=12;\\r\\n }\\r\\n }\\r\\n \\r\\n for(var i = 12; i>0; i--) newArr.push(vertices[vertices.length-i]);\\r\\n \\r\\n //Duplicate each vertex for flat shading\\r\\n var arr = newArr;\\r\\n newArr = [];\\r\\n for(var i = 0; i < arr.length; i++){\\r\\n newArr.push(arr[i]);\\r\\n if(i!=0 && i%12 != 0){ \\r\\n newArr.push(arr[i]);\\r\\n }\\r\\n if(i!=0 && (i+1)%12 == 0){\\r\\n newArr.push(arr[i-11]);\\r\\n //change the last one to not duplicate if its the last set. HOW TO!?\\r\\n if(count!=0 && count%2!=0 && (count/2) < points.length-2) i-=12;\\r\\n count++; \\r\\n }\\r\\n } \\r\\n \\r\\n return newArr;\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d01e56e327ac5aca505c47fbfeaa7f06\",\n \"score\": \"0.61339337\",\n \"text\": \"_intersectPolytope(other: T): T {\\n return other.constructor.intersection([...this.halfspaces, ...other.halfspaces]);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d10de95f114c7a59314cf0cd8ef03060\",\n \"score\": \"0.6100022\",\n \"text\": \"function splitone(shape, p0, p1) {\\n var l = shape.length;\\n var isect_indecies = [];\\n var newPoints = [];\\n\\n // Find intersection points\\n for (let i = 0; i < l; i++) {\\n newPoints.push(shape[i]);\\n begin_index = i;\\n end_index = ((i + 1) % l);\\n\\n print(\\\"testing p\\\" + begin_index + \\\" - p\\\" + end_index);\\n\\n let newp = lineLine(p0.x, p0.y, p1.x, p1.y,\\n shape[begin_index].x, shape[begin_index].y,\\n shape[end_index].x, shape[end_index].y)\\n\\n if (newp) {\\n newPoints.push(newp);\\n isect_indecies.push(i + 1 + isect_indecies.length);\\n }\\n }\\n\\n // If the line intersects with the shape, make resultant shapes. \\n // TODO, more complicated is this shape negative space of the other shape logic\\n if (isect_indecies.length) {\\n\\n let newShapeArrays = [];\\n newShapeArrays[0] = [];\\n\\n let start = isect_indecies[0]\\n for (let i = start; i < newPoints.length + start; ++i) {\\n let index = i % newPoints.length\\n let thisPoint = newPoints[index]\\n\\n // Add this point to the last shape\\n newShapeArrays[newShapeArrays.length - 1].push(thisPoint)\\n\\n // If this point is an intersection, make a new array, and begin it with this point.\\n if (isect_indecies.indexOf(index) != -1) {\\n let a = []\\n a.push(thisPoint);\\n newShapeArrays.push(a);\\n }\\n }\\n\\n let fix = newShapeArrays.shift();\\n newShapeArrays[newShapeArrays.length - 1].push(fix[0]);\\n\\n // subshapeinfo[j] == the shape I belong to.\\n subshapeinfo = new Map();\\n for (let i = 0; i < newShapeArrays.length; i++) {\\n for (let j = 0; j < newShapeArrays.length; j++) {\\n if (i != j) {\\n if (isSubShape(newShapeArrays[i], newShapeArrays[j])) {\\n subshapeinfo.set(j, i);\\n }\\n }\\n }\\n }\\n finalShapeArrays = []\\n\\n newShapeArrays.forEach(function(item, index) {\\n let finalshape = item;\\n\\n // if this shape index is a key in the map,\\n // don't do anything with it.\\n if (subshapeinfo.has(index)) {} else {\\n subshapeinfo.forEach(function(value, key, map) {\\n if (index == value) {\\n finalshape = finalshape.concat(newShapeArrays[key])\\n }\\n })\\n f = deepCopyShape(finalshape)\\n finalShapeArrays.push(f)\\n }\\n // if this shape index appears as a value for any keys in the map,\\n // concatinate those shapes onto this shape.\\n })\\n\\n //\\n // Some debug code:\\n\\n finalShapeArrays.forEach(function(item, index) {\\n print(\\\"SHAPE \\\" + index + \\\"!!!!!\\\");\\n shiftShape(item, 10, true);\\n shapeArrayDraw(item);\\n })\\n\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1c82e28a87f4b6943012ac8a219e0e2f\",\n \"score\": \"0.6084591\",\n \"text\": \"function splitPolygon (geoPts)\\r\\n{\\r\\n var retPolys = []\\r\\n \\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"501a2a9f59ce976623deeb2cc6822231\",\n \"score\": \"0.60716444\",\n \"text\": \"function get_line_intersection(p0_x, p0_y, p1_x, p1_y, \\r\\n\\t\\tp2_x, p2_y, p3_x, p3_y) {\\r\\n\\t\\t\\r\\n\\t\\tvar inter_points = {\\r\\n\\t\\t\\tinter_x: null,\\r\\n\\t\\t\\tinter_y: null \\r\\n\\t\\t}\\r\\n\\t\\t\\r\\n\\t\\tvar s1_x, s1_y, s2_x, s2_y;\\r\\n\\t\\ts1_x = p1_x - p0_x; \\r\\n\\t\\ts1_y = p1_y - p0_y;\\r\\n\\t\\ts2_x = p3_x - p2_x; \\r\\n\\t\\ts2_y = p3_y - p2_y;\\r\\n\\r\\n\\t\\tvar s, t;\\r\\n\\t\\ts = (-s1_y * (p0_x - p2_x) + s1_x * (p0_y - p2_y)) / (-s2_x * s1_y + s1_x * s2_y);\\r\\n\\t\\tt = ( s2_x * (p0_y - p2_y) - s2_y * (p0_x - p2_x)) / (-s2_x * s1_y + s1_x * s2_y);\\r\\n\\r\\n\\t\\tif (s >= 0 && s <= 1 && t >= 0 && t <= 1)\\r\\n\\t\\t{\\r\\n\\t\\t\\t// Collision detected\\r\\n\\t\\t\\tinter_points.inter_x = p0_x + (t * s1_x);\\r\\n\\t\\t\\tinter_points.inter_y = p0_y + (t * s1_y);\\r\\n\\t\\t\\treturn inter_points; \\r\\n\\t\\t}\\r\\n\\r\\n\\t\\treturn 0; // No collision\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3525f858161b747d9007281bd83a8e58\",\n \"score\": \"0.60589087\",\n \"text\": \"function patchIntersects(intersections, event) {\\n const {\\n internal\\n } = store.getState(); // If the interaction is captured, make all capturing targets part of the\\n // intersect.\\n\\n if ('pointerId' in event && internal.capturedMap.has(event.pointerId)) {\\n for (let captureData of internal.capturedMap.get(event.pointerId).values()) {\\n intersections.push(captureData.intersection);\\n }\\n }\\n\\n return intersections;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b82f08560b69e9e5e5954ddd25f825dd\",\n \"score\": \"0.6057803\",\n \"text\": \"function generateIntersections(intersectionDatas){\\n var x = [], y = [], r = [];\\n for(var i=0;i<3;i++){\\n x[i] = intersectionDatas['x'][i];\\n y[i] = intersectionDatas['y'][i];\\n r[i] = intersectionDatas['r'][i];\\n //console.log('x : '+x[i]+' y : '+y[i]+' r : '+r[i]);\\n }\\n var interPoints = [];\\n interPoints[0] = intersection(x[0], y[0], r[0], x[1], y[1], r[1]);\\n interPoints[1] = intersection(x[1], y[1], r[1], x[2], y[2], r[2]);\\n interPoints[2] = intersection(x[0], y[0], r[0], x[2], y[2], r[2]);\\n\\n //We need to send the radius data too\\n interPoints[3] = r[0];\\n interPoints[4] = r[1];\\n interPoints[5] = r[2];\\n\\n //If there is an intersection\\n if(interPoints[0] && interPoints[1] && interPoints[2]){\\n return interPoints;\\n }\\n return false;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"11cf1733125f41521f6338425074815b\",\n \"score\": \"0.6053105\",\n \"text\": \"clip() {\\n if (!this.visible)\\n return;\\n if (this.shapesManager == null)\\n return;\\n const A = new math.Vector2();\\n const C = new math.Vector2();\\n const b = this.shapesManager.getWorldBounds();\\n const xmin = b[0];\\n const ymin = b[1];\\n const xmax = b[2];\\n const ymax = b[3];\\n const pts = (new java.util.ArrayList());\\n const line = geom.Conic2D.TMP_SEGMENT_$LI$();\\n line.set$math_Vector2$math_Vector2(A.set$double$double(xmin, ymin), C.set$double$double(xmin, ymax));\\n let intersections = this.intersections(line);\\n for (let index = 0; index < intersections.length; index++) {\\n let d = intersections[index];\\n pts.add(d);\\n }\\n line.set$math_Vector2$math_Vector2(A.set$double$double(xmin, ymax), C.set$double$double(xmax, ymax));\\n intersections = this.intersections(line);\\n for (let index = 0; index < intersections.length; index++) {\\n let d = intersections[index];\\n pts.add(d);\\n }\\n line.set$math_Vector2$math_Vector2(A.set$double$double(xmax, ymax), C.set$double$double(xmax, ymin));\\n intersections = this.intersections(line);\\n for (let index = 0; index < intersections.length; index++) {\\n let d = intersections[index];\\n pts.add(d);\\n }\\n line.set$math_Vector2$math_Vector2(A.set$double$double(xmax, ymin), C.set$double$double(xmin, ymin));\\n intersections = this.intersections(line);\\n for (let index = 0; index < intersections.length; index++) {\\n let d = intersections[index];\\n pts.add(d);\\n }\\n const posBranch = (new java.util.ArrayList());\\n const negBranch = (new java.util.ArrayList());\\n for (let index = pts.iterator(); index.hasNext();) {\\n let t = index.next();\\n {\\n if (Math.abs(t) < 1)\\n posBranch.add(t);\\n else\\n negBranch.add(1 / t);\\n }\\n }\\n java.util.Collections.sort(posBranch);\\n java.util.Collections.sort(negBranch);\\n if (posBranch.size() > 1) {\\n this.clipt0 = posBranch.get(0);\\n this.clipt1 = posBranch.get(posBranch.size() - 1);\\n }\\n else {\\n this.clipt0 = 0;\\n this.clipt1 = 0;\\n }\\n if (negBranch.size() > 1) {\\n this.clipt2 = negBranch.get(0);\\n this.clipt3 = negBranch.get(negBranch.size() - 1);\\n }\\n else {\\n this.clipt2 = 1;\\n this.clipt3 = 1;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e21fcdc5979bb47a75612ba94924c185\",\n \"score\": \"0.60433304\",\n \"text\": \"function clipPolygon(coordinates) {\\n var polygons = [],\\n ring = [],\\n unvisited = 0, // number of unvisited entering intersections\\n intersections = [];\\n // Clip each ring into segments.\\n var segments = [];\\n coordinates.forEach(function(ring) {\\n var ringSegments = clipLine(ring);\\n // Since these are closed rings, we join segments if necessary.\\n var n = ringSegments.length;\\n if (n > 1) {\\n var firstSegment = ringSegments[0],\\n lastSegment = ringSegments[n - 1],\\n p0 = firstSegment[0],\\n p1 = lastSegment[lastSegment.length - 1];\\n if (p0[0] === p1[0] && p0[1] === p1[1]) {\\n ringSegments.shift();\\n ringSegments.pop();\\n ringSegments.push(lastSegment.concat(firstSegment));\\n }\\n }\\n segments = segments.concat(ringSegments);\\n });\\n // Create a circular linked list using the intersected segment start and\\n // end points, sorted by relative angles.\\n segments.forEach(function(segment) {\\n var p0 = segment[0],\\n p1 = segment[segment.length - 1];\\n if (p0[0] !== p1[0] || p0[1] !== p1[1]) {\\n var b = {xyz: clipCartesian(p1, center), points: []},\\n a = {xyz: clipCartesian(p0, center), points: segment, other: b};\\n intersections.push(a, b);\\n unvisited++;\\n } else {\\n // TODO attach subsumed holes to the correct Polygons. For now, we can\\n // add these as separate Polygons, since typically we draw everything\\n // as a subpath in SVG so it doesn't matter if the holes don't match\\n // their polygons. This would be done by calculating some kind of\\n // winding number.\\n polygons.push([segment]);\\n }\\n });\\n if (!unvisited) return polygons;\\n // Sort intersection points by relative angles.\\n intersections.forEach(function(intersection, i) {\\n intersection.angle = angle(intersection.xyz, reference);\\n });\\n var start = intersections[0];\\n intersections.sort(function(a, b) {\\n return b.angle - a.angle;\\n });\\n // Construct circular linked list.\\n for (var i = 0; i < intersections.length;) {\\n intersections[i].next = intersections[++i % intersections.length];\\n }\\n while (unvisited) {\\n // Look for unvisited entering intersections.\\n while (start.visited || !start.other) start = start.next;\\n var intersection = start;\\n do {\\n intersection.visited = true;\\n ring = ring.concat(intersection.points);\\n intersection = intersection.other;\\n var from = intersection.angle;\\n intersection = intersection.next;\\n var to = intersection.angle;\\n ring = ring.concat(interpolate(from, to));\\n unvisited--;\\n } while (intersection !== start);\\n if (ring.length) {\\n polygons.push([ring]);\\n ring = [];\\n }\\n start = start.next;\\n }\\n return polygons;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"01b5201bf2a7bc49a9e0886751b7a6dc\",\n \"score\": \"0.6040053\",\n \"text\": \"function insidePolygon(P, transformed) {\\n var ref = crossProduct(transformed[transformed.length-1], transformed[0], P);\\n for (var i = 0; i < transformed.length-1; i++) {\\n if (vec3.dot(ref, crossProduct(transformed[i], transformed[i+1], P)) <= 0) {\\n //// no intersection if P on the line of an edge (when crossProduct==0)\\n return false;\\n }\\n } \\n return true;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b5e0e008021a424206c2f3662e824ed1\",\n \"score\": \"0.6036691\",\n \"text\": \"function detect_collision(corner, polygon) {\\n var x = corner[0], y = corner[1]; \\n var found = false;\\n for (var i = 0, j = polygon.length - 1; i < polygon.length; j = i++) {\\n var xi = polygon[i][0], yi = polygon[i][1];\\n var xj = polygon[j][0], yj = polygon[j][1];\\n \\n var intersection = ((yi > y) != (yj > y))\\n && (x < (xj - xi) * (y - yi) / (yj - yi) + xi);\\n if (intersection){\\n found = !found;\\n } \\n } \\n return found;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fac94367bddab2ec7e8745465b846bd9\",\n \"score\": \"0.603625\",\n \"text\": \"function computeIntersections(px,py,lx,ly)\\r\\n\\t{\\r\\n\\t var X=Array();\\r\\n\\r\\n\\t var A=ly[1]-ly[0];\\t //A=y2-y1\\r\\n\\t\\tvar B=lx[0]-lx[1];\\t //B=x1-x2\\r\\n\\t\\tvar C=lx[0]*(ly[0]-ly[1]) +\\r\\n\\t\\t ly[0]*(lx[1]-lx[0]);\\t//C=x1*(y1-y2)+y1*(x2-x1)\\r\\n\\r\\n\\t\\tvar bx = bezierCoeffs(px[0],px[1],px[2],px[3]);\\r\\n\\t\\tvar by = bezierCoeffs(py[0],py[1],py[2],py[3]);\\r\\n\\r\\n\\t var P = Array();\\r\\n\\t\\tP[0] = A*bx[0]+B*by[0];\\t\\t/*t^3*/\\r\\n\\t\\tP[1] = A*bx[1]+B*by[1];\\t\\t/*t^2*/\\r\\n\\t\\tP[2] = A*bx[2]+B*by[2];\\t\\t/*t*/\\r\\n\\t\\tP[3] = A*bx[3]+B*by[3] + C;\\t/*1*/\\r\\n\\r\\n\\t\\tvar r=cubicRoots(P);\\r\\n\\r\\n\\t /*verify the roots are in bounds of the linear segment*/\\r\\n\\t for (var i=0;i<3;i++)\\r\\n\\t {\\r\\n\\t\\tt=r[i];\\r\\n\\r\\n\\t\\tX[0]=bx[0]*t*t*t+bx[1]*t*t+bx[2]*t+bx[3];\\r\\n\\t\\tX[1]=by[0]*t*t*t+by[1]*t*t+by[2]*t+by[3];\\r\\n\\r\\n\\t\\t/*above is intersection point assuming infinitely long line segment,\\r\\n\\t\\t make sure we are also in bounds of the line*/\\r\\n\\t\\tvar s;\\r\\n\\t\\tif ((lx[1]-lx[0])!=0) /*if not vertical line*/\\r\\n\\t\\t s=(X[0]-lx[0])/(lx[1]-lx[0]);\\r\\n\\t\\telse\\r\\n\\t\\t s=(X[1]-ly[0])/(ly[1]-ly[0]);\\r\\n\\r\\n\\t\\t/*in bounds?*/\\r\\n\\t\\tif (t<0 || t>1.0 || s<0 || s>1.0)\\r\\n\\t\\t{\\r\\n\\t\\t X[0]=-100; /*move off screen*/\\r\\n\\t\\t X[1]=-100;\\r\\n\\t\\t}\\r\\n\\r\\n\\t\\t/*move intersection point*/\\r\\n\\t\\tI[i].setAttributeNS(null,\\\"cx\\\",X[0]);\\r\\n\\t\\tI[i].setAttributeNS(null,\\\"cy\\\",X[1]);\\r\\n\\t }\\r\\n\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a912310a7ceb1823814b3f47949f264a\",\n \"score\": \"0.603405\",\n \"text\": \"cut(polys, inter) {\\n let target = this;\\n\\n if (!target.open) {\\n target = this.clone(true).setOpen();\\n target.push(target.first());\\n if (target.inner) {\\n target.inner.forEach(ip => {\\n ip.setOpen();\\n ip.push(ip.first());\\n });\\n }\\n }\\n\\n let clip = new clib.Clipper(),\\n ctre = new clib.PolyTree(),\\n type = inter ? ctyp.ctIntersection : ctyp.ctDifference,\\n sp1 = target.toClipper(),\\n sp2 = POLY.toClipper(polys);\\n\\n clip.AddPaths(sp1, ptyp.ptSubject, false);\\n clip.AddPaths(sp2, ptyp.ptClip, true);\\n\\n if (clip.Execute(type, ctre, cfil.pftEvenOdd, cfil.pftEvenOdd)) {\\n let cuts = POLY.fromClipperTree(ctre, target.getZ(), null, null, 0);\\n cuts.forEach(no => {\\n // heal open but really closed polygons because cutting\\n // has to open the poly to perform the cut. but the result\\n // may have been no intersection leaving an open poly\\n if (no.open && no.first().distTo2D(no.last()) < 0.001) {\\n no.open = false;\\n no.points.pop();\\n }\\n no.depth = this.depth;\\n });\\n return cuts;\\n } else {\\n return null;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"75cf313ddc816514af86c36d06a7bbc7\",\n \"score\": \"0.60271895\",\n \"text\": \"function offsetPolygon( polygon, offset, output ){\\n var tmp = [];\\n var points = polygon.points;\\n var count = points.length;\\n for(var j = 0; j < count; j++){\\n\\n // finds the previous, current and next point\\n var i = (j - 1);\\n if (i < 0) i += count;\\n var k = (j + 1) % count;\\n\\n var pre = points[ i ];\\n var cur = points[ j ];\\n var nex = points[ k ];\\n\\n //create 2 lines, parallel to both edges at a given distance 'offset'\\n\\n //computes a normal vector to the direction of the: prev -> current edge of length offset\\n var l1 = distance(cur, pre);\\n var n1 = [\\n -( ( cur[1] - pre[1] ) / l1 ) * offset,\\n ( ( cur[0] - pre[0] ) / l1 ) * offset\\n ];\\n\\n //does the same for the : current -> next edge\\n var l2 = distance(cur, nex);\\n var n2 = [\\n -( ( nex[1] - cur[1] ) / l2 ) * offset,\\n ( ( nex[0] - cur[0] ) / l2 ) * offset\\n ];\\n\\n //and create 2 points at both ends of the edge to obtain a parallel line\\n var p1 = [ pre[0]+n1[0], pre[1]+n1[1]];\\n var p2 = [ cur[0]+n1[0], cur[1]+n1[1]];\\n var p3 = [ cur[0]+n2[0], cur[1]+n2[1]];\\n var p4 = [ nex[0]+n2[0], nex[1]+n2[1]];\\n\\n // console.log( p1, p2, p3, p4 );\\n var ip = lineIntersection( p1, p2, p3, p4 );\\n if( ip != null ) {\\n tmp.push( ip );\\n }\\n\\n }\\n polygon.points = tmp;\\n return tmp;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b0673ac6dc75b02ee7cd4c3cc13cee67\",\n \"score\": \"0.6025368\",\n \"text\": \"clip() {\\n if (!this.visible)\\n return;\\n if (this.shapesManager == null)\\n return;\\n const A = new math.Vector2();\\n const C = new math.Vector2();\\n const b = this.shapesManager.getWorldBounds();\\n const xmin = b[0];\\n const ymin = b[1];\\n const xmax = b[2];\\n const ymax = b[3];\\n const pts = (new java.util.ArrayList());\\n const line = geom.Conic2D.TMP_SEGMENT_$LI$();\\n line.set$math_Vector2$math_Vector2(A.set$double$double(xmin, ymin), C.set$double$double(xmin, ymax));\\n let intersections = this.intersections(line);\\n for (let index = 0; index < intersections.length; index++) {\\n let d = intersections[index];\\n pts.add(d);\\n }\\n line.set$math_Vector2$math_Vector2(A.set$double$double(xmin, ymax), C.set$double$double(xmax, ymax));\\n intersections = this.intersections(line);\\n for (let index = 0; index < intersections.length; index++) {\\n let d = intersections[index];\\n pts.add(d);\\n }\\n line.set$math_Vector2$math_Vector2(A.set$double$double(xmax, ymax), C.set$double$double(xmax, ymin));\\n intersections = this.intersections(line);\\n for (let index = 0; index < intersections.length; index++) {\\n let d = intersections[index];\\n pts.add(d);\\n }\\n line.set$math_Vector2$math_Vector2(A.set$double$double(xmax, ymin), C.set$double$double(xmin, ymin));\\n intersections = this.intersections(line);\\n for (let index = 0; index < intersections.length; index++) {\\n let d = intersections[index];\\n pts.add(d);\\n }\\n if (pts.size() > 1) {\\n java.util.Collections.sort(pts);\\n this.clipt0 = pts.get(0);\\n this.clipt1 = pts.get(pts.size() - 1);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"54bfb487192aec563900ccd57632c27e\",\n \"score\": \"0.60164773\",\n \"text\": \"clip() {\\n if (!this.visible)\\n return;\\n this.clipt0 = 0;\\n this.clipt1 = 2 * Math.PI;\\n if (this.shapesManager == null)\\n return;\\n let A = new math.Vector2();\\n const C = new math.Vector2();\\n const b = this.shapesManager.getWorldBounds();\\n const xmin = b[0];\\n const ymin = b[1];\\n const xmax = b[2];\\n const ymax = b[3];\\n const pts = (new java.util.ArrayList());\\n const line = geom.Conic2D.TMP_SEGMENT_$LI$();\\n line.set$math_Vector2$math_Vector2(A.set$double$double(xmin, ymin), C.set$double$double(xmin, ymax));\\n let intersections = this.intersections(line);\\n for (let index = 0; index < intersections.length; index++) {\\n let d = intersections[index];\\n pts.add(d);\\n }\\n line.set$math_Vector2$math_Vector2(A.set$double$double(xmin, ymax), C.set$double$double(xmax, ymax));\\n intersections = this.intersections(line);\\n for (let index = 0; index < intersections.length; index++) {\\n let d = intersections[index];\\n pts.add(d);\\n }\\n line.set$math_Vector2$math_Vector2(A.set$double$double(xmax, ymax), C.set$double$double(xmax, ymin));\\n intersections = this.intersections(line);\\n for (let index = 0; index < intersections.length; index++) {\\n let d = intersections[index];\\n pts.add(d);\\n }\\n line.set$math_Vector2$math_Vector2(A.set$double$double(xmax, ymin), C.set$double$double(xmin, ymin));\\n intersections = this.intersections(line);\\n for (let index = 0; index < intersections.length; index++) {\\n let d = intersections[index];\\n pts.add(d);\\n }\\n if (pts.size() === 2) {\\n java.util.Collections.sort(pts);\\n this.clipt0 = pts.get(0);\\n this.clipt1 = pts.get(pts.size() - 1);\\n let t = (this.clipt0 + this.clipt1) / 2;\\n A = this.point(t);\\n if (xmin >= A.x || xmax <= A.x || ymin >= A.y || ymax <= A.y) {\\n t = this.clipt0;\\n this.clipt0 = this.clipt1;\\n this.clipt1 = t + 2 * Math.PI - this.clipt1 + this.clipt0;\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"856069753d0ffc45c9379d1a2eea7171\",\n \"score\": \"0.60014707\",\n \"text\": \"getLineIntersections (a, b) {\\n const l = [{}, {}]\\n l[0].y = a + b * this.upperLeft.x\\n l[0].y = Math.max(l[0].y, this.upperLeft.y)\\n l[0].y = Math.min(l[0].y, this.bottomRight.y)\\n l[0].x = (l[0].y - a) / b\\n\\n l[1].y = a + b * this.bottomRight.x\\n l[1].y = Math.max(l[1].y, this.upperLeft.y)\\n l[1].y = Math.min(l[1].y, this.bottomRight.y)\\n l[1].x = (l[1].y - a) / b\\n return l\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a79717569a0289853c9f3fa2824de464\",\n \"score\": \"0.59907234\",\n \"text\": \"function PolygonOverlap(p1, p2)\\n{\\n var points = p2.toArray();\\n for(var v in points)\\n {\\n if(p1.containsPoint(v))\\n return true;\\n }\\n return false;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2f0f7a73de430d2ea12d4a3b55beaba3\",\n \"score\": \"0.5986664\",\n \"text\": \"intersects(other: Region): boolean {\\n for (let p of other.polytopes) {\\n if (!this.intersect(p).isEmpty) return true;\\n }\\n return false;\\n }\",\n \"title\": \"\"\n }\n]"}}},{"rowIdx":951763,"cells":{"query_id":{"kind":"string","value":"1a16346c58b65dde3933a0e96c3e8ead"},"query":{"kind":"string","value":"Set New Slideshow Ad Properties"},"positive_passages":{"kind":"list like","value":[{"docid":"55e37799fdf628b8db6595a3f8c0bc48","score":"0.0","text":"function replaceOrd(adCallPrefix, ordNew) {\n var adCallHtml = '';\n\n if ($(\"div[data-prefix|='\" + adCallPrefix + \"']\") != null) {\n\n $(\"div[data-prefix|='\" + adCallPrefix + \"'] * iframe\").length ? adCallHtml = $(\"div[data-prefix|='\" + adCallPrefix + \"'] * iframe\")[0].src : adCallHtml = unescapeHtml($(\"div[data-prefix|='\" + adCallPrefix + \"']\").html()); //get ad call string from DOM\n var ordExp = new RegExp('ord=(.*)\\?', 'gi'); //\n adCallHtml = adCallHtml.replace(ordExp, 'ord=' + ordNew + \"?\");\n\n }\n\n return adCallHtml;\n}","title":""}],"string":"[\n {\n \"docid\": \"55e37799fdf628b8db6595a3f8c0bc48\",\n \"score\": \"0.0\",\n \"text\": \"function replaceOrd(adCallPrefix, ordNew) {\\n var adCallHtml = '';\\n\\n if ($(\\\"div[data-prefix|='\\\" + adCallPrefix + \\\"']\\\") != null) {\\n\\n $(\\\"div[data-prefix|='\\\" + adCallPrefix + \\\"'] * iframe\\\").length ? adCallHtml = $(\\\"div[data-prefix|='\\\" + adCallPrefix + \\\"'] * iframe\\\")[0].src : adCallHtml = unescapeHtml($(\\\"div[data-prefix|='\\\" + adCallPrefix + \\\"']\\\").html()); //get ad call string from DOM\\n var ordExp = new RegExp('ord=(.*)\\\\?', 'gi'); //\\n adCallHtml = adCallHtml.replace(ordExp, 'ord=' + ordNew + \\\"?\\\");\\n\\n }\\n\\n return adCallHtml;\\n}\",\n \"title\": \"\"\n }\n]"},"negative_passages":{"kind":"list like","value":[{"docid":"673dff68e9b9ac060fa39f6e625bdda4","score":"0.72938085","text":"function set_digitalData_slideshow_ad() {\n\tdigitalData.slideshowAdEvent = true;\n}","title":""},{"docid":"5893aa9a323920dde948536517d27667","score":"0.60257316","text":"function ManageSlide() {}","title":""},{"docid":"29b2ec0fe6605baf946e0291aeb70170","score":"0.5833029","text":"function startSlides() {\r\n\r\n\t//MULTIPLE FACTS New for the about page\r\n \tbuildControls();\r\n}","title":""},{"docid":"c79165dc2b5c58cbd1c1d372b61880fd","score":"0.5812064","text":"function AddSlide(slide) {\r\n \r\n }","title":""},{"docid":"be8427a3ba7d51b1dbee490a66f3a006","score":"0.57826704","text":"function setSlide(n) {\n SlideIndex = n;\n slideShow();\n}","title":""},{"docid":"659b071661d38a60aa1240af9012789b","score":"0.5730567","text":"initSlides() {\n this.container = $('[data-slideshow]');\n this.slides = this.container.find('img');\n this.slides.each((idx, slide) => $(slide).attr('data-slide', idx));\n }","title":""},{"docid":"ffe8d105464d57d0f931490f9423293e","score":"0.56841296","text":"setup(carouselWidth, slides, options) {\n this.setCarouselWidth(carouselWidth);\n this.setItems(slides);\n this._defineSlidesData();\n this.setOptions(options);\n this.settings = Object.assign({}, this._options);\n this.setOptionsForViewport();\n this._trigger('change', { property: { name: 'settings', value: this.settings } });\n this.invalidate('settings'); // must be call of this function;\n this._trigger('changed', { property: { name: 'settings', value: this.settings } });\n }","title":""},{"docid":"ffe8d105464d57d0f931490f9423293e","score":"0.56841296","text":"setup(carouselWidth, slides, options) {\n this.setCarouselWidth(carouselWidth);\n this.setItems(slides);\n this._defineSlidesData();\n this.setOptions(options);\n this.settings = Object.assign({}, this._options);\n this.setOptionsForViewport();\n this._trigger('change', { property: { name: 'settings', value: this.settings } });\n this.invalidate('settings'); // must be call of this function;\n this._trigger('changed', { property: { name: 'settings', value: this.settings } });\n }","title":""},{"docid":"b9331deb075aab186f5ea01766352b82","score":"0.56703436","text":"initSlides() {\n let arr = this.container.querySelectorAll(this.settings.slides)\n\n arr.forEach(slide => {\n let obj = {\n name: slide.dataset.name,\n container: slide,\n }\n this.slides.push(obj)\n })\n }","title":""},{"docid":"85b674f22a008a44e113a40ff1094948","score":"0.55887204","text":"function setSlides(n){\n slideNumber = n;\n showSlides(slideIndex);\n}","title":""},{"docid":"b5177caa5f3bdfb1893196a81808bcf7","score":"0.5572236","text":"function setHtmlObjectsProperties(){\n\t\t \n\t\t\tvar optionWidth = g_functions.getCssSizeParam(g_options.gallery_width);\n\t\t\t\n\t\t //set size\t\t\n\t\t var objCss = {\n\t\t\t\t //\"width\":optionWidth,\t\t//make it work within tabs\n\t\t\t\t \"max-width\":optionWidth,\n\t\t\t\t\t\"min-width\":g_functions.getCssSizeParam(g_options.gallery_min_width)\n\t\t\t};\n\t\t \n\t\t if(g_temp.isFreestyleMode == false){\n\t\t\t \n\t\t\t var galleryHeight = g_functions.getCssSizeParam(g_options.gallery_height);\n\t\t\t objCss[\"height\"] = galleryHeight;\n\t\t \n\t\t }else{\n\t\t\t objCss[\"overflow\"] = \"visible\";\t\t\t \n\t\t }\n\t\t \n\t\t //set background color\n\t\t if(g_options.gallery_background_color)\n\t\t\t objCss[\"background-color\"] = g_options.gallery_background_color;\n\t\t \n\t\t \n\t\t g_objWrapper.css(objCss);\n\t\t \n\t}","title":""},{"docid":"8d63a071ddae7d680d82317cee1c7a41","score":"0.5555695","text":"function autoShow() {\n plusSlides(1);\n setTimeout(autoShow, 30000); //Change slide every xx seconds\n}","title":""},{"docid":"d84ba565b32388b42c725e4d08581c7e","score":"0.5543197","text":"function Slideshow(options) {\n this._BANNER_NUM = 3;\n\n this.elem = options.elem;\n this.elem.onclick = this.onclick.bind(this);\n }","title":""},{"docid":"2e9027a33caf8d1b382255ac38d1beee","score":"0.550668","text":"addNewSlide () {\n const props = this.props\n const latestSettings = props.latestSettings\n const slides = latestSettings.slides || []\n props.dispatchEdition('slides', [...slides, {}])\n this.unactivateAllEditors()\n }","title":""},{"docid":"57c419d3ab75ab9bbb97438f9121da35","score":"0.5499885","text":"function init(slidesJson) {\n $.each(slidesJson, function(i, obj) {\n slideId = obj.pk;\n obj.fields.vanhentuu = moment(obj.fields.vanhentuu).format(\"DD/MM/YYYY-HH.mm.ss\");\n SLIDES[slideId] = slidesJson[i];\n });\n SLIDES[-1] = 'slide-trello';\n SLIDES[-2] = 'slide-restaurant';\n SLIDES[-3] = 'slide-events';\n }","title":""},{"docid":"754b06e68e907fd9bda0807da7cf658d","score":"0.5488033","text":"function setSlides(num){\n\n displaySlides(currentindex+=num) //updating which slides to display\n\n}","title":""},{"docid":"8ee8ebd6cc2274bde316c87017b74433","score":"0.5447762","text":"function addVideo() {\n myPresentation.getCurrentSlide().addVideo(inTxt.value);\n inTxt.value = \"\";\n}","title":""},{"docid":"faa8daccc7c9d288d1d9138f880a07e0","score":"0.5414887","text":"function Slidepanel( $element, options ) {\n this.$element = $element;\n this.options = $.extend( {}, defaults, options) ;\n this._defaults = defaults;\n this.init();\n }","title":""},{"docid":"8eff1685a70e69d142ee3f118496b749","score":"0.54118603","text":"function addSlide() {\n\t/* create a new slide object */\n\tvar slide = new SlideSet(nextSlideType);\n\tslideSetArray[numSlide] = slide;\n\tnumSlide = numSlide + 1;\n}","title":""},{"docid":"03cc913398ff4ca01525ddd3e119d4b2","score":"0.5400409","text":"function VisualSlideShow(a){if(a.effect&&a.effect.toLowerCase()==\"fade\"){a.effect=\"\"}var c=\"\";var b=/^(.*)visualslideshow\\.js$/;Array.each($$(\"script\"),function(i,g,f){if(b.test(i.src)){var h=b.exec(i.src);c=h[1]}});function e(g,f){document.write('