mourner/geokdbush

The smallest and simplest JavaScript priority queue

All the 138,398 cities of the world with a population of at least 1000 inhabitants, in a big JSON array

A strict ESLint config for my JavaScript projects

A very fast static 2D index for points based on kd-tree.

search for k nearest neighbors on a sphere

Javascript implementation of the Vantage-Point Tree nearest neighbor search algorithm

A tool for editing vector datasets for mapping and GIS.

Give me your coordinates and I'll tell you where the nearest cities are. Works offline.

Give me your coordinates and I'll tell you where the nearest cities are. Works offline.

Find the nearest city for given coordinates with geonames.org data

A very fast density based clustering library for geographic points

It's a package that works offline and return cities using latitude, longitude and radius

Given a GeoJSON LineString network and a Location object, remove unused network areas.

Compresses array of geo location by removing points that are near to each other.

faster, feature rich dijkstra for real world applications

Snap line ends to nearest network node

Open Places Javascript Library

Searches the nearest cities in The United States using [geokdbush](https://github.com/mourner/geokdbush). Data courtesy [US at geonames.org](http://download.geonames.org/export/dump/). Based on [find-nearest-cities](https://github.com/steffenmllr/find-nearest-cities)

Give me your coordinates and I'll tell you where the nearest cities are. Works offline.

Quickly find points in large sets of polygons

Contraction Hierarchy

A tool for editing vector datasets for mapping and GIS.

Find the nearest DB Stations given a Latitude and a Longitude

Given a GeoJSON LineString network and a Location point object, return a lookup of the closest node to each point.

In-memory service adapter with geolocation support for featherjs