@eturnity/eturnity_maths 7.20.0 → 7.24.1

package/src/index.js

@@ -1,11 +1,10 @@
-
-export * from './coords';
-export * from './geo';
-export * from './geometry';
-export * from './matrix';
-export * from './vector';
-export * from './snap';
-export * from './intersectionPolygon';
-export * from './objects';
-export * from './splitMergePolygons';
-
+export * from './coords'
+export * from './geo'
+export * from './geometry'
+export * from './matrix'
+export * from './vector'
+export * from './snap'
+export * from './intersectionPolygon'
+export * from './objects'
+export * from './splitMergePolygons'
+export * from './miscellaneous'

package/src/intersectionPolygon.js

@@ -1,10 +1,10 @@
-
 import {
   getPointInsideOutline,
   isInsidePolygon,
   isSamePoint2D
 } from './geometry'
-import {getIntersections,
+import {
+  getIntersections,
   getNodeList,
   getEdgeList,
   getOutlineList
@@ -29,19 +29,19 @@ export function isSelfIntersecting(outline, isClosePolygon = true) {
   //check if two nodes are in same position
   for (let k = 0; k < length; k++) {
     let A = outline[k]
-    let B = outline[(k + 1)%length]
-    if(isSamePoint2D(A,B)) return true
+    let B = outline[(k + 1) % length]
+    if (isSamePoint2D(A, B)) return true
   }
   if (length < 4) return false
-  let closeOffset=isClosePolygon?0:1
+  let closeOffset = isClosePolygon ? 0 : 1
   //let AB and CD be two edges we are testing for intersection
-  for (let k = 0; k < length-closeOffset; k++) {
+  for (let k = 0; k < length - closeOffset; k++) {
     let A = outline[k]
-    let B = outline[(k + 1)%length]
+    let B = outline[(k + 1) % length]
     let offset = k == 0 ? 0 : 1
     for (let j = k + 2; j < length - 1 + offset - closeOffset; j++) {
       let C = outline[j]
-      let D = outline[(j + 1)%length]
+      let D = outline[(j + 1) % length]
       if (doLineSegmentsIntersect(A, B, C, D)) {
         isSelfIntersecting = true
         break
@@ -54,9 +54,11 @@ export function isSelfIntersecting(outline, isClosePolygon = true) {
   return isSelfIntersecting
 }
 
-
-export function logicOperationOnPolygons(outline1,outline2,mode='intersect')
-{
+export function logicOperationOnPolygons(
+  outline1,
+  outline2,
+  mode = 'intersect'
+) {
   const fig1 = outline1.map((p) => {
     return { x: p.x, y: p.y, z: p.z }
   })
@@ -66,32 +68,35 @@ export function logicOperationOnPolygons(outline1,outline2,mode='intersect')
   })
   //nodeList:
   let dirtyNodeList = []
-  fig1.forEach((p) => {dirtyNodeList.push(p)})
-  fig2.forEach((p) => {dirtyNodeList.push(p)})
+  fig1.forEach((p) => {
+    dirtyNodeList.push(p)
+  })
+  fig2.forEach((p) => {
+    dirtyNodeList.push(p)
+  })
   //edgeList (just in term of indexes)
-  const edges=fig2.map((p,index)=>{
-    return {outline:[p,fig2[(index+1)%fig2.length]]}
+  const edges = fig2.map((p, index) => {
+    return { outline: [p, fig2[(index + 1) % fig2.length]] }
   })
-  let intersections = getIntersections({outline:fig1}, edges)
+  let intersections = getIntersections({ outline: fig1 }, edges)
 
   //2. gather all nodes+intersection in a list[[x,y],[x,y]]
-  const nodeList = getNodeList(intersections, edges, {outline:fig1})
+  const nodeList = getNodeList(intersections, edges, { outline: fig1 })
   //3. generate all edges not cut, those cut and those from construction polyline
-    
 
   const edgeList = getEdgeList(
     nodeList,
     intersections,
     edges,
-    {outline:fig1},
+    { outline: fig1 },
     1
   )
   //4. run planar-face-discovery to get all cycles and rebuild our polygons
-  try{
-    const  outlineList = getOutlineList(nodeList, edgeList)
+  try {
+    const outlineList = getOutlineList(nodeList, edgeList)
     return filterPolygons(outlineList, fig1, fig2, mode)
-  }catch(err){
-    console.error("error with getOutlineList",nodeList, edgeList,err)
+  } catch (err) {
+    console.error('error with getOutlineList', nodeList, edgeList, err)
     return []
   }
 }
@@ -102,7 +107,10 @@ function filterPolygons(polygons, fig1, fig2, mode) {
   var point
   var bigPolygons = removeSmallPolygons(polygons, 0.0001)
   for (var i = 0; i < bigPolygons.length; i++) {
-    point = getPointInsideOutline(bigPolygons[i],bigPolygons.filter((p,index)=>index!=i))
+    point = getPointInsideOutline(
+      bigPolygons[i],
+      bigPolygons.filter((p, index) => index != i)
+    )
     c1 = isInsidePolygon(point, fig1)
     c2 = isInsidePolygon(point, fig2)
     if (
@@ -113,14 +121,13 @@ function filterPolygons(polygons, fig1, fig2, mode) {
     ) {
       //fig1 + fig2
       //remove undefined point:
-      bigPolygons[i]=bigPolygons[i].filter(p=>!!p)
+      bigPolygons[i] = bigPolygons[i].filter((p) => !!p)
       filtered.push(bigPolygons[i])
     }
   }
   return filtered
 }
 
-
 export function intersectOutlines(outline1, outline2) {
   const fig1 = outline1.map((p) => {
     return { x: p.x, y: p.y, z: p.z }
@@ -129,8 +136,7 @@ export function intersectOutlines(outline1, outline2) {
     return { x: p.x, y: p.y, z: p.z }
   })
 
-  return logicOperationOnPolygons(fig1,fig2,'intersect')
- 
+  return logicOperationOnPolygons(fig1, fig2, 'intersect')
 }
 
 function alignPolygon(polygon, points) {