given two points, it returns the angle in degrees from one to the other
Fill a polygon with lines
Finds the angle formed by two adjacent segments.
Takes two points and finds the bearing angle between them along a Rhumb line.
Implementation of the Graham Scan algorithm to calculate a convex hull from a given array of x, y coordinates.
Estimate points on a bezier curve or a set of connexted bezier curves
Core logic for the angle-slider widget implemented as a state machine
Takes two points and finds the geographic bearing between them.
Convert values with PostCSS (e.g. ms -> s)
Takes a FeatureCollection of points and calculates the median center.
An Angular library for 2D geometric computations, providing classes and utilities for manipulating points, lines, vectors, rectangles, arcs, and transformations.
A very fast static 2D index for points based on kd-tree.
Euclidean geometry classes and tools for JavaScript
Takes a set of points and creates a Triangulated Irregular Network.
Moves a shape or location in a specific direction.
A module to check if a polygon self-intersects using a sweepline algorithm
Takes a set of points and partition them into clusters according to DBSCAN's data clustering algorithm.
Calculates the average angle of a set of lines, measuring the trend of it.
Creates a circular arc, of a circle of the given radius and center point, between two bearings.
Calculate the perfect catenary between two points
Perfect interpolation for animated multiplayer cursors.
Tesseract C++ API in Pure Javascript
Creates a circular sector of a circle.
Estimate points on a SVG path