Author:
Agarwal P. K.,Alon N.,Aronov B.,Suri S.
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Geometry and Topology,Theoretical Computer Science
Reference17 articles.
1. P. Agarwal, M. Sharir, and S. Toledo, Applications of parametric searching in geometric optimization,J. Algorithms (1993), to appear.
2. A. Aggarwal and S. Suri, The biggest diagonal in a simple polygon,Inform. Process. Lett. 35 (1990), 13–18.
3. N. Alon and J. H. Spencer,The Probabilistic Method, Wiley, New York, 1991.
4. B. Chazelle, A polygon cutting theorem,Proc. 23rd IEEE Symp. on Foundations of Computer Science, 1982, pp. 339–349.
5. B. Chazelle, Lower bounds on the complexity of polytope range searching,J. Amer. Math. Soc.,2 (1989), 637–666.
Cited by
35 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献