Author:
de Rezende P. J.,Lee D. T.,Wu Y. F.
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Geometry and Topology,Theoretical Computer Science
Reference16 articles.
1. V. Aho, J. E. Hopcroft, and J. D. Ullman,The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, 1984.
2. T. Asano, L. Guibas, J. Hershberger, and H. Imai, Visibility of disjoint polygons,Algorithmica 1 (1986h), 49–63.
3. M. Ben-Or, Lower bounds for algebraic computation trees,Proceedings of the 15th ACM Annual Symposium on Theory of Computing, 80–86, Boston, MA, 1983.
4. E. W. Dijkstra, A note on two problems in connection with graphs,Numer. Math. 1 (1959), 269–271.
5. H. Edelsbrunner, L. J. Guibas, and J. Stolfi, Optimal point location in a monotone subdivision,SIAM J. Comput. 15 (1986), 317–340.
Cited by
64 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献