Author:
Daescu Ovidiu,Luo Jun,Mount David M.
Subject
Computational Mathematics,Computational Theory and Mathematics,Control and Optimization,Geometry and Topology,Computer Science Applications
Reference20 articles.
1. I.J. Balaban, An optimal algorithm for finding segments intersections, in: Proc. 11th ACM Symp. Comput. Geom., 1995, pp. 211–219
2. Selecting distances in arrangements of hyperplanes spanned by points;Bespamyatnikh;J. Discrete Algorithms,2004
3. G.S. Brodal, R. Jacob, Dynamic planar convex hull, in: Proc. 43rd Annual Symp. on Foundations of Computer Science 25, 2002, pp. 617–626
4. Optimal slope selection via cuttings;Brönnimann;Computational Geometry,1998
5. On enumerating and selecting distances;Chan;Internat. J. Comput. Geom. Appl.,2001
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献