Author:
Park Sang C.,Shin Hayong,Choi Byoung K.
Reference19 articles.
1. Shamos, M. I., Hoey, D. J. Geometric intersection problems. in Proc. 17th Annu. Conf. Foundation of Computer Science, pp 208–215, Oct 1976.
2. Bentley, J. L., Ottmann, T. A. Algorithms for reporting and counting geometric intersections. IEEE Transactions on Computers 28, 643–647, 1979.
3. Preparata, F. P., and Shamos, M. I. Computational geometry - An introduction. Springer Verlag, New York, 1985.
4. Chazelle, B., Edelsbrunner, H. An Optimal algorithm for intersecting line segments in the plane. Journal of the Association for computing machinery, Vol. 39, No. 1, January 1992, pp 1–54.
5. Mehlhorn, K. and Naher, S., An Implementation of a sweep line algorithm for the straight line segment intersection problem. Technical Report No. MPI-I-94–160. Max-Planck-Institut fur Informatik, 1994.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献