flo-mat 3.0.0 → 3.0.2

package/node/point-on-shape/is-pos-dull-corner.js

@@ -1,14 +0,0 @@
-import { memoize } from "flo-memoize";
-import { getPosCorner } from "./get-pos-corner.js";
-import { isPosCorner } from "./is-pos-corner.js";
-/**
- * @internal
- */
-const isPosDullCorner = memoize((pos) => {
-    if (!isPosCorner(pos)) {
-        return false;
-    }
-    return getPosCorner(pos).isDull;
-});
-export { isPosDullCorner };
-//# sourceMappingURL=is-pos-dull-corner.js.map

package/node/point-on-shape/is-pos-dull-corner.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"is-pos-dull-corner.js","sourceRoot":"","sources":["../../src/point-on-shape/is-pos-dull-corner.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,OAAO,EAAE,MAAM,aAAa,CAAC;AACtC,OAAO,EAAE,YAAY,EAAE,MAAM,qBAAqB,CAAC;AACnD,OAAO,EAAE,WAAW,EAAE,MAAM,oBAAoB,CAAC;AAGjD;;GAEG;AACH,MAAM,eAAe,GAAG,OAAO,CAAC,CAAC,GAAiB,EAAE,EAAE;IAClD,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,EAAE;QAAE,OAAO,KAAK,CAAC;KAAE;IAExC,OAAO,YAAY,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC;AACpC,CAAC,CAAC,CAAC;AAGH,OAAO,EAAE,eAAe,EAAE,CAAA"}

package/src/cp-node/create-cp-node.ts

@@ -1,21 +0,0 @@
-import { ContactPoint } from '../contact-point/contact-point.js';
-import { CpNode } from './cp-node.js';
-
-
-function createCpNode(
-        cp: ContactPoint,
-        isHoleClosing  : boolean,
-        isIntersection : boolean,
-        prev           : CpNode = undefined!,
-        next           : CpNode = undefined!,
-        prevOnCircle   : CpNode = undefined!,
-        nextOnCircle   : CpNode = undefined!): CpNode {
-
-    return {
-        cp, isHoleClosing, isIntersection,
-        prev, next, prevOnCircle, nextOnCircle
-    }
-}
-
-
-export { createCpNode }

package/src/cp-node/get-curve-to-next.ts

@@ -1,16 +0,0 @@
-import { CpNode } from './cp-node.js';
-import { getCurveBetween } from '../get-curve/get-curve-between.js';
-
-
-/**
- * Returns the bezier curve from the maximal disk of the given [[CpNode]] to the 
- * next [[CpNode]]'s maximal disk and thus directly represents a piece of the 
- * medial axis.
- * @param cpNode 
- */
-function getCurveToNext(cpNode: CpNode) {
-	return getCurveBetween(cpNode, cpNode.next);
-}
-
-
-export { getCurveToNext }

package/src/cp-node/remove.ts

@@ -1,27 +0,0 @@
-import { LlRbTree } from 'flo-ll-rb-tree';
-import { CpNode } from "./cp-node.js";
-
-
-/**
- * Removes a cpNode from the MAT.
- * @param cpTree The tree graph holding the [[CpNodes]] of the MAT.
- * @param cpNode The [[CpNode]] to remove.
- */
-function removeCpNode(cpNode: CpNode, cpTree?: LlRbTree<CpNode>): void {
-    const prev = cpNode.prev;
-    const next = cpNode.next;
-    prev.next = next;
-    next.prev = prev;
-
-    const nextOpposite = next.prevOnCircle;
-    const prevOpposite = prev.nextOnCircle;
-    nextOpposite.next = prevOpposite;
-    prevOpposite.prev = nextOpposite;
-    
-    if (cpTree) {
-        cpTree.remove(cpNode, false); 
-    }
-}
-
-
-export { removeCpNode }

package/src/cp-node/traverse-edges.ts

@@ -1,29 +0,0 @@
-import { CpNode, getChildren, getCpNodesOnCircle, isTerminating } from './cp-node.js';
-
-
-/**
- * Traverses all edges (depth first) of the given MAT tree starting at the given 
- * vertex (represented by a [[CpNode]]).
- * @param cpNode Any [[CpNode]] representing the start vertex.
- * @param f A callback function for each CpNode representing the vertex at the 
- * start of an edge.
-  */
-function traverseEdges(
-		cpNode: CpNode,
-		f: (cpNode: CpNode) => void) {
-
-	// Since the tree is unrooted we must iterate in all directions from the
-	// given vertex.
-	const cps = getCpNodesOnCircle(cpNode);
-
-	while (cps.length) {
-		const cp = cps.pop()!;
-		f(cp);
-
-		if (isTerminating(cp)) { continue; }
-		cps.push(...getChildren(cp));
-	}
-}
-
-
-export { traverseEdges }

package/src/cp-node/traverse-vertices.ts

@@ -1,37 +0,0 @@
-import { CpNode, getCpNodesOnCircle, isTerminating, vertexChildren } from './cp-node.js';
-
-
-/**
- * Traverses the MAT tree and calls the given callback function for each vertex
- * (represented by a [[CpNode]]) on the MAT.
- * 
- * It is usually preferable to use [[traverseEdges]] as it allows for the 
- * traversal of all the smooth curves representing the MAT.
- * @param cpNode Any [[CpNode]] representing the start vertex.
- * @param f A callback function taking a single [[CpNode]] as parameter.
- */
-function traverseVertices(
-		cpNode: CpNode, 
-		f: (cpNode: CpNode) => void) {
-
-	f(cpNode);
-
-	// Since the tree is unrooted we must iterate in all directions from the
-	// given cpNode.	
-	getCpNodesOnCircle(cpNode)
-		.filter(cpNode => !isTerminating(cpNode))
-		.map(cpNode => cpNode.next)
-		.forEach(f_);
-
-	function f_(cpNode: CpNode) {
-		const cps = [cpNode];
-		while (cps.length) {
-			const cp = cps.pop()!;
-			f(cp);
-			cps.push(...vertexChildren(cp));
-		}
-	}
-}
-
-
-export { traverseVertices }

package/src/sat/t-tree.ts

@@ -1,8 +0,0 @@
-import { Circle } from '../geometry/circle.js';
-
-
-/** @internal */
-export type TTree = {
-    trees?: Map<number,TTree>,
-    circles?: Set<Circle>
-}

package/src/sat/traverse-spacial-tree.ts

@@ -1,34 +0,0 @@
-import { Circle } from '../geometry/circle.js';
-import { TTree } from './t-tree.js';
-
-
-/**
- * @internal
- * Traverses the spacial tree and calls the given callback function for each
- * MAT circle in the tree and iteravely for each subtree.
- * @param tree The spacial tree to traverse
- * @param f A function to call for each MAT circle in the tree.
- */
-function traverseSpacialTree(
-        tree: TTree, 
-        f: (circle: Circle) => void) {
-
-    g(tree);
-
-    function g(tree: TTree) {
-        if (!tree) { return; }
-        
-        if (tree.circles!.size) {
-            tree.circles!.forEach(f);
-            
-            return; // Leaf reached 
-        }
-
-        [5,0,2,4,1,3].forEach(
-            i => g(tree.trees!.get(i)!)
-        );
-    }
-}
-
-
-export { traverseSpacialTree }