Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance 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

Contributors

AltStyle によって変換されたページ (->オリジナル) /