plotboilerplate 1.28.0 → 1.29.0

package/src/_esm/src/ts/utils/datastructures/GirihRhombus.js

@@ -1,133 +0,0 @@
-/**
- * @classdesc The rhombus tile from the Girih set.
- *
- * @requires Bounds
- * @requires GirihTile
- * @requires Polygon
- * @requires TileType
- * @requires Vertex
- *
- *
- * @author Ikaros Kappler
- * @date 2013-11-28
- * @modified 2014-04-05 Ikaros Kappler (member array outerTilePolygons added).
- * @modified 2015-03-19 Ikaros Kappler (added toSVG()).
- * @modified 2020-10-31 Refactored to work with PlotBoilerplate.
- * @modified 2020-11-13 Ported from vanilla JS to TypeScript.
- * @version 2.0.1-alpha
- * @file GirihRhombus
- * @public
- **/
-import { Bounds } from "../../Bounds";
-import { Circle } from "../../Circle";
-import { GirihTile, TileType } from "./GirihTile";
-import { Polygon } from "../../Polygon";
-import { Vertex } from "../../Vertex";
-export class GirihRhombus extends GirihTile {
-    /**
-     * @constructor
-     * @extends GirihTile
-     * @name GirihRhombus
-     * @param {Vertex} position
-     * @param {number} edgeLength
-     */
-    constructor(position, edgeLength) {
-        super(position, edgeLength, TileType.RHOMBUS);
-        // Overwrite the default symmetries:
-        //    the rhombus tile has a 180° symmetry (5/10 * 360°)
-        this.uniqueSymmetries = 5;
-        // Init the actual rhombus shape with the passed size
-        let pointA = new Vertex(0, 0);
-        let pointB = pointA;
-        this.addVertex(pointB);
-        const angles = [0.0,
-            72.0,
-            108.0
-            // 72.0
-        ];
-        let theta = 0.0;
-        for (var i = 0; i < angles.length; i++) {
-            theta += (180.0 - angles[i]);
-            pointA = pointB; // center of rotation
-            pointB = pointB.clone();
-            pointB.x += this.edgeLength;
-            pointB.rotate(theta * (Math.PI / 180.0), pointA);
-            this.addVertex(pointB);
-        }
-        // Move to center    
-        const bounds = Bounds.computeFromVertices(this.vertices);
-        const move = new Vertex(bounds.width / 2.0 - (bounds.width - this.edgeLength), bounds.height / 2.0);
-        for (var i = 0; i < this.vertices.length; i++) {
-            this.vertices[i].add(move).add(this.position);
-        }
-        this.textureSource.min.x = 32 / 500.0;
-        this.textureSource.min.y = 188 / 460.0;
-        this.textureSource.max.x = this.textureSource.min.x + 127 / 500.0;
-        this.textureSource.max.y = this.textureSource.min.y + 92 / 460.0;
-        this.baseBounds = this.getBounds();
-        this._buildInnerPolygons();
-        this._buildOuterPolygons(); // Call only AFTER the inner polygons were built!
-    }
-    ;
-    /**
-     * @override
-     */
-    clone() {
-        return new GirihRhombus(this.position.clone(), this.edgeLength).rotate(this.rotation);
-    }
-    ;
-    _buildInnerPolygons() {
-        // Connect all edges half-the-way
-        const innerTile = new Polygon(); // [];
-        innerTile.addVertex(this.vertices[0].clone().scale(0.5, this.vertices[1]));
-        innerTile.addVertex(this.vertices[1].clone().scale(0.5, this.vertices[2]));
-        // Compute the next inner polygon vertex by the intersection of two circles
-        const circleA = new Circle(innerTile.vertices[1], innerTile.vertices[0].distance(innerTile.vertices[1]) * 0.73);
-        const circleB = new Circle(this.vertices[2].clone().scale(0.5, this.vertices[3]), circleA.radius);
-        // There is definitely an intersection
-        let intersection = circleA.circleIntersection(circleB);
-        // One of the two points is inside the tile, the other is outside.
-        // Locate the inside point.
-        if (this.containsVert(intersection.a))
-            innerTile.addVertex(intersection.b);
-        else
-            innerTile.addVertex(intersection.a);
-        innerTile.addVertex(circleB.center);
-        innerTile.addVertex(this.vertices[3].clone().scale(0.5, this.vertices[0]));
-        // Move circles
-        circleA.center = innerTile.vertices[4];
-        circleB.center = innerTile.vertices[0];
-        //window.alert( "circleA=" + circleA + ", circleB=" + circleB );
-        intersection = circleA.circleIntersection(circleB);
-        // There are two points again (one inside, one outside the tile)
-        if (this.containsVert(intersection.a))
-            innerTile.addVertex(intersection.b);
-        else
-            innerTile.addVertex(intersection.a);
-        this.innerTilePolygons.push(innerTile);
-    }
-    ;
-    _buildOuterPolygons() {
-        const indicesA = [0, 2]; // 4:2
-        const indicesB = [0, 3]; // 6:2
-        for (var i = 0; i < indicesA.length; i++) {
-            const indexA = indicesA[i];
-            const indexB = indicesB[i];
-            // The triangle
-            const outerTileX = new Polygon();
-            outerTileX.addVertex(this.getVertexAt(indexA + 1).clone());
-            outerTileX.addVertex(this.innerTilePolygons[0].getVertexAt(indexB).clone());
-            outerTileX.addVertex(this.innerTilePolygons[0].getVertexAt(indexB + 1).clone());
-            this.outerTilePolygons.push(outerTileX);
-            // The first 'kite'
-            const outerTileY = new Polygon();
-            outerTileY.addVertex(this.getVertexAt(indexA + 2).clone());
-            outerTileY.addVertex(this.innerTilePolygons[0].getVertexAt(indexB + 1).clone());
-            outerTileY.addVertex(this.innerTilePolygons[0].getVertexAt(indexB + 2).clone());
-            outerTileY.addVertex(this.innerTilePolygons[0].getVertexAt(indexB + 3).clone());
-            this.outerTilePolygons.push(outerTileY);
-        }
-    }
-    ;
-}
-//# sourceMappingURL=GirihRhombus.js.map

