Author:
Barth Wilhelm,Jünger Michael,Mutzel Petra
Publisher
Springer Berlin Heidelberg
Reference12 articles.
1. B. Chazelle, Reporting and counting segment intersections. Journal of Computer and System Sciences 32 (1986) 156–182.
2. B. Chazelle and H. Edelsbrunner, An optimal algorithm for intersecting line segments in the plane. Journal of the ACM 39 (1992) 1–54.
3. T. H. Cormen, C. E. Leiserson, and R. L. Rivest, Introduction to algorithms. MIT Press, Cambridge, MA, 1990.
4. P. Eades and N. Wormald, Edge crossings in drawings of bipartite graphs. Algorithmica 11 (1994) 379–403.
5. Lect Notes Comput Sci;C. Gutwenger,2002
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献