plotboilerplate 1.12.10 → 1.13.0

package/src/ts/interfaces/core.ts

@@ -13,6 +13,7 @@
  * @modified 2021-05-31 Added the `drawLib.setConfiguration` function.
  * @modified 2021-05-31 Splitted the large interfaces.ts file into this one and others.
  * @modified 2021-06-21 Added `IBounds.getCenter()`.
+ * @modified 2021-11-16 Added `text` options to the `DrawConfig`.
  **/
 
 import { Vertex } from "../Vertex";
@@ -28,6 +29,7 @@ import { BezierPath } from "../BezierPath";
 import { Line } from "../Line";
 import { PlotBoilerplate } from "../PlotBoilerplate";
 import { DrawLib } from "./DrawLib";
+import { PBText } from "../PBText";
 
 /**
  * @classdesc Coordinates (x,y) on the plane.
@@ -73,6 +75,7 @@ export type Drawable =
   | Circle
   | CircleSector
   | PBImage
+  | PBText
   | VEllipse
   | VEllipseSector
   | Polygon
@@ -189,6 +192,12 @@ export interface DrawConfig {
   line: DrawSettings;
   vector: DrawSettings;
   image: DrawSettings;
+  text: {
+    color: string;
+    lineWidth: number;
+    fill?: boolean;
+    anchor?: boolean;
+  };
 }
 
 /** This is a fix for the problem, that the constructor's "name" attribute is not

package/src/ts/utils/algorithms/clearPolygonDuplicateVertices.ts~

@@ -1,5 +0,0 @@
-/**
- *
- */
-
-const polygonClearDuplicateVertices

package/src/ts/utils/algorithms/findPolygonSelfIntersections.ts~

@@ -1,45 +0,0 @@
-/**
- * @requires Line
- * @requires Vertex
- *
- * @author Ikaros Kappler
- * @date   2020-12-04
- */
-
-
-/**
- * Collect all self-intersection points of the given polygon.
- *
- * @name findPolygonSelfIntersections
- * @param {Array<Vertex>} polygon
- * @return Array<Vertex>
- */
-var findPolygonSelfIntersections = function( polygon ) {
-    var pointList = [];
-    var lineA = new Line( new Vertex(), new Vertex() );
-    var lineB = new Line( new Vertex(), new Vertex() );
-    for( var a = 0; a < polygon.vertices.length; a++ ) {
-	lineA.a.set( polygon.getVertexAt(a) );
-	lineA.b.set( polygon.getVertexAt(a+1) );
-	for( var b = 0; b < polygon.vertices.length; b++ ) {
-	    // Same edge or neighbour edges intersect by definition.
-	    // Skip them.
-	    if( a == b || a+1 == b || a == b+1
-		|| (a==0&&b+1==polygon.vertices.length) || (b==0&&a+1==polygon.vertices.length) )
-		continue;
-	    lineB.a.set( polygon.getVertexAt(b) );
-	    lineB.b.set( polygon.getVertexAt(b+1) );
-
-	    // Commpute the intersection point of the (infinite) lines.
-	    // The point is undefined if and only if both line are parallel (co-linear).
-	    const intersectionPoint = lineA.intersection(lineB);
-
-	    // Check if the intersection point is on both (finite) edges of the polygon.
-	    if( intersectionPoint
-		&& lineA.hasPoint(intersectionPoint) && lineB.hasPoint(intersectionPoint) ) {
-		pointList.push( intersectionPoint );
-	    }
-	}	
-    }
-    return pointList;
-};

package/src/ts/utils/algorithms/splitPolygonToNonIntersecting.ts~