package/src/_esm/src/ts/utils/datastructures/GirihRhombus.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"GirihRhombus.js","sourceRoot":"","sources":["../../../../../ts/utils/datastructures/GirihRhombus.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;IAmBI;AAIJ,OAAO,EAAE,MAAM,EAAE,MAAM,cAAc,CAAC;AACtC,OAAO,EAAE,MAAM,EAAE,MAAM,cAAc,CAAC;AACtC,OAAO,EAAE,SAAS,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AAElD,OAAO,EAAE,OAAO,EAAE,MAAM,eAAe,CAAC;AACxC,OAAO,EAAE,MAAM,EAAE,MAAM,cAAc,CAAC;AAGtC,MAAM,OAAO,YAAa,SAAQ,SAAS;IAEvC;;;;;;OAMG;IACH,YAAa,QAAe,EAAE,UAAkB;QAEnD,KAAK,CAAE,QAAQ,EAAE,UAAU,EAAE,QAAQ,CAAC,OAAO,CAAE,CAAC;QAEhD,oCAAoC;QACpC,wDAAwD;QACxD,IAAI,CAAC,gBAAgB,GAAO,CAAC,CAAC;QAE9B,qDAAqD;QACrD,IAAI,MAAM,GAAU,IAAI,MAAM,CAAC,CAAC,EAAC,CAAC,CAAC,CAAC;QACpC,IAAI,MAAM,GAAU,MAAM,CAAC;QAC3B,IAAI,CAAC,SAAS,CAAE,MAAM,CAAE,CAAC;QAEzB,MAAM,MAAM,GAAiB,CAAE,GAAG;YACxB,IAAI;YACJ,KAAK;YACL,OAAO;SACR,CAAC;QAEV,IAAI,KAAK,GAAU,GAAG,CAAC;QACvB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAG,CAAC;YACtC,KAAK,IAAI,CAAC,KAAK,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;YAC7B,MAAM,GAAG,MAAM,CAAC,CAAC,qBAAqB;YACtC,MAAM,GAAG,MAAM,CAAC,KAAK,EAAE,CAAC;YACxB,MAAM,CAAC,CAAC,IAAI,IAAI,CAAC,UAAU,CAAC;YAC5B,MAAM,CAAC,MAAM,CAAE,KAAK,GAAG,CAAC,IAAI,CAAC,EAAE,GAAC,KAAK,CAAC,EAAE,MAAM,CAAE,CAAC;YACjD,IAAI,CAAC,SAAS,CAAE,MAAM,CAAE,CAAC;QAC7B,CAAC;QAGD,qBAAqB;QACrB,MAAM,MAAM,GAAU,MAAM,CAAC,mBAAmB,CAAE,IAAI,CAAC,QAAQ,CAAE,CAAC;QAClE,MAAM,IAAI,GAAY,IAAI,MAAM,CAAE,MAAM,CAAC,KAAK,GAAC,GAAG,GAAG,CAAC,MAAM,CAAC,KAAK,GAAC,IAAI,CAAC,UAAU,CAAC,EAC7E,MAAM,CAAC,MAAM,GAAC,GAAG,CAClB,CAAC;QACN,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAG,CAAC;YAC7C,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,GAAG,CAAE,IAAI,CAAE,CAAC,GAAG,CAAE,IAAI,CAAC,QAAQ,CAAE,CAAC;QACtD,CAAC;QAED,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,GAAC,KAAK,CAAC;QACpC,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,GAAC,KAAK,CAAC;QACrC,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,GAAC,KAAK,CAAC;QAChE,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,GAAC,KAAK,CAAC;QAE/D,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC;QAEnC,IAAI,CAAC,mBAAmB,EAAE,CAAC;QAC3B,IAAI,CAAC,mBAAmB,EAAE,CAAC,CAAE,iDAAiD;IAC3E,CAAC;IAAA,CAAC;IAGF;;OAEG;IACH,KAAK;QACR,OAAO,IAAI,YAAY,CAAE,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,EAAE,IAAI,CAAC,UAAU,CAAE,CAAC,MAAM,CAAE,IAAI,CAAC,QAAQ,CAAE,CAAC;IACvF,CAAC;IAAA,CAAC;IAIM,mBAAmB;QAE9B,iCAAiC;QACjC,MAAM,SAAS,GAAW,IAAI,OAAO,EAAE,CAAC,CAAC,MAAM;QAC/C,SAAS,CAAC,SAAS,CAAE,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,KAAK,CAAE,GAAG,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAE,CAAE,CAAC;QAC/E,SAAS,CAAC,SAAS,CAAE,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,KAAK,CAAE,GAAG,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAE,CAAE,CAAC;QAE/E,2EAA2E;QAC3E,MAAM,OAAO,GAAU,IAAI,MAAM,CAAE,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,GAAC,IAAI,CAAE,CAAC;QACvH,MAAM,OAAO,GAAU,IAAI,MAAM,CAAE,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,KAAK,CAAE,GAAG,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAE,EAAE,OAAO,CAAC,MAAM,CAAE,CAAC;QAE7G,sCAAsC;QACtC,IAAI,YAAY,GAAQ,OAAO,CAAC,kBAAkB,CAAE,OAAO,CAAE,CAAC;QAC9D,kEAAkE;QAClE,2BAA2B;QAC3B,IAAI,IAAI,CAAC,YAAY,CAAC,YAAY,CAAC,CAAC,CAAC;YAAG,SAAS,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;;YACpC,SAAS,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAE5E,SAAS,CAAC,SAAS,CAAE,OAAO,CAAC,MAAM,CAAE,CAAC;QACtC,SAAS,CAAC,SAAS,CAAE,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,KAAK,CAAE,GAAG,EAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAE,CAAE,CAAC;QAE9E,eAAe;QACf,OAAO,CAAC,MAAM,GAAG,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;QACvC,OAAO,CAAC,MAAM,GAAG,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;QACvC,gEAAgE;QAChE,YAAY,GAAK,OAAO,CAAC,kBAAkB,CAAE,OAAO,CAAE,CAAC;QACvD,gEAAgE;QAChE,IAAI,IAAI,CAAC,YAAY,CAAC,YAAY,CAAC,CAAC,CAAC;YAAG,SAAS,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;;YACpC,SAAS,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAE5E,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAE,SAAS,CAAE,CAAC;IAEtC,CAAC;IAAA,CAAC;IAEM,mBAAmB;QAE9B,MAAM,QAAQ,GAAiB,CAAE,CAAC,EAAE,CAAC,CAAE,CAAC,CAAE,MAAM;QAChD,MAAM,QAAQ,GAAiB,CAAE,CAAC,EAAE,CAAC,CAAE,CAAC,CAAE,MAAM;QAEhD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAG,CAAC;YACxC,MAAM,MAAM,GAAc,QAAQ,CAAC,CAAC,CAAC,CAAC;YACtC,MAAM,MAAM,GAAc,QAAQ,CAAC,CAAC,CAAC,CAAC;YACtC,eAAe;YACf,MAAM,UAAU,GAAW,IAAI,OAAO,EAAE,CAAC;YACzC,UAAU,CAAC,SAAS,CAAE,IAAI,CAAC,WAAW,CAAC,MAAM,GAAC,CAAC,CAAC,CAAC,KAAK,EAAE,CAAE,CAAC;YAC3D,UAAU,CAAC,SAAS,CAAE,IAAI,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,KAAK,EAAE,CAAE,CAAC;YAC9E,UAAU,CAAC,SAAS,CAAE,IAAI,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,MAAM,GAAC,CAAC,CAAC,CAAC,KAAK,EAAE,CAAE,CAAC;YAChF,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAE,UAAU,CAAE,CAAC;YAE1C,mBAAmB;YACnB,MAAM,UAAU,GAAW,IAAI,OAAO,EAAE,CAAC;YACzC,UAAU,CAAC,SAAS,CAAE,IAAI,CAAC,WAAW,CAAC,MAAM,GAAC,CAAC,CAAC,CAAC,KAAK,EAAE,CAAE,CAAC;YAC3D,UAAU,CAAC,SAAS,CAAE,IAAI,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,MAAM,GAAC,CAAC,CAAC,CAAC,KAAK,EAAE,CAAE,CAAC;YAChF,UAAU,CAAC,SAAS,CAAE,IAAI,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,MAAM,GAAC,CAAC,CAAC,CAAC,KAAK,EAAE,CAAE,CAAC;YAChF,UAAU,CAAC,SAAS,CAAE,IAAI,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,MAAM,GAAC,CAAC,CAAC,CAAC,KAAK,EAAE,CAAE,CAAC;YAChF,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAE,UAAU,CAAE,CAAC;QAC9C,CAAC;IACE,CAAC;IAAA,CAAC;CAEL"}

