Author:
Kedem Klara,Livne Ron,Pach János,Sharir Micha
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Geometry and Topology,Theoretical Computer Science
Reference23 articles.
1. T. Asano, T. Asano, L. Guibas, J. Hershberger, and H. Imai, Visibility polygon search and Euclidean shortest paths, Proc. 26th IEEE Symp. on Foundations of Computer Science, 1985, pp. 155–164.
2. R. V. Benson, Euclidean Geometry and Convexity, McGraw-Hill, 1966, pp. 97–113.
3. J. L. Bentley and A. Ottmann, Algorithms for reporting and counting geometric intersections, IEEE Trans. on Computers, Vol. C-28 (1979), pp. 643–647.
4. P. Erdős and B. Grünbaum, Osculation vertices in arrangements of curves, Geometriae Dedicata 1 (1973) 322–333.
5. B. Grünbaum, Arrangements and Spreads, Regional Conference Series in Mathematics, Vol. 10, Conference Board of the Mathematical Sciences, American Mathematical Society, Providence R.I. 1972.
Cited by
225 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献