The quadtree is an important 2D data structure and forms the core of many spatial algorithms, including compression, collision detection, and stitching algorithms. Below you can download general purpose quadtree implementations in Java and Python.
The code accompanies the Quadtrees article in Dev.Mag. The tutorial explains how the implement a quadtree that can be use to store 2D data efficiently, lists what considerations there are in real-world applications, and gives some debugging tips.
Channels Compressed Simultaneously
 |
 |
| The original image (by smcgee). | The image after being loaded into a quadtree. |
Channels Compressed Separately
 |
 |
| Red channel compressed. | Green channel compressed. |
 |
 |
| Blue channel compressed. | Compressed channels combined. |
Downloads
Java Implementation
Python Implementation
Download from: http://code-spot.co.za/python-image-code/.
Related posts:
- Quadtrees The code below implements some quadtree extensions, as discussed in...
- Region Quadtrees in C++ (Original image by GoAwayStupidAI). Below are four C++ implementations of...
- Force Field Editor v1.0 Vector fields are used in certain AI and simulation techniques....
Tags: 2D, AI, compression, computer graphics, Dev.Mag, Game Development, image partitioning, Image Processing, Python, quadtree, quadtrees, spatial partitioning
1 comment
Comments feed for this article
Trackback link: http://code-spot.co.za/2008/10/06/quadtrees/trackback/