Skip to content

Implementation of a Binary Space Partitioning Tree

License

Notifications You must be signed in to change notification settings

SiddChugh/BSP-Tree

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

3 Commits
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

This demo project implements a Binary Space Partitioning Tree (https://en.wikipedia.org/wiki/Binary_space_partitioning) and several helper functions to query the nearest point in the tree. The goal of the project was to implement the function nearestPoint and write unit tests and a Makefile for testing and compilation purposes.

Compile: Simply type make to compile the source code for BVTree

Unit Tests: To execute unit tests, please type make test to create an executable. Then type ./BVTreeTest to run all the unit tests.

About

Implementation of a Binary Space Partitioning Tree

Topics

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published