Author:
Karlsson Rolf G.,Overmars Mark H.
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Mathematics,Computer Networks and Communications,Software
Reference22 articles.
1. J. L. Bentley and T. Ottman,Algorithms for reporting and counting geometric intersections, IEEE Trans. Comp. C-28, 9 (1979), 643–647.
2. B. Chazelle,Intersecting is easier than sorting, Proc. 16th Annual ACM Symposium on Theory of Computing (1984), 125–234.
3. H. Edelsbrunner,A new approach to rectangle intersections, Part II, Int. J. Comput. Math. 13 (1983), 221–229.
4. H. Edelsbrunner, J. van Leeuwen, T. Ottmann and D. Wood,Computing the connected components of simple rectilinear geometrical objects in d-space, R.A.I.R.O. Theoretical Informatics 18, 2 (1984), 171–183.
5. R. A. Jarvis,On the identification of the convex hull of a finite set of points in the plane, Information Processing Lett. 2 (1973), 18–21.
Cited by
25 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献