this is for holding javascript data
Xavier Holt added nearest_neighbour_search_w_kd__.md
about 8 years ago
Commit id: 195443ad06972acac3bf79620ef90ebd08e83111
deletions | additions
diff --git a/nearest_neighbour_search_w_kd__.md b/nearest_neighbour_search_w_kd__.md
new file mode 100644
index 0000000..25293e8
--- /dev/null
+++ b/nearest_neighbour_search_w_kd__.md
...
nearest neighbour search w/ kd-tree
https://en.wikipedia.org/wiki/K-d_tree
EMST spanning tree https://en.wikipedia.org/wiki/Euclidean_minimum_spanning_tree w/ delauney triangularisation
https://en.wikipedia.org/wiki/Delaunay_triangulation
reverse the process of finding the tangent lines in question above
A new fast algorithm for computing the distance between two disjoint convex polygons based on Voronoi diagram
Optimal Algorithms for Computing the Minimum Distance Between Two Finite Planar Sets
