|
This data structure allows to compute the Delaunay triangulation of a point set in d-dimensional space. It also supports point location and range queries. Note that this data structure is slower than their 2D and 3D counterparts when applied to 2D or 3D points.
| |||||||||||||
|
|
|||||||||||||