Spatial point location using binary space partition tree
-
Updated
Feb 27, 2018 - C++
Spatial point location using binary space partition tree
Find the shortest polyline between 2 points in a map by implementing the funnel algorithm
A Computational Geomemtry Class Project that implements DCEL data struture and Polygon triangulation as well as Plannar point location using persistent search trees.
Trapezoidal Map library — a data structure for fast point location queries
Point Location in Two-Dimensional Space Using Separator Method
Kirkpatrick Algorithm - implementation of point location algorithm in 2D triangulated space
A modular and efficent implementation of the Trapezoidal Map algorithm without the use of pointers or dinamic allocation.
💎 Implementation of the algorithm described in http://drops.dagstuhl.de/opus/volltexte/2016/6376
Implementations for various point location algorithms on planar subdivisions
Master's thesis (2014-2015) + preparatory work (memof403 2013-2014)
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."