diff --git a/404.html b/404.html
index 6327934..2bca33e 100644
--- a/404.html
+++ b/404.html
@@ -57,7 +57,7 @@ <h1>Page not found (404)</h1>
 
 
     <footer><div class="pkgdown-footer-left">
-  <p>Developed by Gregory Jefferis.</p>
+  <p>Developed by Gregory Jefferis, Samuel E. Kemp, Sunil Arya, David Mount.</p>
 </div>
 
 <div class="pkgdown-footer-right">
diff --git a/authors.html b/authors.html
index 50a02c1..0af2488 100644
--- a/authors.html
+++ b/authors.html
@@ -35,22 +35,39 @@ <h1>Authors and Citation</h1>
       <h2>Authors</h2>
 
       <ul class="list-unstyled"><li>
-          <p><strong>Gregory Jefferis</strong>. Maintainer.
+          <p><strong>Gregory Jefferis</strong>. Author, maintainer. <a href="https://orcid.org/0000-0002-0587-9355" target="orcid.widget" aria-label="ORCID" class="external-link"><span class="fab fa-orcid orcid" aria-hidden="true"></span></a>
           </p>
         </li>
+        <li>
+          <p><strong>Samuel E. Kemp</strong>. Author.
+          </p>
+        </li>
+        <li>
+          <p><strong>Sunil Arya</strong>. Author, copyright holder. <a href="https://orcid.org/0000-0003-0939-4192" target="orcid.widget" aria-label="ORCID" class="external-link"><span class="fab fa-orcid orcid" aria-hidden="true"></span></a>
+          </p>
+        </li>
+        <li>
+          <p><strong>David Mount</strong>. Author, copyright holder. <a href="https://orcid.org/0000-0002-3290-8932" target="orcid.widget" aria-label="ORCID" class="external-link"><span class="fab fa-orcid orcid" aria-hidden="true"></span></a>
+          </p>
+        </li>
+        <li>
+          <p><strong>University of Maryland</strong>. Copyright holder.
+          <br><small>ANN library is copyright University of Maryland and Sunil Arya and
+    David Mount. See file COPYRIGHT for details</small></p>
+        </li>
       </ul></div>
 
     <div class="section level2">
       <h2 id="citation">Citation</h2>
       <p><small class="dont-index">Source: <a href="/jefferislab/RANN/blob/master/DESCRIPTION" class="external-link"><code>DESCRIPTION</code></a></small></p>
 
