Skip to content

C++ QuadTree & KdTree for fast region searching of 10 million+ 2d points

Notifications You must be signed in to change notification settings

ericc59/ChurchillNavigationChallenge

Repository files navigation

ChurchillNavigationChallenge

http://churchillnavigation.com/challenge/

Efficient range searching of 10 million+ 2D points using a QuadTree or a 2D KdTree

QuadTree Subdivisions and 2d Point Dispersement

alt tag

KdTree Subdivisions and 2d Point Dispersement

alt tag

About

C++ QuadTree & KdTree for fast region searching of 10 million+ 2d points

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published