@js-draw/math 1.21.3 → 1.22.0

package/src/utils/convexHull2Of.test.ts

@@ -4,40 +4,79 @@ import convexHull2Of from './convexHull2Of';
 
 describe('convexHull2Of', () => {
 	it.each([
-		[ [ Vec2.of(1, 1) ] , [ Vec2.of(1, 1) ] ],
+		[[Vec2.of(1, 1)], [Vec2.of(1, 1)]],
 
 		// Line
-		[ [ Vec2.of(1, 1), Vec2.of(2, 2) ] , [ Vec2.of(1, 1), Vec2.of(2, 2) ] ],
+		[
+			[Vec2.of(1, 1), Vec2.of(2, 2)],
+			[Vec2.of(1, 1), Vec2.of(2, 2)],
+		],
 
 		// Just a triangle
-		[ [ Vec2.of(1, 1), Vec2.of(4, 2), Vec2.of(3, 3) ] , [ Vec2.of(1, 1), Vec2.of(4, 2), Vec2.of(3, 3) ]],
+		[
+			[Vec2.of(1, 1), Vec2.of(4, 2), Vec2.of(3, 3)],
+			[Vec2.of(1, 1), Vec2.of(4, 2), Vec2.of(3, 3)],
+		],
 
 		// Triangle with an extra point
-		[ [ Vec2.of(1, 1), Vec2.of(2, 20), Vec2.of(3, 5), Vec2.of(4, 3) ] , [ Vec2.of(1, 1), Vec2.of(4, 3), Vec2.of(2, 20) ]],
+		[
+			[Vec2.of(1, 1), Vec2.of(2, 20), Vec2.of(3, 5), Vec2.of(4, 3)],
+			[Vec2.of(1, 1), Vec2.of(4, 3), Vec2.of(2, 20)],
+		],
 
 		// Points within a triangle
 		[
-			[ Vec2.of(28, 5), Vec2.of(4, 5), Vec2.of(-100, -100), Vec2.of(7, 120), Vec2.of(1, 8), Vec2.of(100, -100), Vec2.of(2, 4), Vec2.of(3, 4), Vec2.of(4, 5) ],
-			[ Vec2.of(-100, -100), Vec2.of(100, -100), Vec2.of(7, 120) ],
+			[
+				Vec2.of(28, 5),
+				Vec2.of(4, 5),
+				Vec2.of(-100, -100),
+				Vec2.of(7, 120),
+				Vec2.of(1, 8),
+				Vec2.of(100, -100),
+				Vec2.of(2, 4),
+				Vec2.of(3, 4),
+				Vec2.of(4, 5),
+			],
+			[Vec2.of(-100, -100), Vec2.of(100, -100), Vec2.of(7, 120)],
 		],
 
 		// Points within a triangle (repeated vertex)
 		[
-			[ Vec2.of(28, 5), Vec2.of(4, 5), Vec2.of(-100, -100), Vec2.of(-100, -100), Vec2.of(7, 120), Vec2.of(1, 8), Vec2.of(100, -100), Vec2.of(2, 4), Vec2.of(3, 4), Vec2.of(4, 5) ],
-			[ Vec2.of(-100, -100), Vec2.of(100, -100), Vec2.of(7, 120) ],
+			[
+				Vec2.of(28, 5),
+				Vec2.of(4, 5),
+				Vec2.of(-100, -100),
+				Vec2.of(-100, -100),
+				Vec2.of(7, 120),
+				Vec2.of(1, 8),
+				Vec2.of(100, -100),
+				Vec2.of(2, 4),
+				Vec2.of(3, 4),
+				Vec2.of(4, 5),
+			],
+			[Vec2.of(-100, -100), Vec2.of(100, -100), Vec2.of(7, 120)],
 		],
 
 		// Points within a square
 		[
-			[ Vec2.of(28, 5), Vec2.of(4, 5), Vec2.of(-100, -100), Vec2.of(100, 100), Vec2.of(7, 100), Vec2.of(1, 8), Vec2.of(-100, 100), Vec2.of(100, -100), Vec2.of(2, 4), Vec2.of(3, 4), Vec2.of(4, 5) ],
-			[ Vec2.of(-100, -100), Vec2.of(100, -100), Vec2.of(100, 100), Vec2.of(-100, 100) ],
+			[
+				Vec2.of(28, 5),
+				Vec2.of(4, 5),
+				Vec2.of(-100, -100),
+				Vec2.of(100, 100),
+				Vec2.of(7, 100),
+				Vec2.of(1, 8),
+				Vec2.of(-100, 100),
+				Vec2.of(100, -100),
+				Vec2.of(2, 4),
+				Vec2.of(3, 4),
+				Vec2.of(4, 5),
+			],
+			[Vec2.of(-100, -100), Vec2.of(100, -100), Vec2.of(100, 100), Vec2.of(-100, 100)],
 		],
 
-		[
-			Rect2.unitSquare.corners,
-			[ Vec2.of(1, 0), Vec2.of(1, 1), Vec2.of(0, 1), Vec2.of(0, 0) ],
-		]
+		[Rect2.unitSquare.corners, [Vec2.of(1, 0), Vec2.of(1, 1), Vec2.of(0, 1), Vec2.of(0, 0)]],
 	])('should compute the convex hull of a set of points (%j)', (points, expected) => {
 		expect(convexHull2Of(points)).toMatchObject(expected);
 	});
-});
+});

