Author:
Biniaz Ahmad,Bose Prosenjit,Eppstein David,Maheshwari Anil,Morin Pat,Smid Michiel
Funder
Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada
NSF grant
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference11 articles.
1. Aggarwal, A., Edelsbrunner, H., Raghavan, P., Tiwari, P.: Optimal time bounds for some proximity problems in the plane. Inf. Process. Lett. 42(1), 55–60 (1992)
2. Aggarwal, A., Guibas, L.J., Saxe, J.B., Shor, P.W.: A linear-time algorithm for computing the Voronoi diagram of a convex polygon. Discrete Comput. Geom. 4, 591–604 (1989)
3. Avis, D.: Lower bounds for geometric problems. In: 18th Allerton Conference, Urbana, IL, pp. 35–40 (1980)
4. Chazelle, B., Devillers, O., Hurtado, F., Mora, M., Sacristán, V., Teillaud, M.: Splitting a Delaunay triangulation in linear time. Algorithmica 34(1), 39–46 (2002)
5. Cherkassky, B.V., Goldberg, A.V., Silverstein, C.: Buckets, heaps, lists, and monotone priority queues. SIAM J. Comput. 28(4), 1326–1346 (1999)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献