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.
-
Notifications
You must be signed in to change notification settings - Fork 0
A quadtree implementation in koltin
License
Hanseter/quadtree
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
A quadtree implementation in koltin
Topics
Resources
License
Stars
Watchers
Forks
Packages 0
No packages published