Author:
Nandy S.C.,Bhattacharya B.B.
Subject
Computational Mathematics,Computational Theory and Mathematics,Modeling and Simulation
Reference24 articles.
1. Data structure for range searching;Bentley;Computing Surveys,1979
2. Efficient worst case data structure for range searching;Bentley;Acta Informatica,1980
3. A data structure for orthogonal range queries;Leuker,1978
4. New upper bounds for neighbor searching;Chazelle,1984
5. An improved algorithm for fixed-radius neighbor problem;Chazelle;Information Processing Letters,1983
Cited by
55 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On Efficiently Processing MIT Queries in Trajectory Data;IEEE Transactions on Knowledge and Data Engineering;2024-07
2. A Novel Approximation Algorithm for Max-Covering Circle Problem;Combinatorial Optimization and Applications;2023-12-09
3. Towards Efficient MIT query in Trajectory Data;2023 IEEE 39th International Conference on Data Engineering (ICDE);2023-04
4. In Search of the Max Coverage Region in Road Networks;Remote Sensing;2023-02-26
5. GAM: A GPU-Accelerated Algorithm for MaxRS Queries in Road Networks;Journal of Computer Science and Technology;2022-09-30