#quad-tree #indexing #ggez #bounding-box

qtree

A bounding box quad tree implementation that works with ggez

1 unstable release

0.1.0 Mar 17, 2019

#17 in #ggez

MIT license

16KB
357 lines

qtree

This crate implements a simple quad tree - a data structure useful for indexing 2D space. This implementation allows you to store rectangles representing your objects' bounding boxes and query all object IDs which contain a given point. The unique ID implementation comes from snowflake.

The ggez feature lets you integrate and debug the quad tree easily from ggez.

Usage

See examples/ for a simple ggez program taking advantage of object-cursor collision detection using this crate.

License

MIT

Dependencies

~43MB
~806K SLoC