A deterministic algorithm for partitioning arrangements of lines and its application
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Computing closest and farthest points for a query segment;Theoretical Computer Science;2008-03
2. Finding stabbing lines in 3-space;Discrete & Computational Geometry;1992-08
3. Dynamic partition trees;BIT;1991-09
4. COMPACT INTERVAL TREES: A DATA STRUCTURE FOR CONVEX HULLS;International Journal of Computational Geometry & Applications;1991-03
5. Spanning trees with low crossing number;RAIRO - Theoretical Informatics and Applications;1991