Subject
Computational Mathematics,Computational Theory and Mathematics,Control and Optimization,Geometry and Topology,Computer Science Applications
Reference27 articles.
1. An optimal algorithm for finding segments [sic!] intersections;Balaban,1995
2. Algorithms for reporting and counting geometric intersections;Bentley;IEEE Transactions on Computers,1979
3. Efficient algorithms for line and curve segment intersection using restricted predicates;Boissonnat;Computational Geometry: Theory and Applications,2000
4. An elementary algorithm for reporting intersections of red/blue curve segments;Boissonnat;Computational Geometry: Theory Applications,2002
5. P. Bose, A. Maheshwari, P. Morin, J. Morrison, M. Smid, J. Vahrenhold, Space-efficient geometric divide-and-conquer algorithms, Computational Geometry: Theory & Applications (2006), doi:10.1016/j.comgeo.2006.03.006, in press, accepted November 2004. An extended abstract appeared in: Proceedings of the 20th European Workshop on Computational Geometry, 2004, pp. 65–68
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献