Skip to content

Given some points of form (x,y,z) and a rectangular prism detect the number of points within the boundary of that prism. Utilizing fractional cascading to get O(n^(1/2)) query time

Notifications You must be signed in to change notification settings

bharathc346/KDTrees

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

1 Commit
 
 
 
 
 
 

About

Given some points of form (x,y,z) and a rectangular prism detect the number of points within the boundary of that prism. Utilizing fractional cascading to get O(n^(1/2)) query time

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages