d3-polygon
This module provides a few basic geometric operations for two-dimensional polygons. Each polygon is represented as an array of two-element arrays [[ x0 , y0 ], [ x1 , y1 ], …], and may either be closed (wherein the first and last point are the same) or open (wherein they are not). Typically polygons are in counterclockwise order, assuming a coordinate system where the origin is in the top-left corner.
polygonArea( polygon )
Source · Returns the signed area of the specified polygon . If the vertices of the polygon are in counterclockwise order (assuming a coordinate system where the origin is in the top-left corner), the returned area is positive; otherwise it is negative, or zero.
polygonCentroid( polygon )
Source · Returns the centroid of the specified polygon .
polygonHull( points )
Source · Returns the convex hull of the specified points using Andrew’s monotone chain algorithm . The returned hull is represented as an array containing a subset of the input points arranged in counterclockwise order. Returns null if points has fewer than three elements.
polygonContains( polygon , point )
Source · Returns true if and only if the specified point is inside the specified polygon .
polygonLength( polygon )
Source · Returns the length of the perimeter of the specified polygon .