Author:
Chazelle Bernard,Edelsbrunner Herbert
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Geometry and Topology,Theoretical Computer Science
Reference19 articles.
1. J. L. Bentley, Multidimensional divide and conquer,Comm. ACM 23 (1980), 214–229.
2. B. Chazelle, Filtering search: a new approach to query-answering,SIAM J. Comput. 15 (1986), 703–724.
3. B. Chazelle, A Functional Approach to Data Structures and Its Use in Multidimensional Searching, Technical Report No. CS-85-16, Brown University, 1985. Preliminary version inProceedings of the 26th Annual IEEE Symposium on Foundations of Computer Science, 165–174, 1985.
4. B. Chazelle, Lower bounds on the complexity of multidimensional searching,Proceedings of the 27th Annual IEEE Symposium on Foundations of Computer Science, 87–96, 1986.
5. B. Chazelle and H. Edelsbrunner, Optimal solutions for a class of point retrieval problems,J. Symbolic Comput. 1 (1985), 47–56.
Cited by
22 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Point Enclosure Problem for Homothetic Polygons;Lecture Notes in Computer Science;2023
2. Generic Techniques for Building Top-
k
Structures;ACM Transactions on Algorithms;2022-10-10
3. Orthogonal Range Reporting and Rectangle Stabbing for Fat Rectangles;Lecture Notes in Computer Science;2019
4. An Efficient Algorithm for the 1D Total Visibility-Index Problem and Its Parallelization;ACM Journal of Experimental Algorithmics;2018-11-15
5. Categorical range maxima queries;Proceedings of the 33rd ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems;2014-06-18