A project for Computational Geometry course.
We implemented such data structures as QuadTrees and KDTrees to fast search points in 2D ranges. Then we tested and comapared their speed including construction and searching. We prepared visualisation of the algorithms using provided graphic tool.
In those documents (both in Polish) we explained how the structures work and how they were implemented, how to use our work and what are the results of our tests:
-
Notifications
You must be signed in to change notification settings - Fork 0
smelaa/QuadTrees_KDTrees
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
No description, website, or topics provided.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published