Author:
Berman Piotr,Lingas Andrzej
Subject
General Computer Science,Theoretical Computer Science
Reference23 articles.
1. A linear-time algorithm for computing the Voronoi diagram of a convex polygon;Aggarwal;Discrete Comput. Geom.,1987
2. N.M. Amato, M.T. Goodrich and E.A. Ramos, Parallel algorithms for higher-dimensional convex hulls, in: Proc. 35th IEEE FOCS 683–694.
3. Voronoi diagrams — a survey;Aurenhammer,1988
4. O. Berkman, D. Breslauer, Z. Galil, B. Schieber and U. Vishkin, Highly parallelizable problems, in: Proc. 21st ACM STOC 309–319.
5. Building Voronoi diagrams for convex polygons in linear expected time;Chew;Manuscript,1986
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献