Spatial point location using binary space partition tree
-
Updated
Feb 27, 2018 - C++
Spatial point location using binary space partition tree
A Computational Geomemtry Class Project that implements DCEL data struture and Polygon triangulation as well as Plannar point location using persistent search trees.
A modular and efficent implementation of the Trapezoidal Map algorithm without the use of pointers or dinamic allocation.
Implementations for various point location algorithms on planar subdivisions
Add a description, image, and links to the point-location topic page so that developers can more easily learn about it.
To associate your repository with the point-location topic, visit your repo's landing page and select "manage topics."