Author:
Boissonnat Jean -Daniel,Devillers Olivier,Teillaud Monique
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference17 articles.
1. J. D. Boissonnat and M. Teillaud. A hierarchical representation of objects: the Delaunay Tree. InProceedings of the Second ACM Symposium on Computational Geometry, Yorktown Heights, pp. 260?268, June 1986.
2. J. D. Boissonnat and M. Teillaud. On the randomized construction of the Delaunay tree.Theoretical Computer Science. To be published. Full paper available as Technical Report INRIA 1140.
3. M. I. Shamos and D. Hoey. Closest-point problems. InProceedings of the 16th IEEE Symposium on Foundations of Computer Science, pp. 151?162, October 1975.
4. D. T. Lee. Onk-nearest neighbor Voronoi diagrams in the plane.IEEE Transactions on Computers, 31:478?487, 1982.
5. A. Aggarwal, L. J. Guibas, J. Saxe, and P. W. Shor. A linear-time algorithm for computing the Voronoi diagram of a convex polygon.Discrete and Computational Geometry, 4:591?604, 1989.
Cited by
22 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献