A simple quadtree implementation in kotlin. It can contain volumetric shapes (i.e. rectangles) and find the elements associated with that shape either by intersection with another rectangle or by a point contained within the rectangle.
Hanseter/quadtree
Folders and files
| Name | Name | Last commit date | ||
|---|---|---|---|---|