@@ -1,113 +0,0 @@
-/**
- * This function cuts a given self-intersecting polygon into non-self-intersecting 
- * sub polygons.
- *
- * The algorithm only works for non-self-overlapping polygons.
- * Please note that the union set of the sub polygons themselves will _not_ be disjunct if
- * the input polyon overlaps with itself!
- *
- *
- * @requires Line
- * @requires Vertex
- * @requires greinerHormann
- * 
- * @date 2020-12-04
- */
-
-(function(_context) {
-
-    /**
-     * @param {Array<Vertex>} vertices
-     * @param {number=10} maxDepth
-     */  
-    var splitToNonIntersectingPolygons = function( vertices, maxDepth ) {
-	if( typeof maxDepth === "undefined" )
-	    maxDepth = 10;
-	return _splitToNonIntersectingPolygons( vertices, maxDepth );
-    };
-
-    
-    var _splitToNonIntersectingPolygons = function( vertices, maxDepth ) {
-
-	if( maxDepth <= 0 ) {
-	    console.log('aborting at max depth');
-	    return [ vertices ];
-	}
-
-	if( vertices.length <= 3 ) {
-	    // No intersections possible
-	    return [ vertices ];
-	}
-
-	// var pointList = [];
-	var n = vertices.length;
-	var lineA = new Line( new Vertex(), new Vertex() );
-	var lineB = new Line( new Vertex(), new Vertex() );
-	for( var a = 0; a < vertices.length; a++ ) {
-	    lineA.a.set( vertices[a] );
-	    lineA.b.set( vertices[(a+1) % n] );
-	    for( var b = 0; b < vertices.length; b++ ) {
-		// Equal or neighbour edges intersect by definition.
-		// We ignore them.
-		if( a == b || a+1 == b || a == b+1 || (a==0&&b+1==vertices.length) || (b==0&&a+1==vertices.length) )
-		    continue;
-		lineB.a.set( vertices[b] );
-		lineB.b.set( vertices[(b+1) % n] );
-
-		const intersectionPoint = lineA.intersection(lineB);
-		// console.log( 'intersectionPoint', intersectionPoint );
-		if( intersectionPoint && lineA.hasPoint(intersectionPoint) && lineB.hasPoint(intersectionPoint) ) {
-		    // console.log( 'intersection found' );
-		    // pointList.push( intersectionPoint );
-		    // Cut polygon into two here
-		    var split = splitPolygonAt( vertices, a, b, intersectionPoint );
-		    
-		    // Split has 2 elements.
-		    var leftCleaned = _splitToNonIntersectingPolygons( split[0], maxDepth-1 );
-		    var rightCleaned =  _splitToNonIntersectingPolygons( split[1], maxDepth-1 );
-
-		    return leftCleaned.concat( rightCleaned );
-		}
-	    }	
-	}
-	// console.log( 'intersectionPoints', pointList );
-
-	// No intersection found:
-	//    just return a list with the original
-	//    polygon as its only element.
-	return [ vertices ];
-    };
-
-
-    // Pre: edgeIndexA < edgeIndexB && vertices.length >= 4
-    var splitPolygonAt = function( vertices, edgeIndexA, edgeIndexB, intersectionPoint ) {
-
-	// console.log( 'split', edgeIndexA, edgeIndexB );
-	
-	var first = [];
-	var second = [];
-	for( var i = 0; i < vertices.length; i++ ) {
-	    if( i <= edgeIndexA )
-		first.push( vertices[i] );
-
-	    if( i == edgeIndexA )  {
-		first.push( intersectionPoint );
-		second.push( intersectionPoint ); // clone???
-	    }
-
-	    if( i > edgeIndexA && i <= edgeIndexB )
-		second.push( vertices[i] );
-
-	    if( i > edgeIndexB )
-		first.push( vertices[i] );
-	    
-	}
-
-	// console.log( 'split', first, second );
-
-	return [ first, second ];
-    };
-
-    _context.splitToNonIntersectingPolygons = splitToNonIntersectingPolygons;
-
-})(globalThis || window);

package/src/ts/utils/algorithms/sutherlandHodgman.ts~

@@ -1,88 +0,0 @@
-"use strict";
-
-/**
- * The Sutherland-Hodgman convex polygon clipping algorithm.
- *
- * Converted to Vertex variant {x:number,y:number} by Ikaros Kappler.
- *
- * @date    2021-01-29
- * @version 1.0.0
- *
- * Original version:
- *    https://rosettacode.org/wiki/Sutherland-Hodgman_polygon_clipping#JavaScript
- */
-
-
-
-(function() {
-
-
-    /**
-     * @param {Vertex}
-     * @param {Vertex}
-     **/
-    var inside = function (_cp1,_cp2,p) {
-	// console.log('x', _cp1);
-        return (_cp2.x-_cp1.x)*(p.y-_cp1.y) > (_cp2.y-_cp1.y)*(p.x-_cp1.x);
-    };
-
-    /**
-     * @param {Vertex}
-     * @param {Vertex}
-     * @param {Vertex}
-     * @param {Vertex}
-     */
-    var intersection = function (_cp1,_cp2,_s,_e) {
-        var
-	dc = { x:  _cp1.x - _cp2.x,
-	       y : _cp1.y - _cp2.y
-	     },
-	dp = { x: _s.x - _e.x,
-	       y : _s.y - _e.y
-	     },
-        n1 = _cp1.x * _cp2.y - _cp1.y * _cp2.x,
-        n2 = _s.x * _e.y - _s.y * _e.x, 
-        n3 = 1.0 / (dc.x * dp.y - dc.y * dp.x);
-        return { x : (n1*dp.x - n2*dc.x) * n3,
-		 y : (n1*dp.y - n2*dc.y) * n3
-	       };
-    };
-    
-
-    /**
-     * @param {Array<Vertex>} subjectPolygon
-     * @param {Array<Vertex>} clipPolygon - Must be convex.
-     */
-    var sutherlandHodgman = function(subjectPolygon, clipPolygon) {
-	
-	var cp1, cp2, s, e;
-	
-	var outputList = subjectPolygon;
-	cp1 = clipPolygon[clipPolygon.length-1];
-	
-	for (var j in clipPolygon) {
-            var cp2 = clipPolygon[j];
-            var inputList = outputList;
-            outputList = [];
-            s = inputList[inputList.length - 1]; // last on the input list
-            for (var i in inputList) {
-		var e = inputList[i];
-		if (inside(cp1,cp2,e)) {
-                    if (!inside(cp1,cp2,s)) {
-			outputList.push(intersection(cp1,cp2,s,e));
-                    }
-                    outputList.push(e);
-		}
-		else if (inside(cp1,cp2,s)) {
-                    outputList.push(intersection(cp1,cp2,s,e));
-		}
-		s = e;
-            }
-            cp1 = cp2;
-	}
-	return outputList
-    }
-
-    globalThis.sutherlandHodgman = sutherlandHodgman;
-
-})();