| Age | Commit message (Collapse) | Author |
|---|
|
I may need to add another status code to control wether the stop
should be counted. For now, all my use cases wanted the count.
|
|
Much like libstage nodes can now have their position set using relative
AABBs, it's convenient to have the same paradigm in libix2.
|
|
Was returning the user-supplied object pointer as the ix2_object_t,
oops.
|
|
The -1,-1...1,1 AABB seems so likely to be used, make it the
default used when supplying a NULL for the root AABB.
|
|
libix2 implements a simple spatial index of objects described by
2D axis-aligned bounding boxes (AABB).
It does so by internally utilizing a traditional quadtree data
structure.
At this time only simple AABB and point search queries are
supported, with a simple per-match callback interface.
It may make sense to in the future add support for indexing
other 2D shapes than AABBs, like circles.
It would also make senes to add more interesting search queries
like radial ranges and such.
The intended use is for broad-phase collision detection in
2D games.
|
