Compute bounding sphere for a set of points using Jack Ritter's algorithm
-
Updated
Jan 3, 2023 - JavaScript
Compute bounding sphere for a set of points using Jack Ritter's algorithm
Unofficial fork of Norio Katayama's SR Tree spatial indexing implementation for high-dimensional data
[Testing repo for conan-center-index] Conan recipes for libspatialindex
Finite Element Data Exchange System with Octree spatial indexing
[UNMAINTAINED] Rust bindings to H3, Uber's hexagonal hierarchical geospatial indexing system
PostgreSQL extension for the H3 hierarchical geospatial indexing system
R bindings to H3, a hexagon-based geographic grid system via h3-js.
[Testing repo for conan-center-index] Conan recipes for H3
Hexagonal hierarchical geospatial indexing system in pure Go
Bindings for H3 to SQLite3
Spatial decomposition without space filling curves
Basic implementations of kd tree and quad tree in python
Utilites and functions for easy usage of S2 objects (Google geometries abstractions)
A module to create hexagonal grids on a sphere
R-Tree Data Structure for Spatial Indexing
Presto bindings for H3, a hierarchical hexagonal geospatial indexing system
Vantage point tree implementation in OCaml
Measuring aspects of the H3 hexagonal hierarchical geospatial indexing system.
Access Uber's h3-js library via R and V8 - https://uber.github.io/h3/#/documentation/overview/use-cases
Add a description, image, and links to the spatial-indexing topic page so that developers can more easily learn about it.
To associate your repository with the spatial-indexing topic, visit your repo's landing page and select "manage topics."