QuadTree

Spatial partitioning library

An implementation of Region Trees for efficient spatial partitioning and data storage

to experiment with QuadTrees

GitHub

2 stars
2 watching
1 forks
Language: Smalltalk
last commit: about 2 years ago
Linked from 1 awesome list

pharo

Backlinks from these awesome lists:

Related projects:

Repository Description Stars
ducasse/containers-grid A data structure implementation for efficient grid organization of items 3
arl/go-rquad A Go library implementing various quadtree data structures for efficient point location and neighbor finding in 2D spaces. 134
s0rg/quadtree A data structure implementation that efficiently stores and retrieves spatial locations using a quadtree algorithm. 37
dented42/racket-quad-tree An implementation of a data structure for efficient partitioning and searching in two-dimensional space 0
lestahl/octree An implementation of an octree data structure used in 4k graphics rendering 2
ducasse/cdb A Smalltalk implementation of a database that stores data in memory 0
ducasse/containers-orderedmultimap A data structure collection implementation with ordered multi-map features 0
ducasse/containers-skiplist An implementation of Pugh's Skip List data structure in Smalltalk. 1
juliageometry/regiontrees.jl A Julia package that provides a lightweight framework for defining and working with N-dimensional spatial data structures 111
jblindsay/kdtree An efficient spatial data structure for fast point query operations 43
ducasse/containers-propertyenvironment A data structure dictionary with lookup capabilities in ancestors 2
dmlc/treelite Enables storage and exchange of decision tree models in a format independent of specific frameworks or platforms. 742
pharo-containers/containers-keyedtree An implementation of a data structure used to store hierarchical data in Smalltalk. 0
jtsiomb/kdtree A C library implementation of a data structure for fast searching and nearest neighbor queries in k-dimensional space 396
elbywan/quadtree-lib A CoffeeScript implementation of a data structure used for efficient 2D collision detection and organization. 48