Utility functions for the workspace

Fast point-in-polygon intersection for large numbers of polygons.

Calculates the distance from a point to the edges of a polygon or multi-polygon.

Takes a bounding box and calculates the minimum square bounding box that would contain the input.

Layout algorithms for visualizing hierarchical data.

Converts a bounding box to a GeoJSON polygon.

A utility for getting geo-location information via HTML5 and IP look-ups, geocoding, address look-ups, distance and durations, timezone information and more...

provide geographic information about mail senders.

<p align="center"> <img height="100" src="https://raw.githubusercontent.com/pelias/design/master/logo/pelias_github/Github_markdown_hero.png"> </p> <h3 align="center">A modular, open-source search engine for our world.</h3> <p align="center">Pelias is a

Takes a polygon and return true or false as to whether it is concave or not.

Pure-Javascript version of the H3 library, a hexagon-based geographic grid system

Splits GeoJSON Objects that cross the Antimeridian. See [RFC 7946 Section 3.1.9](https://tools.ietf.org/html/rfc7946#section-3.1.9)

Checks if the geometry is a valid according to the OGC Simple Feature Specification.

Takes input features and flips all of their coordinates.

Location-based querying and filtering using Firebase's Firestore

Generates a bounding box around a GeoJSON feature.

Determine whether each segment of a line is parallel to the correspondent segment of another line.

Calculates the geodesic area in square meters of one or more polygons.

Finds the angle formed by two adjacent segments.

Takes any LineString or Polygon GeoJSON and returns the intersecting point(s).