-      <p>Arya S, Mount D, Kemp SE, Jefferis G (2024).
+      <p>Jefferis G, Kemp SE, Arya S, Mount D (2024).
 <em>RANN: Fast Nearest Neighbour Search (Wraps ANN Library) Using L2 Metric</em>.
 R package version 2.6.1, http://jefferislab.github.io/RANN/, <a href="/jefferislab/RANN" class="external-link">https://github.com/jefferislab/RANN</a>.
 </p>
       <pre>@Manual{,
   title = {RANN: Fast Nearest Neighbour Search (Wraps ANN Library) Using L2 Metric},
-  author = {Sunil Arya and David Mount and Samuel E. Kemp and Gregory Jefferis},
+  author = {Gregory Jefferis and Samuel E. Kemp and Sunil Arya and David Mount},
   year = {2024},
   note = {R package version 2.6.1, http://jefferislab.github.io/RANN/},
   url = {https://github.com/jefferislab/RANN},
@@ -62,7 +79,7 @@ <h2 id="citation">Citation</h2>
 
 
     <footer><div class="pkgdown-footer-left">
-  <p>Developed by Gregory Jefferis.</p>
+  <p>Developed by Gregory Jefferis, Samuel E. Kemp, Sunil Arya, David Mount.</p>
 </div>
 
 <div class="pkgdown-footer-right">
diff --git a/cran-comments-l1.html b/cran-comments-l1.html
index 43731cd..72d31af 100644
--- a/cran-comments-l1.html
+++ b/cran-comments-l1.html
@@ -40,7 +40,7 @@ <h1>NA</h1>
 
 
     <footer><div class="pkgdown-footer-left">
-  <p>Developed by Gregory Jefferis.</p>
+  <p>Developed by Gregory Jefferis, Samuel E. Kemp, Sunil Arya, David Mount.</p>
 </div>
 
 <div class="pkgdown-footer-right">
diff --git a/index.html b/index.html
index baac2ae..9fe27fb 100644
--- a/index.html
+++ b/index.html
@@ -120,7 +120,11 @@ <h2 data-toc-skip>Citation</h2>
 <div class="developers">
 <h2 data-toc-skip>Developers</h2>
 <ul class="list-unstyled">
-<li>Gregory Jefferis <br><small class="roles"> Maintainer </small>  </li>
+<li>Gregory Jefferis <br><small class="roles"> Author, maintainer </small> <a href="https://orcid.org/0000-0002-0587-9355" target="orcid.widget" aria-label="ORCID" class="external-link"><span class="fab fa-orcid orcid" aria-hidden="true"></span></a> </li>
+<li>Samuel E. Kemp <br><small class="roles"> Author </small>  </li>
+<li>Sunil Arya <br><small class="roles"> Author, copyright holder </small> <a href="https://orcid.org/0000-0003-0939-4192" target="orcid.widget" aria-label="ORCID" class="external-link"><span class="fab fa-orcid orcid" aria-hidden="true"></span></a> </li>
+<li>David Mount <br><small class="roles"> Author, copyright holder </small> <a href="https://orcid.org/0000-0002-3290-8932" target="orcid.widget" aria-label="ORCID" class="external-link"><span class="fab fa-orcid orcid" aria-hidden="true"></span></a> </li>
+<li><a href="authors.html">More about authors...</a></li>
 </ul>
 </div>
 
@@ -131,7 +135,7 @@ <h2 data-toc-skip>Developers</h2>
 
 
     <footer><div class="pkgdown-footer-left">
-  <p>Developed by Gregory Jefferis.</p>
+  <p>Developed by Gregory Jefferis, Samuel E. Kemp, Sunil Arya, David Mount.</p>
 </div>
 
 <div class="pkgdown-footer-right">
diff --git a/news/index.html b/news/index.html
index f4270fb..c82c4a4 100644
--- a/news/index.html
+++ b/news/index.html
@@ -90,7 +90,7 @@ <h2 class="pkg-version" data-toc-text="2.2.0" id="rann-220">RANN 2.2.0<a class="
 
 
     <footer><div class="pkgdown-footer-left">
-  <p>Developed by Gregory Jefferis.</p>
+  <p>Developed by Gregory Jefferis, Samuel E. Kemp, Sunil Arya, David Mount.</p>
 </div>
 
 <div class="pkgdown-footer-right">
diff --git a/pkgdown.yml b/pkgdown.yml
index 854d08c..c7b0404 100644
--- a/pkgdown.yml
+++ b/pkgdown.yml
@@ -2,7 +2,7 @@ pandoc: 3.1.11
 pkgdown: 2.1.0
 pkgdown_sha: ~
 articles: {}
-last_built: 2024-08-24T15:31Z
+last_built: 2024-08-24T16:15Z
 urls:
   reference: http://jefferislab.github.io/RANN/reference
   article: http://jefferislab.github.io/RANN/articles
diff --git a/reference/RANN-package.html b/reference/RANN-package.html
index 988812a..1ef0dc6 100644
--- a/reference/RANN-package.html
+++ b/reference/RANN-package.html
@@ -47,7 +47,7 @@ <h2 id="see-also">See also<a class="anchor" aria-label="anchor" href="#see-also"
 
 
     <footer><div class="pkgdown-footer-left">
-  <p>Developed by Gregory Jefferis.</p>
+  <p>Developed by Gregory Jefferis, Samuel E. Kemp, Sunil Arya, David Mount.</p>
 </div>
 
 <div class="pkgdown-footer-right">
diff --git a/reference/index.html b/reference/index.html
index f7ddb31..5598632 100644
--- a/reference/index.html
+++ b/reference/index.html
@@ -59,7 +59,7 @@ <h2 id="all-functions">All functions<a class="anchor" aria-label="anchor" href="
 
 
     <footer><div class="pkgdown-footer-left">
-  <p>Developed by Gregory Jefferis.</p>
+  <p>Developed by Gregory Jefferis, Samuel E. Kemp, Sunil Arya, David Mount.</p>
 </div>
 
 <div class="pkgdown-footer-right">
diff --git a/reference/nn2.html b/reference/nn2.html
index b1750f2..5ea7f0b 100644
--- a/reference/nn2.html
+++ b/reference/nn2.html
@@ -152,7 +152,7 @@ <h2 id="ref-examples">Examples<a class="anchor" aria-label="anchor" href="#ref-e
 
 
     <footer><div class="pkgdown-footer-left">
-  <p>Developed by Gregory Jefferis.</p>
+  <p>Developed by Gregory Jefferis, Samuel E. Kemp, Sunil Arya, David Mount.</p>
 </div>
 
 <div class="pkgdown-footer-right">
diff --git a/search.json b/search.json
index b397fa2..a480fdb 100644
--- a/search.json
+++ b/search.json
@@ -1 +1 @@
-[{"path":"http://jefferislab.github.io/RANN/authors.html","id":null,"dir":"","previous_headings":"","what":"Authors","title":"Authors and Citation","text":"Gregory Jefferis. Maintainer.","code":""},{"path":"http://jefferislab.github.io/RANN/authors.html","id":"citation","dir":"","previous_headings":"","what":"Citation","title":"Authors and Citation","text":"Arya S, Mount D, Kemp SE, Jefferis G (2024). RANN: Fast Nearest Neighbour Search (Wraps ANN Library) Using L2 Metric. R package version 2.6.1, http://jefferislab.github.io/RANN/, https://github.com/jefferislab/RANN.","code":"@Manual{,   title = {RANN: Fast Nearest Neighbour Search (Wraps ANN Library) Using L2 Metric},   author = {Sunil Arya and David Mount and Samuel E. Kemp and Gregory Jefferis},   year = {2024},   note = {R package version 2.6.1, http://jefferislab.github.io/RANN/},   url = {https://github.com/jefferislab/RANN}, }"},{"path":"http://jefferislab.github.io/RANN/index.html","id":"rann","dir":"","previous_headings":"","what":"Fast Nearest Neighbour Search (Wraps ANN Library) Using L2 Metric","title":"Fast Nearest Neighbour Search (Wraps ANN Library) Using L2 Metric","text":"Finds k nearest neighbours every point given dataset O(N log N) time using Arya Mount’s ANN library (v1.1.3). support approximate well exact searches, fixed radius searches bd well kd trees. package implements nearest neighbors Euclidean (L2) metric. Manhattan (L1) metric, install RANN1 package. details underlying ANN library, see http://www.cs.umd.edu/~mount/ANN.","code":""},{"path":[]},{"path":"http://jefferislab.github.io/RANN/index.html","id":"released-versions","dir":"","previous_headings":"Installation","what":"Released versions","title":"Fast Nearest Neighbour Search (Wraps ANN Library) Using L2 Metric","text":"recommendation install released version CRAN :","code":"install.packages(\"RANN\")"},{"path":"http://jefferislab.github.io/RANN/index.html","id":"bleeding-edge","dir":"","previous_headings":"Installation","what":"Bleeding Edge","title":"Fast Nearest Neighbour Search (Wraps ANN Library) Using L2 Metric","text":"can, however, download tar ball, run R CMD INSTALL , use devtools package install development version: Note: Windows users need Rtools devtools install way.","code":"# install.packages(\"devtools\")  devtools::install_github(\"jefferis/RANN\")"},{"path":"http://jefferislab.github.io/RANN/index.html","id":"feedback","dir":"","previous_headings":"","what":"Feedback","title":"Fast Nearest Neighbour Search (Wraps ANN Library) Using L2 Metric","text":"Please feel free : submit suggestions bug-reports : https://github.com/jefferislab/RANN/issues send pull requests forking: https://github.com/jefferislab/RANN/ e-mail maintainer: jefferis@gmail.com","code":""},{"path":"http://jefferislab.github.io/RANN/index.html","id":"copyright-and-license","dir":"","previous_headings":"","what":"Copyright and License","title":"Fast Nearest Neighbour Search (Wraps ANN Library) Using L2 Metric","text":"see inst/COPYRIGHT DESCRIPTION files copyright license information.","code":""},{"path":"http://jefferislab.github.io/RANN/reference/RANN-package.html","id":null,"dir":"Reference","previous_headings":"","what":"Wrapper for Arya and Mount's Approximate Nearest Neighbours (ANN) C++ library — RANN-package","title":"Wrapper for Arya and Mount's Approximate Nearest Neighbours (ANN) C++ library — RANN-package","text":"Finds k nearest neighbours every point given dataset O(N log N) time using Arya Mount's ANN library (v1.1.3). support approximate well exact searches, fixed radius searches 'bd' well 'kd' trees. distance computed using L2 (Euclidean) metric. Please see package 'RANN.L1' functionality using L1 (Manhattan, taxicab) metric.","code":""},{"path":[]},{"path":"http://jefferislab.github.io/RANN/reference/nn2.html","id":null,"dir":"Reference","previous_headings":"","what":"Nearest Neighbour Search — nn2","title":"Nearest Neighbour Search — nn2","text":"Uses kd-tree find p number near neighbours point input/output dataset. advantage kd-tree runs O(M log M) time.","code":""},{"path":"http://jefferislab.github.io/RANN/reference/nn2.html","id":"ref-usage","dir":"Reference","previous_headings":"","what":"Usage","title":"Nearest Neighbour Search — nn2","text":"","code":"nn2(   data,   query = data,   k = min(10, nrow(data)),   treetype = c(\"kd\", \"bd\"),   searchtype = c(\"standard\", \"priority\", \"radius\"),   radius = 0,   eps = 0 )"},{"path":"http://jefferislab.github.io/RANN/reference/nn2.html","id":"arguments","dir":"Reference","previous_headings":"","what":"Arguments","title":"Nearest Neighbour Search — nn2","text":"data M x d data.frame matrix, M rows point (column) vector (d=1). query set N x d points queried data. d, number columns, must data. missing, defaults data. k maximum number nearest neighbours compute. default value set smaller number columnns data treetype Character vector specifying standard 'kd' tree 'bd' (box-decomposition, AMNSW98) tree may perform better larger point sets searchtype See details radius Radius search searchtype='radius' eps Error bound: default 0.0 implies exact nearest neighbour search","code":""},{"path":"http://jefferislab.github.io/RANN/reference/nn2.html","id":"value","dir":"Reference","previous_headings":"","what":"Value","title":"Nearest Neighbour Search — nn2","text":"list length 2 elements:  nn.idx N x k integer matrix returning near  neighbour indices. nn.dists N x k matrix returning near  neighbour Euclidean distances.","code":""},{"path":"http://jefferislab.github.io/RANN/reference/nn2.html","id":"details","dir":"Reference","previous_headings":"","what":"Details","title":"Nearest Neighbour Search — nn2","text":"RANN package utilizes Approximate Near Neighbor (ANN) C++ library, can give exact near neighbours (name suggests) approximate near neighbours within specified error bound.  information ANN library please visit http://www.cs.umd.edu/~mount/ANN/. Search types: priority visits cells increasing order distance query point, hence, converge rapidly true nearest neighbour, standard usually faster exact searches. radius searches neighbours within specified radius point.  neighbours nn.idx contain 0 nn.dists contain 1.340781e+154 point.","code":""},{"path":"http://jefferislab.github.io/RANN/reference/nn2.html","id":"references","dir":"Reference","previous_headings":"","what":"References","title":"Nearest Neighbour Search — nn2","text":"Bentley J. L. (1975), Multidimensional binary search trees used  associative search. Communication ACM, 18:309-517. Arya S. Mount D. M. (1993), Approximate nearest neighbor searching,  Proc. 4th Ann. ACM-SIAM Symposium Discrete Algorithms (SODA'93), 271-280. Arya S., Mount D. M., Netanyahu N. S., Silverman R. Wu . Y (1998),  optimal algorithm approximate nearest neighbor searching, Journal  ACM, 45, 891-923.","code":""},{"path":"http://jefferislab.github.io/RANN/reference/nn2.html","id":"author","dir":"Reference","previous_headings":"","what":"Author","title":"Nearest Neighbour Search — nn2","text":"Gregory Jefferis based earlier code Samuel E. Kemp (knnFinder  package)","code":""},{"path":"http://jefferislab.github.io/RANN/reference/nn2.html","id":"ref-examples","dir":"Reference","previous_headings":"","what":"Examples","title":"Nearest Neighbour Search — nn2","text":"","code":"x1 <- runif(100, 0, 2*pi) x2 <- runif(100, 0,3) DATA <- data.frame(x1, x2) nearest <- nn2(DATA,DATA)"},{"path":"http://jefferislab.github.io/RANN/news/index.html","id":"rann-261","dir":"Changelog","previous_headings":"","what":"RANN 2.6.1","title":"RANN 2.6.1","text":"CRAN release: 2019-01-08 Fix Solaris compile error (requested BDR, #25) Correct usage compiler vs preprocessor flags (#26)","code":""},{"path":"http://jefferislab.github.io/RANN/news/index.html","id":"rann-260","dir":"Changelog","previous_headings":"","what":"RANN 2.6.0","title":"RANN 2.6.0","text":"remove register key word libANN code (request CRAN, #23)","code":""},{"path":"http://jefferislab.github.io/RANN/news/index.html","id":"rann-251","dir":"Changelog","previous_headings":"","what":"RANN 2.5.1","title":"RANN 2.5.1","text":"CRAN release: 2017-05-21 bug fix wrong result dimensions query vector (#17) thanks github user dayey1 bug fix: check query vs data dimensions register native routines (now NOTE R 3.4.0) fix CRAN URLs README","code":""},{"path":"http://jefferislab.github.io/RANN/news/index.html","id":"rann-250","dir":"Changelog","previous_headings":"","what":"RANN 2.5.0","title":"RANN 2.5.0","text":"completely remove defunct nn function add note README new RANN1 package offering Manhattan (L1) metric alternative Euclidean (L2) metric. Note RANN1 available github time writing). dev: use ANN_ROOT macro unsquare distances","code":""},{"path":"http://jefferislab.github.io/RANN/news/index.html","id":"rann-241","dir":"Changelog","previous_headings":"","what":"RANN 2.4.1","title":"RANN 2.4.1","text":"CRAN release: 2014-07-21 fix malformed URL field DESCRIPTION (K. Hornik)","code":""},{"path":"http://jefferislab.github.io/RANN/news/index.html","id":"rann-240","dir":"Changelog","previous_headings":"","what":"RANN 2.4.0","title":"RANN 2.4.0","text":"fix crashing bug receving N x 0 input matrix (thanks Rajaraman V bug report) doc: correct documentation return type clarifications. dev: switch testthat tests dev: add Travis CI integration (https://travis-ci.org/jefferis/RANN) dev: add rstudio project, retire StatET Eclipse project","code":""},{"path":"http://jefferislab.github.io/RANN/news/index.html","id":"rann-230","dir":"Changelog","previous_headings":"","what":"RANN 2.3.0","title":"RANN 2.3.0","text":"CRAN release: 2013-07-24 remove nn() function since underlying get_NN() memory leaks (noticed Brian Ripley) make nn2() use input data query query specified) add Arya Mount authors (accordance CRAN policies, BDR) add Arya, Mount University Maryland Copyright line (accordance CRAN policies, BDR) add COPYRIGHT file make clear exactly files ANN library therefore subject library’s copyright.","code":""},{"path":"http://jefferislab.github.io/RANN/news/index.html","id":"rann-221","dir":"Changelog","previous_headings":"","what":"RANN 2.2.1","title":"RANN 2.2.1","text":"fix yet warnings CRAN due presence ANN exit(), std:cout std:cerr","code":""},{"path":"http://jefferislab.github.io/RANN/news/index.html","id":"rann-220","dir":"Changelog","previous_headings":"","what":"RANN 2.2.0","title":"RANN 2.2.0","text":"user-visible changes theory switch roxygen2 documentation use provide NAMESPACE requested CRAN switch deprecated .First.lib useDynLib","code":""}]
+[{"path":"http://jefferislab.github.io/RANN/authors.html","id":null,"dir":"","previous_headings":"","what":"Authors","title":"Authors and Citation","text":"Gregory Jefferis. Author, maintainer. Samuel E. Kemp. Author. Sunil Arya. Author, copyright holder. David Mount. Author, copyright holder. University Maryland. Copyright holder.           ANN library copyright University Maryland Sunil Arya     David Mount. See file COPYRIGHT details","code":""},{"path":"http://jefferislab.github.io/RANN/authors.html","id":"citation","dir":"","previous_headings":"","what":"Citation","title":"Authors and Citation","text":"Jefferis G, Kemp SE, Arya S, Mount D (2024). RANN: Fast Nearest Neighbour Search (Wraps ANN Library) Using L2 Metric. R package version 2.6.1, http://jefferislab.github.io/RANN/, https://github.com/jefferislab/RANN.","code":"@Manual{,   title = {RANN: Fast Nearest Neighbour Search (Wraps ANN Library) Using L2 Metric},   author = {Gregory Jefferis and Samuel E. Kemp and Sunil Arya and David Mount},   year = {2024},   note = {R package version 2.6.1, http://jefferislab.github.io/RANN/},   url = {https://github.com/jefferislab/RANN}, }"},{"path":"http://jefferislab.github.io/RANN/index.html","id":"rann","dir":"","previous_headings":"","what":"Fast Nearest Neighbour Search (Wraps ANN Library) Using L2 Metric","title":"Fast Nearest Neighbour Search (Wraps ANN Library) Using L2 Metric","text":"Finds k nearest neighbours every point given dataset O(N log N) time using Arya Mount’s ANN library (v1.1.3). support approximate well exact searches, fixed radius searches bd well kd trees. package implements nearest neighbors Euclidean (L2) metric. Manhattan (L1) metric, install RANN1 package. details underlying ANN library, see http://www.cs.umd.edu/~mount/ANN.","code":""},{"path":[]},{"path":"http://jefferislab.github.io/RANN/index.html","id":"released-versions","dir":"","previous_headings":"Installation","what":"Released versions","title":"Fast Nearest Neighbour Search (Wraps ANN Library) Using L2 Metric","text":"recommendation install released version CRAN :","code":"install.packages(\"RANN\")"},{"path":"http://jefferislab.github.io/RANN/index.html","id":"bleeding-edge","dir":"","previous_headings":"Installation","what":"Bleeding Edge","title":"Fast Nearest Neighbour Search (Wraps ANN Library) Using L2 Metric","text":"can, however, download tar ball, run R CMD INSTALL , use devtools package install development version: Note: Windows users need Rtools devtools install way.","code":"# install.packages(\"devtools\")  devtools::install_github(\"jefferis/RANN\")"},{"path":"http://jefferislab.github.io/RANN/index.html","id":"feedback","dir":"","previous_headings":"","what":"Feedback","title":"Fast Nearest Neighbour Search (Wraps ANN Library) Using L2 Metric","text":"Please feel free : submit suggestions bug-reports : https://github.com/jefferislab/RANN/issues send pull requests forking: https://github.com/jefferislab/RANN/ e-mail maintainer: jefferis@gmail.com","code":""},{"path":"http://jefferislab.github.io/RANN/index.html","id":"copyright-and-license","dir":"","previous_headings":"","what":"Copyright and License","title":"Fast Nearest Neighbour Search (Wraps ANN Library) Using L2 Metric","text":"see inst/COPYRIGHT DESCRIPTION files copyright license information.","code":""},{"path":"http://jefferislab.github.io/RANN/reference/RANN-package.html","id":null,"dir":"Reference","previous_headings":"","what":"Wrapper for Arya and Mount's Approximate Nearest Neighbours (ANN) C++ library — RANN-package","title":"Wrapper for Arya and Mount's Approximate Nearest Neighbours (ANN) C++ library — RANN-package","text":"Finds k nearest neighbours every point given dataset O(N log N) time using Arya Mount's ANN library (v1.1.3). support approximate well exact searches, fixed radius searches 'bd' well 'kd' trees. distance computed using L2 (Euclidean) metric. Please see package 'RANN.L1' functionality using L1 (Manhattan, taxicab) metric.","code":""},{"path":[]},{"path":"http://jefferislab.github.io/RANN/reference/nn2.html","id":null,"dir":"Reference","previous_headings":"","what":"Nearest Neighbour Search — nn2","title":"Nearest Neighbour Search — nn2","text":"Uses kd-tree find p number near neighbours point input/output dataset. advantage kd-tree runs O(M log M) time.","code":""},{"path":"http://jefferislab.github.io/RANN/reference/nn2.html","id":"ref-usage","dir":"Reference","previous_headings":"","what":"Usage","title":"Nearest Neighbour Search — nn2","text":"","code":"nn2(   data,   query = data,   k = min(10, nrow(data)),   treetype = c(\"kd\", \"bd\"),   searchtype = c(\"standard\", \"priority\", \"radius\"),   radius = 0,   eps = 0 )"},{"path":"http://jefferislab.github.io/RANN/reference/nn2.html","id":"arguments","dir":"Reference","previous_headings":"","what":"Arguments","title":"Nearest Neighbour Search — nn2","text":"data M x d data.frame matrix, M rows point (column) vector (d=1). query set N x d points queried data. d, number columns, must data. missing, defaults data. k maximum number nearest neighbours compute. default value set smaller number columnns data treetype Character vector specifying standard 'kd' tree 'bd' (box-decomposition, AMNSW98) tree may perform better larger point sets searchtype See details radius Radius search searchtype='radius' eps Error bound: default 0.0 implies exact nearest neighbour search","code":""},{"path":"http://jefferislab.github.io/RANN/reference/nn2.html","id":"value","dir":"Reference","previous_headings":"","what":"Value","title":"Nearest Neighbour Search — nn2","text":"list length 2 elements:  nn.idx N x k integer matrix returning near  neighbour indices. nn.dists N x k matrix returning near  neighbour Euclidean distances.","code":""},{"path":"http://jefferislab.github.io/RANN/reference/nn2.html","id":"details","dir":"Reference","previous_headings":"","what":"Details","title":"Nearest Neighbour Search — nn2","text":"RANN package utilizes Approximate Near Neighbor (ANN) C++ library, can give exact near neighbours (name suggests) approximate near neighbours within specified error bound.  information ANN library please visit http://www.cs.umd.edu/~mount/ANN/. Search types: priority visits cells increasing order distance query point, hence, converge rapidly true nearest neighbour, standard usually faster exact searches. radius searches neighbours within specified radius point.  neighbours nn.idx contain 0 nn.dists contain 1.340781e+154 point.","code":""},{"path":"http://jefferislab.github.io/RANN/reference/nn2.html","id":"references","dir":"Reference","previous_headings":"","what":"References","title":"Nearest Neighbour Search — nn2","text":"Bentley J. L. (1975), Multidimensional binary search trees used  associative search. Communication ACM, 18:309-517. Arya S. Mount D. M. (1993), Approximate nearest neighbor searching,  Proc. 4th Ann. ACM-SIAM Symposium Discrete Algorithms (SODA'93), 271-280. Arya S., Mount D. M., Netanyahu N. S., Silverman R. Wu . Y (1998),  optimal algorithm approximate nearest neighbor searching, Journal  ACM, 45, 891-923.","code":""},{"path":"http://jefferislab.github.io/RANN/reference/nn2.html","id":"author","dir":"Reference","previous_headings":"","what":"Author","title":"Nearest Neighbour Search — nn2","text":"Gregory Jefferis based earlier code Samuel E. Kemp (knnFinder  package)","code":""},{"path":"http://jefferislab.github.io/RANN/reference/nn2.html","id":"ref-examples","dir":"Reference","previous_headings":"","what":"Examples","title":"Nearest Neighbour Search — nn2","text":"","code":"x1 <- runif(100, 0, 2*pi) x2 <- runif(100, 0,3) DATA <- data.frame(x1, x2) nearest <- nn2(DATA,DATA)"},{"path":"http://jefferislab.github.io/RANN/news/index.html","id":"rann-261","dir":"Changelog","previous_headings":"","what":"RANN 2.6.1","title":"RANN 2.6.1","text":"CRAN release: 2019-01-08 Fix Solaris compile error (requested BDR, #25) Correct usage compiler vs preprocessor flags (#26)","code":""},{"path":"http://jefferislab.github.io/RANN/news/index.html","id":"rann-260","dir":"Changelog","previous_headings":"","what":"RANN 2.6.0","title":"RANN 2.6.0","text":"remove register key word libANN code (request CRAN, #23)","code":""},{"path":"http://jefferislab.github.io/RANN/news/index.html","id":"rann-251","dir":"Changelog","previous_headings":"","what":"RANN 2.5.1","title":"RANN 2.5.1","text":"CRAN release: 2017-05-21 bug fix wrong result dimensions query vector (#17) thanks github user dayey1 bug fix: check query vs data dimensions register native routines (now NOTE R 3.4.0) fix CRAN URLs README","code":""},{"path":"http://jefferislab.github.io/RANN/news/index.html","id":"rann-250","dir":"Changelog","previous_headings":"","what":"RANN 2.5.0","title":"RANN 2.5.0","text":"completely remove defunct nn function add note README new RANN1 package offering Manhattan (L1) metric alternative Euclidean (L2) metric. Note RANN1 available github time writing). dev: use ANN_ROOT macro unsquare distances","code":""},{"path":"http://jefferislab.github.io/RANN/news/index.html","id":"rann-241","dir":"Changelog","previous_headings":"","what":"RANN 2.4.1","title":"RANN 2.4.1","text":"CRAN release: 2014-07-21 fix malformed URL field DESCRIPTION (K. Hornik)","code":""},{"path":"http://jefferislab.github.io/RANN/news/index.html","id":"rann-240","dir":"Changelog","previous_headings":"","what":"RANN 2.4.0","title":"RANN 2.4.0","text":"fix crashing bug receving N x 0 input matrix (thanks Rajaraman V bug report) doc: correct documentation return type clarifications. dev: switch testthat tests dev: add Travis CI integration (https://travis-ci.org/jefferis/RANN) dev: add rstudio project, retire StatET Eclipse project","code":""},{"path":"http://jefferislab.github.io/RANN/news/index.html","id":"rann-230","dir":"Changelog","previous_headings":"","what":"RANN 2.3.0","title":"RANN 2.3.0","text":"CRAN release: 2013-07-24 remove nn() function since underlying get_NN() memory leaks (noticed Brian Ripley) make nn2() use input data query query specified) add Arya Mount authors (accordance CRAN policies, BDR) add Arya, Mount University Maryland Copyright line (accordance CRAN policies, BDR) add COPYRIGHT file make clear exactly files ANN library therefore subject library’s copyright.","code":""},{"path":"http://jefferislab.github.io/RANN/news/index.html","id":"rann-221","dir":"Changelog","previous_headings":"","what":"RANN 2.2.1","title":"RANN 2.2.1","text":"fix yet warnings CRAN due presence ANN exit(), std:cout std:cerr","code":""},{"path":"http://jefferislab.github.io/RANN/news/index.html","id":"rann-220","dir":"Changelog","previous_headings":"","what":"RANN 2.2.0","title":"RANN 2.2.0","text":"user-visible changes theory switch roxygen2 documentation use provide NAMESPACE requested CRAN switch deprecated .First.lib useDynLib","code":""}]