package/src/_esm/src/ts/utils/datastructures/GirihTile.d.ts

@@ -1,283 +0,0 @@
-/**
- * @author   Ikaros Kappler
- * @date     2013-11-27
- * @modified 2014-04-05 Ikaros Kappler (member array outerTilePolygons added).
- * @modified 2015-03-19 Ikaros Kappler (added toSVG()).
- * @modified 2020-10-30 Refactored the this super class to work with PlotBoilerplate.
- * @modified 2020-11-11 Ported the class from vanilla JS to TypeScript.
- * @version  2.0.1-alpha
- * @name GirihTile
- **/
-import { Bounds } from "../../Bounds";
-import { Polygon } from "../../Polygon";
-import { Vertex } from "../../Vertex";
-import { XYCoords } from "../../interfaces";
-export declare enum TileType {
-    UNKNOWN = "UNKNOWN",
-    DECAGON = "DECAGON",
-    PENTAGON = "PENTAGON",
-    IRREGULAR_HEXAGON = "IRREGULAR_HEXAGON",
-    RHOMBUS = "RHOMBUS",
-    BOW_TIE = "BOW_TIE",
-    PENROSE_RHOMBUS = "PENROSE_RHOMBUS"
-}
-export interface IAdjacency {
-    edgeIndex: number;
-    offset: XYCoords;
-}
-/**
- * @classdesc This is a general tile superclass. All other tile classes extends this one.
- *
- * Rule:
- *  * the outer and the inner sub polygons must be inside the main polygon's bounds.
- *
- * @requires Bounds
- * @requires Polyon
- * @requires Vertex
- * @requires XYCoords
- */
-export declare abstract class GirihTile extends Polygon {
-    /**
-     * The center of this tile.
-     *
-     * @name position
-     * @member {Vertex}
-     * @memberof GirihTile
-     * @type {Vertex}
-     * @instance
-     */
-    position: Vertex;
-    /**
-     * The edge length of this tile (all edges of a Girih tile have same length).
-     *
-     * @name edgeLength
-     * @member {number}
-     * @memberof GirihTile
-     * @type {number}
-     * @readonly
-     * @instance
-     */
-    readonly edgeLength: number;
-    /**
-     * The rotation of this tile. This is stored to make cloning easier.
-     *
-     * @name rotation.
-     * @member {number}
-     * @memberof GirihTile
-     * @type {number}
-     * @instance
-     */
-    rotation: number;
-    /**
-     * The symmetry (=order) of this tile. This is the number of steps used for a full
-     * rotation (in this Girih case: 10). Future Girih implementations might have other symmetries.
-     *
-     * @name symmetry
-     * @member {number}
-     * @memberof GirihTile
-     * @type {number}
-     * @instance
-     */
-    symmetry: number;
-    /**
-     * The unique symmetries. This must be an nth part of the global `symmetry`.
-     * Rotating this tile `uniqueSymmetries' times results in the same visual tile (flipped around
-     * a symmetry axis).
-     *
-     * @name uniqueSymmetries
-     * @member {number}
-     * @memberof GirihTile
-     * @type {number}
-     * @instance
-     */
-    uniqueSymmetries: number;
-    /**
-     * The inner tile polygons.
-     *
-     * @name innerTilePolygons
-     * @member {Array<Polygon>}
-     * @memberof GirihTile
-     * @type {Array<Polygon>}
-     * @instance
-     */
-    innerTilePolygons: Array<Polygon>;
-    /**
-     * The outer tile polygons.
-     *
-     * @name outerTilePolygons
-     * @member {Array<Polygon>}
-     * @memberof GirihTile
-     * @type {Array<Polygon>}
-     * @instance
-     */
-    outerTilePolygons: Array<Polygon>;
-    /**
-     * An identifier for the tile type.
-     *
-     * @name tileType
-     * @member {TileType}
-     * @memberof GirihTile
-     * @type {TileType}
-     * @instance
-     */
-    tileType: TileType;
-    /**
-     * The initial bounds (of the un-rotated tile). These are required to calculate the
-     * correct texture mapping.
-     *
-     * @name baseBounds
-     * @member {Bounds}
-     * @memberof GirihTile
-     * @type {Bounds}
-     * @instance
-     */
-    baseBounds: Bounds;
-    /**
-     * A rectangle on the shipped texture image (`girihtexture-500px.png`) marking the
-     * texture position. The bounds are relative, so each component must be in [0..1].
-     * The texture is a square.
-     *
-     * @name textureSource
-     * @member {Bounds}
-     * @memberof GirihTile
-     * @type {Bounds}
-     * @instance
-     */
-    readonly textureSource: Bounds;
-    /**
-     * An epsilon to use for detecting adjacent edges. 0.001 seems to be a good value.
-     * Adjust if needed.
-     *
-     * @name epsilon
-     * @member {number}
-     * @memberof GirihTile
-     * @type {number}
-     * @static
-     */
-    static epsilon: number;
-    /**
-     * The default edge length.
-     *
-     * @name DEFAULT_EDGE_LENGTH
-     * @member {number}
-     * @memberof GirihTile
-     * @type {number}
-     * @readonly
-     * @static
-     */
-    static readonly DEFAULT_EDGE_LENGTH: number;
-    /**
-     * @constructor
-     * @memberof GirihTile
-     * @abstract class
-     * @param {Vertex} position   - The position of the tile.
-     * @param {number} edgeLength - The edge length (default is GirihTile.DEFAULT_EDGE_LENGTH).
-     * @param {TileType} tileType - One of `TileType.*` enum members.
-     **/
-    constructor(position: Vertex, edgeLength?: number, tileType?: TileType);
-    /**
-     * @abstract Subclasses must override this.
-     */
-    abstract clone(): GirihTile;
-    /**
-     * Move this tile around (together will all inner polygons).
-     * As this function overrides Polygon.move(...), the returned
-     * instance (this) must be of type `Polygon`.
-     *
-     * @name move
-     * @instance
-     * @override
-     * @memberof GirihTile
-     * @param {XYCoords} amount
-     * @return {Polygon} this
-     */
-    move(amount: XYCoords): Polygon;
-    /**
-     * Find the adjacent tile (given by the template tile)
-     * Note that the tile itself will be modified (rotated and moved to the correct position).
-     *
-     * @name findAdjacentTilePosition
-     * @memberof GirihTile
-     * @instance
-     * @param {number} edgeIndex - The edge number of the you you want to find adjacency for.
-     * @param {Polygon} tile - The polygon (or tile) you want to find adjacency for at the specified edge.
-     * @return {IAdjacency|null} Adjacency information or null if the passed tile does not match.
-     */
-    findAdjacentTilePosition(edgeIndex: number, tile: Polygon): IAdjacency | null;
-    /**
-     * Find all possible adjacent tile positions (and rotations) for `neighbourTile`.
-     *
-     * @name transformTileToAdjacencies
-     * @memberof GirihTile
-     * @instance
-     * @param {number} baseEdgeIndex - The edge number of the you you want to find adjacencies for.
-     * @param {GirihTile} neighbourTile - The polygon (or tile) you want to find adjacencies for at the specified edge.
-     * @return {IAdjacency|null} Adjacency information or null if the passed tile does not match.
-     */
-    transformTileToAdjacencies(baseEdgeIndex: number, neighbourTile: GirihTile): Array<GirihTile>;
-    /**
-     * Apply adjacent tile position to `neighbourTile`.
-     *
-     * @name transformTilePositionToAdjacencies
-     * @memberof GirihTile
-     * @instance
-     * @param {number} baseEdgeIndex - The edge number of the you you want to apply adjacent position for.
-     * @param {Polygon} neighbourTile - The polygon (or tile) you want to find adjacency for at the specified edge.
-     * @return {Polygon|null} the passed tile itself if adjacency was found, null otherwise.
-     */
-    transformTilePositionToAdjacency<P extends Polygon>(baseEdgeIndex: number, neighbourTile: P): P | null;
-    /**
-     * Get the inner tile polygon at the given index.
-     * This function applies MOD to the index.
-     *
-     * @name getInnerTilePolygonAt
-     * @instance
-     * @memberof GirihTile
-     * @param {number} index
-     * @return {Polygon} The sub polygon (inner tile) at the given index.
-     **/
-    getInnerTilePolygonAt(index: number): Polygon;
-    /**
-     * Get the outer tile polygon at the given index.
-     * This function applies MOD to the index.
-     *
-     * @name getOuterTilePolygonAt
-     * @instance
-     * @memberof GirihTile
-     * @param {number} index
-     * @return {Polygon} The sub polygon (outer tile) at the given index.
-     **/
-    getOuterTilePolygonAt(index: number): Polygon;
-    /**
-     * Rotate this tile
-     * Note: this function behaves a bitdifferent than the genuine Polygon.rotate function!
-     *       Polygon has the default center of rotation at (0,0).
-     *       The GirihTile rotates around its center (position) by default.
-     *
-     * @name rotate
-     * @instance
-     * @memberof GirihTile
-     * @param {number} angle - The angle to use for rotation.
-     * @param {Vertex?} center - The center of rotation (default is this.position).
-     * @return {Polygon} this
-     **/
-    rotate(angle: number, center?: Vertex): GirihTile;
-    /**
-     * This function locates the closest tile edge (polygon edge)
-     * to the passed point.
-     *
-     * Currently the edge distance to a point is measured by the
-     * euclidian distance from the edge's middle point.
-     *
-     * Idea: move this function to Polygon?
-     *
-     * @name locateEdgeAtPoint
-     * @instance
-     * @memberof GirihTile
-     * @param {XYCoords} point     - The point to detect the closest edge for.
-     * @param {number}   tolerance - The tolerance (=max distance) the detected edge
-     *                               must be inside.
-     * @return {nmber} the edge index (index of the starting vertex, so [index,index+1] is the edge ) or -1 if not found.
-     **/
-    locateEdgeAtPoint(point: XYCoords, tolerance: number): number;
-}