@flatten-js/core

<!DOCTYPE html> <html lang="en"> <head> <meta charset="utf-8"> <meta content="width=device-width,initial-scale=1" name="viewport"> <title>algorithms/boolean_op.js - Documentation</title> <script src="scripts/prettify/prettify.js"></script> <script src="scripts/prettify/lang-css.js"></script>  <link href="https://code.ionicframework.com/ionicons/2.0.1/css/ionicons.min.css" rel="stylesheet" type="text/css"> <link href="styles/prettify-tomorrow.css" rel="stylesheet" type="text/css"> <link href="styles/jsdoc-default.css" rel="stylesheet" type="text/css"> </head> <body> <input class="nav-trigger" id="nav-trigger" type="checkbox" /> <label class="navicon-button x" for="nav-trigger"> <div class="navicon"></div> </label> <label class="overlay" for="nav-trigger"></label> <nav> <li class="nav-link nav-home-link"><a href="index.html">Home</a></li><li class="nav-heading">Classes</li><li class="nav-heading">C<a href="Arc.html">Arc</a></li><li class="nav-item">F<a href="Arc.html#clone">clone</a></li><li class="nav-item">F<a href="Arc.html#contains">contains</a></li><li class="nav-item">F<a href="Arc.html#split">split</a></li><li class="nav-item">F<a href="Arc.html#middle">middle</a></li><li class="nav-item">F<a href="Arc.html#chordHeight">chordHeight</a></li><li class="nav-item">F<a href="Arc.html#intersect">intersect</a></li><li class="nav-item">F<a href="Arc.html#distanceTo">distanceTo</a></li><li class="nav-item">F<a href="Arc.html#breakToFunctional">breakToFunctional</a></li><li class="nav-item">F<a href="Arc.html#tangentInStart">tangentInStart</a></li><li class="nav-item">F<a href="Arc.html#tangentInEnd">tangentInEnd</a></li><li class="nav-item">F<a href="Arc.html#reverse">reverse</a></li><li class="nav-item">F<a href="Arc.html#translate">translate</a></li><li class="nav-item">F<a href="Arc.html#rotate">rotate</a></li><li class="nav-item">F<a href="Arc.html#scale">scale</a></li><li class="nav-item">F<a href="Arc.html#transform">transform</a></li><li class="nav-item">F<a href="Arc.html#sortPoints">sortPoints</a></li><li class="nav-item">F<a href="Arc.html#toJSON">toJSON</a></li><li class="nav-item">F<a href="Arc.html#svg">svg</a></li><li class="nav-heading">C<a href="Box.html">Box</a></li><li class="nav-item">F<a href="Box.html#clone">clone</a></li><li class="nav-item">F<a href="Box.html#not_intersect">not_intersect</a></li><li class="nav-item">F<a href="Box.html#intersect">intersect</a></li><li class="nav-item">F<a href="Box.html#merge">merge</a></li><li class="nav-item">F<a href="Box.html#less_than">less_than</a></li><li class="nav-item">F<a href="Box.html#equal_to">equal_to</a></li><li class="nav-item">F<a href="Box.html#set">set</a></li><li class="nav-item">F<a href="Box.html#toPoints">toPoints</a></li><li class="nav-item">F<a href="Box.html#toSegments">toSegments</a></li><li class="nav-item">F<a href="Box.html#svg">svg</a></li><li class="nav-heading">C<a href="Circle.html">Circle</a></li><li class="nav-item">F<a href="Circle.html#clone">clone</a></li><li class="nav-item">F<a href="Circle.html#contains">contains</a></li><li class="nav-item">F<a href="Circle.html#toArc">toArc</a></li><li class="nav-item">F<a href="Circle.html#intersect">intersect</a></li><li class="nav-item">F<a href="Circle.html#distanceTo">distanceTo</a></li><li class="nav-item">F<a href="Circle.html#toJSON">toJSON</a></li><li class="nav-item">F<a href="Circle.html#svg">svg</a></li><li class="nav-heading">C<a href="Edge.html">Edge</a></li><li class="nav-item">F<a href="Edge.html#middle">middle</a></li><li class="nav-item">F<a href="Edge.html#contains">contains</a></li><li class="nav-item">F<a href="Edge.html#setInclusion">setInclusion</a></li><li class="nav-item">F<a href="Edge.html#setOverlap">setOverlap</a></li><li class="nav-heading">C<a href="Face.html">Face</a></li><li class="nav-item">F<a href="Face.html#append">append</a></li><li class="nav-item">F<a href="Face.html#insert">insert</a></li><li class="nav-item">F<a href="Face.html#remove">remove</a></li><li class="nav-item">F<a href="Face.html#reverse">reverse</a></li><li class="nav-item">F<a href="Face.html#setArcLength">setArcLength</a></li><li class="nav-item">F<a href="Face.html#area">area</a></li><li class="nav-item">F<a href="Face.html#signedArea">signedArea</a></li><li class="nav-item">F<a href="Face.html#orientation">orientation</a></li><li class="nav-item">F<a href="Face.html#isSimple">isSimple</a></li><li class="nav-item">F<a href="Face.html#findEdgeByPoint">findEdgeByPoint</a></li><li class="nav-item">F<a href="Face.html#toPolygon">toPolygon</a></li><li class="nav-item">F<a href="Face.html#svg">svg</a></li><li class="nav-heading">C<a href="Line.html">Line</a></li><li class="nav-item">F<a href="Line.html#clone">clone</a></li><li class="nav-item">F<a href="Line.html#parallelTo">parallelTo</a></li><li class="nav-item">F<a href="Line.html#incidentTo">incidentTo</a></li><li class="nav-item">F<a href="Line.html#contains">contains</a></li><li class="nav-item">F<a href="Line.html#coord">coord</a></li><li class="nav-item">F<a href="Line.html#intersect">intersect</a></li><li class="nav-item">F<a href="Line.html#distanceTo">distanceTo</a></li><li class="nav-item">F<a href="Line.html#split">split</a></li><li class="nav-item">F<a href="Line.html#sortPoints">sortPoints</a></li><li class="nav-item">F<a href="Line.html#toJSON">toJSON</a></li><li class="nav-item">F<a href="Line.html#svg">svg</a></li><li class="nav-heading">C<a href="Matrix.html">Matrix</a></li><li class="nav-item">F<a href="Matrix.html#clone">clone</a></li><li class="nav-item">F<a href="Matrix.html#transform">transform</a></li><li class="nav-item">F<a href="Matrix.html#multiply">multiply</a></li><li class="nav-item">F<a href="Matrix.html#translate">translate</a></li><li class="nav-item">F<a href="Matrix.html#rotate">rotate</a></li><li class="nav-item">F<a href="Matrix.html#scale">scale</a></li><li class="nav-item">F<a href="Matrix.html#equalTo">equalTo</a></li><li class="nav-heading">C<a href="Multiline.html">Multiline</a></li><li class="nav-item">F<a href="Multiline.html#clone">clone</a></li><li class="nav-item">F<a href="Multiline.html#addVertex">addVertex</a></li><li class="nav-item">F<a href="Multiline.html#split">split</a></li><li class="nav-item">F<a href="Multiline.html#findEdgeByPoint">findEdgeByPoint</a></li><li class="nav-item">F<a href="Multiline.html#translate">translate</a></li><li class="nav-item">F<a href="Multiline.html#rotate">rotate</a></li><li class="nav-item">F<a href="Multiline.html#transform">transform</a></li><li class="nav-item">F<a href="Multiline.html#toShapes">toShapes</a></li><li class="nav-item">F<a href="Multiline.html#toJSON">toJSON</a></li><li class="nav-item">F<a href="Multiline.html#svg">svg</a></li><li class="nav-heading">C<a href="Point.html">Point</a></li><li class="nav-item">F<a href="Point.html#clone">clone</a></li><li class="nav-item">F<a href="Point.html#equalTo">equalTo</a></li><li class="nav-item">F<a href="Point.html#lessThan">lessThan</a></li><li class="nav-item">F<a href="Point.html#rotate">rotate</a></li><li class="nav-item">F<a href="Point.html#translate">translate</a></li><li class="nav-item">F<a href="Point.html#transform">transform</a></li><li class="nav-item">F<a href="Point.html#projectionOn">projectionOn</a></li><li class="nav-item">F<a href="Point.html#leftTo">leftTo</a></li><li class="nav-item">F<a href="Point.html#distanceTo">distanceTo</a></li><li class="nav-item">F<a href="Point.html#on">on</a></li><li class="nav-item">F<a href="Point.html#toJSON">toJSON</a></li><li class="nav-item">F<a href="Point.html#svg">svg</a></li><li class="nav-heading">C<a href="Polygon.html">Polygon</a></li><li class="nav-item">F<a href="Polygon.html#clone">clone</a></li><li class="nav-item">F<a href="Polygon.html#isEmpty">isEmpty</a></li><li class="nav-item">F<a href="Polygon.html#isValid">isValid</a></li><li class="nav-item">F<a href="Polygon.html#area">area</a></li><li class="nav-item">F<a href="Polygon.html#addFace">addFace</a></li><li class="nav-item">F<a href="Polygon.html#deleteFace">deleteFace</a></li><li class="nav-item">F<a href="Polygon.html#removeChain">removeChain</a></li><li class="nav-item">F<a href="Polygon.html#addVertex">addVertex</a></li><li class="nav-item">F<a href="Polygon.html#cut">cut</a></li><li class="nav-item">F<a href="Polygon.html#cutFace">cutFace</a></li><li class="nav-item">F<a href="Polygon.html#findEdgeByPoint">findEdgeByPoint</a></li><li class="nav-item">F<a href="Polygon.html#splitToIslands">splitToIslands</a></li><li class="nav-item">F<a href="Polygon.html#reverse">reverse</a></li><li class="nav-item">F<a href="Polygon.html#contains">contains</a></li><li class="nav-item">F<a href="Polygon.html#distanceTo">distanceTo</a></li><li class="nav-item">F<a href="Polygon.html#intersect">intersect</a></li><li class="nav-item">F<a href="Polygon.html#translate">translate</a></li><li class="nav-item">F<a href="Polygon.html#rotate">rotate</a></li><li class="nav-item">F<a href="Polygon.html#transform">transform</a></li><li class="nav-item">F<a href="Polygon.html#toJSON">toJSON</a></li><li class="nav-item">F<a href="Polygon.html#toArray">toArray</a></li><li class="nav-item">F<a href="Polygon.html#svg">svg</a></li><li class="nav-heading">C<a href="Ray.html">Ray</a></li><li class="nav-item">F<a href="Ray.html#clone">clone</a></li><li class="nav-item">F<a href="Ray.html#contains">contains</a></li><li class="nav-item">F<a href="Ray.html#split">split</a></li><li class="nav-item">F<a href="Ray.html#intersect">intersect</a></li><li class="nav-item">F<a href="Ray.html#svg">svg</a></li><li class="nav-heading">C<a href="Segment.html">Segment</a></li><li class="nav-item">F<a href="Segment.html#clone">clone</a></li><li class="nav-item">F<a href="Segment.html#equalTo">equalTo</a></li><li class="nav-item">F<a href="Segment.html#contains">contains</a></li><li class="nav-item">F<a href="Segment.html#intersect">intersect</a></li><li class="nav-item">F<a href="Segment.html#distanceTo">distanceTo</a></li><li class="nav-item">F<a href="Segment.html#tangentInStart">tangentInStart</a></li><li class="nav-item">F<a href="Segment.html#tangentInEnd">tangentInEnd</a></li><li class="nav-item">F<a href="Segment.html#reverse">reverse</a></li><li class="nav-item">F<a href="Segment.html#split">split</a></li><li class="nav-item">F<a href="Segment.html#middle">middle</a></li><li class="nav-item">F<a href="Segment.html#translate">translate</a></li><li class="nav-item">F<a href="Segment.html#rotate">rotate</a></li><li class="nav-item">F<a href="Segment.html#transform">transform</a></li><li class="nav-item">F<a href="Segment.html#isZeroLength">isZeroLength</a></li><li class="nav-item">F<a href="Segment.html#sortPoints">sortPoints</a></li><li class="nav-item">F<a href="Segment.html#toJSON">toJSON</a></li><li class="nav-item">F<a href="Segment.html#svg">svg</a></li><li class="nav-heading">C<a href="Vector.html">Vector</a></li><li class="nav-item">F<a href="Vector.html#clone">clone</a></li><li class="nav-item">F<a href="Vector.html#equalTo">equalTo</a></li><li class="nav-item">F<a href="Vector.html#multiply">multiply</a></li><li class="nav-item">F<a href="Vector.html#dot">dot</a></li><li class="nav-item">F<a href="Vector.html#cross">cross</a></li><li class="nav-item">F<a href="Vector.html#normalize">normalize</a></li><li class="nav-item">F<a href="Vector.html#rotate">rotate</a></li><li class="nav-item">F<a href="Vector.html#rotate90CCW">rotate90CCW</a></li><li class="nav-item">F<a href="Vector.html#rotate90CW">rotate90CW</a></li><li class="nav-item">F<a href="Vector.html#invert">invert</a></li><li class="nav-item">F<a href="Vector.html#add">add</a></li><li class="nav-item">F<a href="Vector.html#subtract">subtract</a></li><li class="nav-item">F<a href="Vector.html#angleTo">angleTo</a></li><li class="nav-item">F<a href="Vector.html#projectionOn">projectionOn</a></li><li class="nav-item">F<a href="Vector.html#toJSON">toJSON</a></li><li class="nav-heading">C<a href="CircularLinkedList.html">CircularLinkedList</a></li><li class="nav-item">F<a href="CircularLinkedList.html#append">append</a></li><li class="nav-item">F<a href="CircularLinkedList.html#insert">insert</a></li><li class="nav-item">F<a href="CircularLinkedList.html#remove">remove</a></li><li class="nav-heading">C<a href="DE9IM.html">DE9IM</a></li><li class="nav-item">F<a href="DE9IM.html#toString">toString</a></li><li class="nav-heading">C<a href="LinkedList.html">LinkedList</a></li><li class="nav-item">F<a href="LinkedList.html#toArray">toArray</a></li><li class="nav-item">F<a href="LinkedList.html#append">append</a></li><li class="nav-item">F<a href="LinkedList.html#insert">insert</a></li><li class="nav-item">F<a href="LinkedList.html#remove">remove</a></li><li class="nav-item">F<a href="LinkedList.html#isEmpty">isEmpty</a></li><li class="nav-item">F<a href="LinkedList.html#.testInfiniteLoop">testInfiniteLoop</a></li><li class="nav-heading">C<a href="PlanarSet.html">PlanarSet</a></li><li class="nav-item">F<a href="PlanarSet.html#add">add</a></li><li class="nav-item">F<a href="PlanarSet.html#delete">delete</a></li><li class="nav-item">F<a href="PlanarSet.html#clear">clear</a></li><li class="nav-item">F<a href="PlanarSet.html#search">search</a></li><li class="nav-item">F<a href="PlanarSet.html#hit">hit</a></li><li class="nav-item">F<a href="PlanarSet.html#svg">svg</a></li><li class="nav-heading">C<a href="Errors.html">Errors</a></li><li class="nav-heading">Modules</li><li class="nav-heading">M<a href="module-BooleanOperations.html">BooleanOperations</a></li><li class="nav-item">F<a href="module-BooleanOperations.html#.unify">unify</a></li><li class="nav-item">F<a href="module-BooleanOperations.html#.subtract">subtract</a></li><li class="nav-item">F<a href="module-BooleanOperations.html#.intersect">intersect</a></li><li class="nav-item">F<a href="module-BooleanOperations.html#.innerClip">innerClip</a></li><li class="nav-item">F<a href="module-BooleanOperations.html#.outerClip">outerClip</a></li><li class="nav-item">F<a href="module-BooleanOperations.html#.calculateIntersections">calculateIntersections</a></li><li class="nav-heading">M<a href="module-RayShoot.html">RayShoot</a></li><li class="nav-item">F<a href="module-RayShoot.html#.ray_shoot">ray_shoot</a></li><li class="nav-heading">M<a href="module-Relation.html">Relation</a></li><li class="nav-item">F<a href="module-Relation.html#.equal">equal</a></li><li class="nav-item">F<a href="module-Relation.html#.intersect">intersect</a></li><li class="nav-item">F<a href="module-Relation.html#.touch">touch</a></li><li class="nav-item">F<a href="module-Relation.html#.disjoint">disjoint</a></li><li class="nav-item">F<a href="module-Relation.html#.inside">inside</a></li><li class="nav-item">F<a href="module-Relation.html#.covered">covered</a></li><li class="nav-item">F<a href="module-Relation.html#.contain">contain</a></li><li class="nav-item">F<a href="module-Relation.html#.cover">cover</a></li><li class="nav-item">F<a href="module-Relation.html#.relate">relate</a></li><li class="nav-heading"><a href="global.html">Globals</a></li><li class="nav-item">F<a href="global.html#inverse">inverse</a></li><li class="nav-item">M<a href="global.html#arc">arc</a></li><li class="nav-item">M<a href="global.html#box">box</a></li><li class="nav-item">M<a href="global.html#circle">circle</a></li><li class="nav-item">M<a href="global.html#line">line</a></li><li class="nav-item">M<a href="global.html#matrix">matrix</a></li><li class="nav-item">M<a href="global.html#multiline">multiline</a></li><li class="nav-item">M<a href="global.html#point">point</a></li><li class="nav-item">M<a href="global.html#polygon">polygon</a></li><li class="nav-item">M<a href="global.html#segment">segment</a></li><li class="nav-item">M<a href="global.html#vector">vector</a></li><li class="nav-item">M<a href="global.html#CCW">CCW</a></li><li class="nav-item">M<a href="global.html#CW">CW</a></li><li class="nav-item">M<a href="global.html#ORIENTATION">ORIENTATION</a></li><li class="nav-item">M<a href="global.html#DP_TOL">DP_TOL</a></li><li class="nav-item">F<a href="global.html#setTolerance">setTolerance</a></li><li class="nav-item">F<a href="global.html#getTolerance">getTolerance</a></li><li class="nav-item">F<a href="global.html#EQ_0">EQ_0</a></li><li class="nav-item">F<a href="global.html#EQ">EQ</a></li><li class="nav-item">F<a href="global.html#GT">GT</a></li><li class="nav-item">F<a href="global.html#GE">GE</a></li><li class="nav-item">F<a href="global.html#LT">LT</a></li><li class="nav-item">F<a href="global.html#LE">LE</a></li> </nav> <div id="main"> <h1 class="page-title">algorithms/boolean_op.js</h1> <section> <article> <pre class="prettyprint source linenums"><code>/** * Created by Alex Bol on 12/02/2018. */ /** * @module BooleanOperations */ "use strict"; import Flatten from '../flatten'; import * as Utils from '../utils/utils'; import LinkedList from "../data_structures/linked_list"; let {INSIDE, OUTSIDE, BOUNDARY, OVERLAP_SAME, OVERLAP_OPPOSITE} = Flatten; const NOT_VERTEX = 0; const START_VERTEX = 1; const END_VERTEX = 2; export const BOOLEAN_UNION = 1; export const BOOLEAN_INTERSECT = 2; export const BOOLEAN_SUBTRACT = 3; /** * Unify two polygons polygons and returns new polygon. * Point belongs to the resulted polygon if it belongs to the first OR to the second polygon * @param {Polygon} polygon1 - first operand * @param {Polygon} polygon2 - second operand * @returns {Polygon} */ export function unify(polygon1, polygon2) { let [res_poly, wrk_poly] = booleanOpBinary(polygon1, polygon2, BOOLEAN_UNION, true); return res_poly; } /** * Subtract second polygon from the first and returns new polygon * Point belongs to the resulted polygon if it belongs to the first polygon AND NOT to the second polygon * @param {Polygon} polygon1 - first operand * @param {Polygon} polygon2 - second operand * @returns {Polygon} */ export function subtract(polygon1, polygon2) { let polygon2_tmp = polygon2.clone(); let polygon2_reversed = polygon2_tmp.reverse(); let [res_poly, wrk_poly] = booleanOpBinary(polygon1, polygon2_reversed, BOOLEAN_SUBTRACT, true); return res_poly; } /** * Intersect two polygons and returns new polygon * Point belongs to the resultes polygon is it belongs to the first AND to the second polygon * @param {Polygon} polygon1 - first operand * @param {Polygon} polygon2 - second operand * @returns {Polygon} */ export function intersect(polygon1, polygon2) { let [res_poly, wrk_poly] = booleanOpBinary(polygon1, polygon2, BOOLEAN_INTERSECT, true); return res_poly; } /** * Returns boundary of intersection between two polygons as two arrays of shapes (Segments/Arcs) * The first array are shapes from the first polygon, the second array are shapes from the second * @param {Polygon} polygon1 - first operand * @param {Polygon} polygon2 - second operand * @returns {Shape[][]} */ export function innerClip(polygon1, polygon2) { let [res_poly, wrk_poly] = booleanOpBinary(polygon1, polygon2, BOOLEAN_INTERSECT, false); let clip_shapes1 = []; for (let face of res_poly.faces) { clip_shapes1 = [...clip_shapes1, ...[...face.edges].map(edge => edge.shape)] } let clip_shapes2 = []; for (let face of wrk_poly.faces) { clip_shapes2 = [...clip_shapes2, ...[...face.edges].map(edge => edge.shape)] } return [clip_shapes1, clip_shapes2]; } /** * Returns boundary of subtraction of the second polygon from first polygon as array of shapes * @param {Polygon} polygon1 - first operand * @param {Polygon} polygon2 - second operand * @returns {Shape[]} */ export function outerClip(polygon1, polygon2) { let [res_poly, wrk_poly] = booleanOpBinary(polygon1, polygon2, BOOLEAN_SUBTRACT, false); let clip_shapes1 = []; for (let face of res_poly.faces) { clip_shapes1 = [...clip_shapes1, ...[...face.edges].map(edge => edge.shape)] } return clip_shapes1; } /** * Returns intersection points between boundaries of two polygons as two array of points * Points in the first array belong to first polygon, points from the second - to the second. * Points in each array are ordered according to the direction of the correspondent polygon * @param {Polygon} polygon1 - first operand * @param {Polygon} polygon2 - second operand * @returns {Point[][]} */ export function calculateIntersections(polygon1, polygon2) { let res_poly = polygon1.clone(); let wrk_poly = polygon2.clone(); // get intersection points let intersections = getIntersections(res_poly, wrk_poly); // sort intersection points sortIntersections(intersections); // split by intersection points splitByIntersections(res_poly, intersections.int_points1_sorted); splitByIntersections(wrk_poly, intersections.int_points2_sorted); // filter duplicated intersection points filterDuplicatedIntersections(intersections); let ip_sorted1 = intersections.int_points1_sorted.map( int_point => int_point.pt); let ip_sorted2 = intersections.int_points2_sorted.map( int_point => int_point.pt); return [ip_sorted1, ip_sorted2]; } function filterNotRelevantEdges(res_poly, wrk_poly, intersections, op) { // keep not intersected faces for further remove and merge let notIntersectedFacesRes = getNotIntersectedFaces(res_poly, intersections.int_points1); let notIntersectedFacesWrk = getNotIntersectedFaces(wrk_poly, intersections.int_points2); // calculate inclusion flag for not intersected faces calcInclusionForNotIntersectedFaces(notIntersectedFacesRes, wrk_poly); calcInclusionForNotIntersectedFaces(notIntersectedFacesWrk, res_poly); // initialize inclusion flags for edges incident to intersections initializeInclusionFlags(intersections.int_points1); initializeInclusionFlags(intersections.int_points2); // calculate inclusion flags only for edges incident to intersections calculateInclusionFlags(intersections.int_points1, wrk_poly); calculateInclusionFlags(intersections.int_points2, res_poly); // fix boundary conflicts while (fixBoundaryConflicts(res_poly, wrk_poly, intersections.int_points1, intersections.int_points1_sorted, intersections.int_points2, intersections)); // while (fixBoundaryConflicts(wrk_poly, res_poly, intersections.int_points2, intersections.int_points2_sorted, intersections.int_points1, intersections)); // Set overlapping flags for boundary chains: SAME or OPPOSITE setOverlappingFlags(intersections); // remove not relevant chains between intersection points removeNotRelevantChains(res_poly, op, intersections.int_points1_sorted, true); removeNotRelevantChains(wrk_poly, op, intersections.int_points2_sorted, false); // remove not relevant not intersected faces from res_polygon and wrk_polygon // if op == UNION, remove faces that are included in wrk_polygon without intersection // if op == INTERSECT, remove faces that are not included into wrk_polygon removeNotRelevantNotIntersectedFaces(res_poly, notIntersectedFacesRes, op, true); removeNotRelevantNotIntersectedFaces(wrk_poly, notIntersectedFacesWrk, op, false); } function swapLinksAndRestore(res_poly, wrk_poly, intersections, op) { // add edges of wrk_poly into the edge container of res_poly copyWrkToRes(res_poly, wrk_poly, op, intersections.int_points2); // swap links from res_poly to wrk_poly and vice versa swapLinks(res_poly, wrk_poly, intersections); // remove old faces removeOldFaces(res_poly, intersections.int_points1); removeOldFaces(wrk_poly, intersections.int_points2); // restore faces restoreFaces(res_poly, intersections.int_points1, intersections.int_points2); restoreFaces(res_poly, intersections.int_points2, intersections.int_points1); // merge relevant not intersected faces from wrk_polygon to res_polygon // mergeRelevantNotIntersectedFaces(res_poly, wrk_poly); } function booleanOpBinary(polygon1, polygon2, op, restore) { let res_poly = polygon1.clone(); let wrk_poly = polygon2.clone(); // get intersection points let intersections = getIntersections(res_poly, wrk_poly); // sort intersection points sortIntersections(intersections); // split by intersection points splitByIntersections(res_poly, intersections.int_points1_sorted); splitByIntersections(wrk_poly, intersections.int_points2_sorted); // filter duplicated intersection points filterDuplicatedIntersections(intersections); // calculate inclusion and remove not relevant edges filterNotRelevantEdges(res_poly, wrk_poly, intersections, op); if (restore) { swapLinksAndRestore(res_poly, wrk_poly, intersections, op); } return [res_poly, wrk_poly]; } function getIntersections(polygon1, polygon2) { let intersections = { int_points1: [], int_points2: [] }; // calculate intersections for (let edge1 of polygon1.edges) { // request edges of polygon2 in the box of edge1 let resp = polygon2.edges.search(edge1.box); // for each edge2 in response for (let edge2 of resp) { // calculate intersections between edge1 and edge2 let ip = edge1.shape.intersect(edge2.shape); // for each intersection point for (let pt of ip) { addToIntPoints(edge1, pt, intersections.int_points1); addToIntPoints(edge2, pt, intersections.int_points2); } } } return intersections; } export function addToIntPoints(edge, pt, int_points) { let id = int_points.length; let shapes = edge.shape.split(pt); // if (shapes.length < 2) return; if (shapes.length === 0) return; // Point does not belong to edge ? let len = 0; if (shapes[0] === null) { // point incident to edge start vertex len = 0; } else if (shapes[1] === null) { // point incident to edge end vertex len = edge.shape.length; } else { // Edge was split into to edges len = shapes[0].length; } let is_vertex = NOT_VERTEX; if (Utils.EQ(len, 0)) { is_vertex |= START_VERTEX; } if (Utils.EQ(len, edge.shape.length)) { is_vertex |= END_VERTEX; } // Fix intersection point which is end point of the last edge let arc_length = (is_vertex & END_VERTEX) && edge.next.arc_length === 0 ? 0 : edge.arc_length + len; int_points.push({ id: id, pt: pt, arc_length: arc_length, edge_before: edge, edge_after: undefined, face: edge.face, is_vertex: is_vertex }); } function sortIntersections(intersections) { // if (intersections.int_points1.length === 0) return; // augment intersections with new sorted arrays // intersections.int_points1_sorted = intersections.int_points1.slice().sort(compareFn); // intersections.int_points2_sorted = intersections.int_points2.slice().sort(compareFn); intersections.int_points1_sorted = getSortedArray(intersections.int_points1); intersections.int_points2_sorted = getSortedArray(intersections.int_points2); } export function getSortedArray(int_points) { let faceMap = new Map; let id = 0; // Create integer id's for faces for (let ip of int_points) { if (!faceMap.has(ip.face)) { faceMap.set(ip.face, id); id++; } } // Augment intersection points with face id's for (let ip of int_points) { ip.faceId = faceMap.get(ip.face); } // Clone and sort let int_points_sorted = int_points.slice().sort(compareFn); return int_points_sorted; } function compareFn(ip1, ip2) { // compare face id's if (ip1.faceId < ip2.faceId) { return -1; } if (ip1.faceId > ip2.faceId) { return 1; } // same face - compare arc_length if (ip1.arc_length < ip2.arc_length) { return -1; } if (ip1.arc_length > ip2.arc_length) { return 1; } return 0; } export function splitByIntersections(polygon, int_points) { if (!int_points) return; for (let int_point of int_points) { let edge = int_point.edge_before; // recalculate vertex flag: it may be changed after previous split int_point.is_vertex = NOT_VERTEX; if (edge.shape.start.equalTo(int_point.pt)) { int_point.is_vertex |= START_VERTEX; } if (edge.shape.end.equalTo(int_point.pt)) { int_point.is_vertex |= END_VERTEX; } if (int_point.is_vertex & START_VERTEX) { // nothing to split int_point.edge_before = edge.prev; int_point.is_vertex = END_VERTEX; continue; } if (int_point.is_vertex & END_VERTEX) { // nothing to split continue; } let newEdge = polygon.addVertex(int_point.pt, edge); int_point.edge_before = newEdge; } for (let int_point of int_points) { int_point.edge_after = int_point.edge_before.next; } } export function filterDuplicatedIntersections(intersections) { if (intersections.int_points1.length < 2) return; let do_squeeze = false; let int_point_ref1; let int_point_ref2; let int_point_cur1; let int_point_cur2; for (let i = 0; i < intersections.int_points1_sorted.length; i++) { if (intersections.int_points1_sorted[i].id === -1) continue; int_point_ref1 = intersections.int_points1_sorted[i]; int_point_ref2 = intersections.int_points2[int_point_ref1.id]; for (let j=i+1; j < intersections.int_points1_sorted.length; j++) { int_point_cur1 = intersections.int_points1_sorted[j]; if (!Utils.EQ(int_point_cur1.arc_length, int_point_ref1.arc_length)) { break; } if (int_point_cur1.id === -1) continue; int_point_cur2 = intersections.int_points2[int_point_cur1.id]; if (int_point_cur2.id === -1) continue; if (int_point_cur1.edge_before === int_point_ref1.edge_before && int_point_cur1.edge_after === int_point_ref1.edge_after && int_point_cur2.edge_before =