Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Geometry and Topology,Theoretical Computer Science
Reference26 articles.
1. P. K. Agarwal, Partitioning arrangements of lines, II: Applications,Discrete and Computational Geometry 5 (1990), 533–574.
2. P. K. Agarwal and M. Sharir, Red-blue intersection detection algorithms with applications to motion planning and collision detection,SIAM Journal on Computing 19 (1990), 297–322.
3. M. Ajtai, J. Komlos, and E. Szemerédi, Sorting inc logn parallel steps,Proceedings of the 15th Annual ACM Symposium on Theory of Computing, 1983, pp. 1–9.
4. K. E. Batcher, Sorting networks and their applications,Proceedings of the AFIPS Spring Joint Summer Computer Conference, vol. 32 (1968), pp. 307–314.
5. B. Chazelle and J. Friedman, A deterministic view of random sampling and its use in geometry,Proceedings of the 29th Annual IEEE Symposium on Foundations of Computer Science, 1988, pp. 539–549.
Cited by
41 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献