You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
* Eigen example CMake target name changed from eigen to eigen_space_type.
** The name seems to collide with the eigen library target name since v3.4.
** Similarly updated the opencv example target name.
* CMake package installation directory updated.
* Repaired broken reference links in the README.md.
Copy file name to clipboardExpand all lines: README.md
+2-2Lines changed: 2 additions & 2 deletions
Display the source diff
Display the rich diff
Original file line number
Diff line number
Diff line change
@@ -121,8 +121,8 @@ $ pip install ./pico_tree
121
121
# References
122
122
123
123
* J. L. Bentley, [Multidimensional binary search trees used for associative searching](https://dl.acm.org/doi/pdf/10.1145/361002.361007), Communications of the ACM, vol. 18, no. 9, pp. 509–517, 1975.
124
-
* S. Arya and D. M. Mount, [Algorithms for fast vector quantization](https://www.cs.umd.edu/~mount/Papers/DCC.pdf), In IEEE Data Compression Conference, pp. 381–390, March 1993.
125
-
* S. Maneewongvatana and D. M. Mount, [It's okay to be skinny, if your friends are fat](http://www.cs.umd.edu/~mount/Papers/cgc99-smpack.pdf), 4th Annual CGC Workshop on Computational Geometry, 1999.
124
+
* S. Arya and D. M. Mount, [Algorithms for fast vector quantization](https://citeseerx.ist.psu.edu/document?repid=rep1&type=pdf&doi=5690df491a0f5efe38e1640f25440006de479008), In IEEE Data Compression Conference, pp. 381–390, March 1993.
125
+
* S. Maneewongvatana and D. M. Mount, [It's okay to be skinny, if your friends are fat](https://citeseerx.ist.psu.edu/document?repid=rep1&type=pdf&doi=97f9ac624385c6dbcb28031e53cc08e02331c778), 4th Annual CGC Workshop on Computational Geometry, 1999.
126
126
* S. Arya and H. Y. Fu, [Expected-case complexity of approximate nearest neighbor searching](https://www.cse.ust.hk/faculty/arya/pub/exp.pdf), InProceedings of the 11th ACM-SIAM Symposium on Discrete Algorithms, 2000.
127
127
* N. Sample, M. Haines, M. Arnold and T. Purcell, [Optimizing Search Strategies in k-d Trees](http://infolab.stanford.edu/~nsample/pubs/samplehaines.pdf), In: 5th WSES/IEEE World Multiconference on Circuits, Systems, Communications & Computers (CSCC 2001), July 2001.
128
128
* A. Yershova and S. M. LaValle, [Improving Motion-Planning Algorithms by Efficient Nearest-Neighbor Searching](http://msl.cs.uiuc.edu/~lavalle/papers/YerLav06.pdf), In IEEE Transactions on Robotics, vol. 23, no. 1, pp. 151-157, Feb. 2007.
0 commit comments