QuadTree
Spatial partitioning library
An implementation of Region Trees for efficient spatial partitioning and data storage
to experiment with QuadTrees
2 stars
2 watching
1 forks
Language: Smalltalk
last commit: almost 4 years agoLinked from 1 awesome list
pharo
Related projects:
| Repository | Description | Stars |
|---|---|---|
| A data structure implementation for efficient grid organization of items | 3 | |
| A Go library implementing various quadtree data structures for efficient point location and neighbor finding in 2D spaces. | 134 | |
| A data structure implementation that efficiently stores and retrieves spatial locations using a quadtree algorithm. | 37 | |
| An implementation of a data structure for efficient partitioning and searching in two-dimensional space | 0 | |
| An implementation of an octree data structure used in 4k graphics rendering | 2 | |
| A Smalltalk implementation of a database that stores data in memory | 0 | |
| A data structure collection implementation with ordered multi-map features | 0 | |
| An implementation of Pugh's Skip List data structure in Smalltalk. | 1 | |
| A Julia package that provides a lightweight framework for defining and working with N-dimensional spatial data structures | 111 | |
| An efficient spatial data structure for fast point query operations | 43 | |
| A data structure dictionary with lookup capabilities in ancestors | 2 | |
| Enables storage and exchange of decision tree models in a format independent of specific frameworks or platforms. | 742 | |
| An implementation of a data structure used to store hierarchical data in Smalltalk. | 0 | |
| A C library implementation of a data structure for fast searching and nearest neighbor queries in k-dimensional space | 396 | |
| A CoffeeScript implementation of a data structure used for efficient 2D collision detection and organization. | 48 |