quadtree-lib
Quadtree
A CoffeeScript implementation of a data structure used for efficient 2D collision detection and organization.
Efficient quadtrees library written in CoffeeScript.
48 stars
4 watching
5 forks
Language: CoffeeScript
last commit: 2 months ago
Linked from 1 awesome list
2dcoffeescriptcolliding-elementscollision-detectiondatastructuredatastructuresquad-treequadtreequadtree-libtree-structuretypescriptumd
Related projects:
Repository | Description | Stars |
---|---|---|
| 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 |
| A Go library implementing various quadtree data structures for efficient point location and neighbor finding in 2D spaces. | 134 |
| An implementation of Region Trees for efficient spatial partitioning and data storage | 2 |
| A CoffeeScript implementation of an efficient partitioning algorithm for linear data structures | 269 |
| A concurrent data structure implementation for efficient tree-based operations with atomic cloning and snapshot isolation. | 148 |
| A Quasar App Extension providing drag-and-drop hierarchical data display | 72 |
| An implementation of MessagePack serialization format in CoffeeScript for Node.js and the browser. | 50 |
| An interactive tutorial on Binary Search Trees designed for the Swift Playgrounds application on iPads | 24 |
| An Elasticsearch client written in CoffeeScript for Node.js, providing a simple way to define and interact with data. | 13 |
| A Vue.js 2 application built with CoffeeScript and tools to simplify HTML rendering during building | 23 |
| Enables fluent method chaining on ordinary classes and objects | 171 |
| A Neo4j Graph Eloquent Driver for Laravel | 644 |
| The source code repository for the Manning book CoffeeScript in Action, which provides CoffeeScript implementations and examples. | 33 |
| A C implementation of an efficient data structure for fast lookups and prefix matching in memory databases. | 775 |