Well-separated pair decomposition in linear time?-Reference-Cited by-同舟云学术

Well-separated pair decomposition in linear time?

Published:2008-08 Issue:5 Volume:107 Page:138-141
ISSN:0020-0190
Container-title:Information Processing Letters
language:en
Short-container-title:Information Processing Letters

Author:

Chan Timothy M.

Publisher

Elsevier BV

Subject

Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science

Reference21 articles.

1. Sorting in linear time?;Andersson;J. Comput. System Sci.,1998

2. An optimal algorithm for approximate nearest neighbor searching in fixed dimensions;Arya;J. ACM,1998

3. Fast geometric approximation techniques and geometric embedding problems;Bern;Theoret. Comput. Sci.,1992

4. P.B. Callahan, S.R. Kosaraju, Faster algorithms for some geometric graph problems in higher dimensions, in: Proc. 4th ACM–SIAM Sympos. Discrete Algorithms, 1993, pp. 291–300

5. A decomposition of multidimensional point sets with applications to k-nearest-neighbors and n-body potential fields;Callahan;J. ACM,1995

Cited by 21 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Fast and Memory-Efficient Approximate Minimum Spanning Tree Generation for Large Datasets;Arabian Journal for Science and Engineering;2024-06-21

2. A linear-time approximation algorithm for the minimum-length geometric embedding of trees;Optimization;2024-04-03

3. Can't See the Forest for the Trees;Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing;2022-07-20

4. Klee’s Measure Problem Made Oblivious;LATIN 2022: Theoretical Informatics;2022

5. Window queries for intersecting objects, maximal points and approximations using coresets;Discrete Applied Mathematics;2021-12