Author:
Chazelle Bernard,Sharir Micha,Welzl Emo
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference36 articles.
1. Agarwal, P. Intersection and decomposition algorithms for arrangements of curves in the plane, Ph.D. Thesis, New York University, 1989.
2. Agarwal, P. K., Partitioning arrangements of lines, II: applications,Discrete Comput. Geom. 5 (1990), 533–573.
3. Agarwal, P., and Sharir, M., Applications of a new space partitioning scheme, in preparation, 1991.
4. Aronov, B., and Sharir, M., Triangles in space, or building (and analyzing) castles in the air,Combinatorica 10 (1990), 137–173.
5. Chazelle, B., Lower bounds on the complexity of polytope range searching,J. Amer. Math. Soc. 2 (1989), 637–666.
Cited by
62 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Planar point sets determine many pairwise crossing segments;Advances in Mathematics;2021-08
2. Planar point sets determine many pairwise crossing segments;Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing;2019-06-23
3. Simplex Range Searching and Its Variants: A Review;A Journey Through Discrete Mathematics;2017
4. Range Searching;Encyclopedia of Algorithms;2016
5. Geometric Shortest Paths in the Plane;Encyclopedia of Algorithms;2016