快速球面搜索算法

2004 IEEE Aerospace Conference Proceedings (IEEE Cat. No.04TH8720) Pub Date : 2004-03-13 DOI:10.1109/AERO.2004.1368064

C. Liebe

{"title":"快速球面搜索算法","authors":"C. Liebe","doi":"10.1109/AERO.2004.1368064","DOIUrl":null,"url":null,"abstract":"This paper describes an algorithm to search a number of spherical points and find the points that are within a given distance to a given point. The described algorithm is not optimal, but is easy to implement. Basically, it utilizes a number of spherical coverings to build the data structure. Results of an implementation are presented.","PeriodicalId":208052,"journal":{"name":"2004 IEEE Aerospace Conference Proceedings (IEEE Cat. No.04TH8720)","volume":"186 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Fast spherical search algorithm\",\"authors\":\"C. Liebe\",\"doi\":\"10.1109/AERO.2004.1368064\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper describes an algorithm to search a number of spherical points and find the points that are within a given distance to a given point. The described algorithm is not optimal, but is easy to implement. Basically, it utilizes a number of spherical coverings to build the data structure. Results of an implementation are presented.\",\"PeriodicalId\":208052,\"journal\":{\"name\":\"2004 IEEE Aerospace Conference Proceedings (IEEE Cat. No.04TH8720)\",\"volume\":\"186 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2004-03-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2004 IEEE Aerospace Conference Proceedings (IEEE Cat. No.04TH8720)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/AERO.2004.1368064\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2004 IEEE Aerospace Conference Proceedings (IEEE Cat. No.04TH8720)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/AERO.2004.1368064","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

本文描述了一种搜索若干球面点并找到在给定距离内的点的算法。所描述的算法不是最优的，但易于实现。基本上，它利用许多球面覆盖来构建数据结构。给出了一个实现的结果。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Fast spherical search algorithm

This paper describes an algorithm to search a number of spherical points and find the points that are within a given distance to a given point. The described algorithm is not optimal, but is easy to implement. Basically, it utilizes a number of spherical coverings to build the data structure. Results of an implementation are presented.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2004 IEEE Aerospace Conference Proceedings (IEEE Cat. No.04TH8720)

自引率

0.00%

发文量