{"title":"指数4","authors":"Trevor L. Davis","doi":"10.2307/j.ctv18dw0pk.24","DOIUrl":null,"url":null,"abstract":"April 8, 2010 Title Fast Nearest Neighbour Search Version 2.1.2 Date 2010-02-10 Author Samuel E. Kemp, Gregory Jefferis Description Finds the k nearest neighbours for every point in a given dataset in O(N log N) time using Arya and Mount’s ANN library (v1.1.1). Two functions allow searches for nearest neighbours within a point set or between two separate point sets. There is support for approximate as well as exact searches, fixed radius searches and bd as well as kd trees. This version updates ANN 1.1.3 and fixes package compilation on Windows. Maintainer Gregory Jefferis <jefferis@gmail.com> License GPL-2 Repository CRAN Date/Publication 2010-04-08 10:59:03","PeriodicalId":374634,"journal":{"name":"Shakespeare in Print","volume":"42 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Index 4\",\"authors\":\"Trevor L. Davis\",\"doi\":\"10.2307/j.ctv18dw0pk.24\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"April 8, 2010 Title Fast Nearest Neighbour Search Version 2.1.2 Date 2010-02-10 Author Samuel E. Kemp, Gregory Jefferis Description Finds the k nearest neighbours for every point in a given dataset in O(N log N) time using Arya and Mount’s ANN library (v1.1.1). Two functions allow searches for nearest neighbours within a point set or between two separate point sets. There is support for approximate as well as exact searches, fixed radius searches and bd as well as kd trees. This version updates ANN 1.1.3 and fixes package compilation on Windows. Maintainer Gregory Jefferis <jefferis@gmail.com> License GPL-2 Repository CRAN Date/Publication 2010-04-08 10:59:03\",\"PeriodicalId\":374634,\"journal\":{\"name\":\"Shakespeare in Print\",\"volume\":\"42 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-11-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Shakespeare in Print\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.2307/j.ctv18dw0pk.24\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Shakespeare in Print","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2307/j.ctv18dw0pk.24","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
摘要
2010年4月8日标题快速近邻搜索版本2.1.2日期2010-02-10作者Samuel E. Kemp, Gregory Jefferis描述使用Arya and Mount的ANN库(v1.1.1)在O(N log N)时间内为给定数据集中的每个点找到k个近邻。有两个函数允许在一个点集中或两个独立的点集中搜索最近的邻居。它支持近似和精确搜索，固定半径搜索以及bd和kd树。此版本更新了ANN 1.1.3并修复了Windows上的包编译。维护人员Gregory Jefferis License GPL-2 Repository CRAN日期/发布日期2010-04-08 10:59:03
April 8, 2010 Title Fast Nearest Neighbour Search Version 2.1.2 Date 2010-02-10 Author Samuel E. Kemp, Gregory Jefferis Description Finds the k nearest neighbours for every point in a given dataset in O(N log N) time using Arya and Mount’s ANN library (v1.1.1). Two functions allow searches for nearest neighbours within a point set or between two separate point sets. There is support for approximate as well as exact searches, fixed radius searches and bd as well as kd trees. This version updates ANN 1.1.3 and fixes package compilation on Windows. Maintainer Gregory Jefferis License GPL-2 Repository CRAN Date/Publication 2010-04-08 10:59:03
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