package/src/utils/convexHull2Of.ts

@@ -13,11 +13,11 @@ const convexHull2Of = (points: Point2[]) => {
 
 	// 1. Start with a vertex on the hull
 	const lowestPoint = points.reduce(
-		(lowest, current) => current.y < lowest.y ? current : lowest,
-		points[0]
+		(lowest, current) => (current.y < lowest.y ? current : lowest),
+		points[0],
 	);
-	const vertices = [ lowestPoint ];
-	let toProcess = [...points.filter(p => !p.eq(lowestPoint))];
+	const vertices = [lowestPoint];
+	let toProcess = [...points.filter((p) => !p.eq(lowestPoint))];
 	let lastBaseDirection = Vec2.of(-1, 0);
 
 	// 2. Find the point with greatest angle from the vertex:
@@ -29,7 +29,9 @@ const convexHull2Of = (points: Point2[]) => {
 	while (toProcess.length > 0) {
 		const lastVertex = vertices[vertices.length - 1];
 
-		let smallestDotProductSoFar: number = lastBaseDirection.dot(lowestPoint.minus(lastVertex).normalizedOrZero());
+		let smallestDotProductSoFar: number = lastBaseDirection.dot(
+			lowestPoint.minus(lastVertex).normalizedOrZero(),
+		);
 		let furthestPointSoFar = lowestPoint;
 		for (const point of toProcess) {
 			// Maximizing the angle is the same as minimizing the dot product:
@@ -46,7 +48,7 @@ const convexHull2Of = (points: Point2[]) => {
 				smallestDotProductSoFar = currentDotProduct;
 			}
 		}
-		toProcess = toProcess.filter(p => !p.eq(furthestPointSoFar));
+		toProcess = toProcess.filter((p) => !p.eq(furthestPointSoFar));
 
 		const newBaseDirection = furthestPointSoFar.minus(lastVertex).normalized();
 
@@ -68,4 +70,4 @@ const convexHull2Of = (points: Point2[]) => {
 	return vertices;
 };
 
-export default convexHull2Of;
+export default convexHull2Of;

package/tsconfig.json

@@ -1,7 +1,5 @@
 {
 	"extends": "../../tsconfig.json",
 
-	"include": [
-		"**/*.ts"
-	]
+	"include": ["**/*.ts"]
 }

package/typedoc.json

@@ -1,5 +1,5 @@
 {
 	"extends": ["../../typedoc.base.json"],
 	"entryPoints": ["./src/lib.ts"],
-	"readme": "./README.md",
-}
+	"readme": "./README.md"
+}