racket-quad-tree
Quad tree
An implementation of a data structure for efficient partitioning and searching in two-dimensional space
An implementation of quad-trees in Racket.
0 stars
2 watching
0 forks
Language: Racket
last commit: over 8 years ago
Linked from 1 awesome list
avelino/awesome-racketRelated projects:
| Repository | Description | Stars |
|---|---|---|
 s0rg/quadtree | A data structure implementation that efficiently stores and retrieves spatial locations using a quadtree algorithm. | 37 |
 ducasse/quadtree | An implementation of Region Trees for efficient spatial partitioning and data storage | 2 |
 elbywan/quadtree-lib | A CoffeeScript implementation of a data structure used for efficient 2D collision detection and organization. | 48 |
 arl/go-rquad | A Go library implementing various quadtree data structures for efficient point location and neighbor finding in 2D spaces. | 134 |
 racket/db | Provides a simple and efficient way to interact with relational databases | 21 |
 dedbox/racket-algebraic | Provides a Racket extension for untyped algebraic data structures with first-class support for sums and products. | 75 |
 johnstonskj/rml-decisiontrees | An implementation of decision trees for classification in Racket machine learning. | 4 |
 joelrorseth/tree-trouble | An interactive tutorial on Binary Search Trees designed for the Swift Playgrounds application on iPads | 24 |
 dmxlarchey/kruskal-trees | A Coq library formalizing rose trees for mathematical proof and theorem proving | 1 |
 rmculpepper/sql | Racket-based implementation of some SQL features | 33 |
 pycket/pycket | A Racket/Scheme implementation generated using the RPython framework to produce a fast binary interpreter. | 257 |
 benedikt/mongoid-tree | A Mongoid document extension for building tree structures with a materialized path pattern | 302 |
 splintered-reality/py_trees_ros | ROS extensions and implementations for py_trees behaviour trees | 161 |
 haskell/critbit | An implementation of crit-bit trees for efficient key/value storage and lookup in Haskell | 138 |
 crispymtn/linear-partition | A CoffeeScript implementation of an efficient partitioning algorithm for linear data structures | 269 |