求解以凸面为界区域的范围搜索问题

2012 16th International Conference on Information Visualisation Pub Date : 2012-07-11 DOI:10.1109/IV.2012.85

V. Tereshchenko, O. Socolov, Andriy Fisunenko

{"title":"求解以凸面为界区域的范围搜索问题","authors":"V. Tereshchenko, O. Socolov, Andriy Fisunenko","doi":"10.1109/IV.2012.85","DOIUrl":null,"url":null,"abstract":"In this paper we consider one of the approaches to solving the range searching problem for a range which is bounded by a convex surface in Euclidean d-dimensional space. In particular, we propose a method of range searching which gives query time O(logN) and uses O(NlogN) memory where N is cardinality of an input data set. It is enabled by applying optimal data structures for storing points in nodes of a quadtree.","PeriodicalId":264951,"journal":{"name":"2012 16th International Conference on Information Visualisation","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Solving the Range Searching Problem for Region Bounded by a Convex Surface\",\"authors\":\"V. Tereshchenko, O. Socolov, Andriy Fisunenko\",\"doi\":\"10.1109/IV.2012.85\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we consider one of the approaches to solving the range searching problem for a range which is bounded by a convex surface in Euclidean d-dimensional space. In particular, we propose a method of range searching which gives query time O(logN) and uses O(NlogN) memory where N is cardinality of an input data set. It is enabled by applying optimal data structures for storing points in nodes of a quadtree.\",\"PeriodicalId\":264951,\"journal\":{\"name\":\"2012 16th International Conference on Information Visualisation\",\"volume\":\"6 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-07-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 16th International Conference on Information Visualisation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IV.2012.85\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 16th International Conference on Information Visualisation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IV.2012.85","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

本文研究欧几里德d维空间中以凸曲面为界的范围搜索问题的一种求解方法。特别地，我们提出了一种范围搜索方法，该方法给出了查询时间O(logN)，并使用O(NlogN)内存，其中N是输入数据集的基数。它是通过应用最优数据结构来在四叉树的节点中存储点来实现的。

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

查看原文本刊更多论文

Solving the Range Searching Problem for Region Bounded by a Convex Surface

In this paper we consider one of the approaches to solving the range searching problem for a range which is bounded by a convex surface in Euclidean d-dimensional space. In particular, we propose a method of range searching which gives query time O(logN) and uses O(NlogN) memory where N is cardinality of an input data set. It is enabled by applying optimal data structures for storing points in nodes of a quadtree.

求助全文

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

来源期刊

2012 16th International Conference on Information Visualisation

自引率

0.00%

发文量