Author:
Chin Francis,Snoeyink Jack,Wang Cao An
Publisher
Springer Berlin Heidelberg
Reference19 articles.
1. A. Aggarwal, L. J. Guibas, J. Saxe, and P. W. Shor. A linear-time algorithm for computing the Voronoi diagram of a convex polygon. Disc. & Comp. Geom., 4:591–604, 1989.
2. F. Aurenhammer. Voronoi diagrams–A survey of a fundamental geometric data structure. ACM Comp. Surveys, 23(3):345–405, 1991.
3. H. Blum. A transformation for extracting new descriptors of shape. In W. Whaten-Dunn, editor, Proc. Symp. Models for Perception of Speech and Visual Form, pages 362–380. MIT Press, 1967.
4. B. Chazelle. Triangulating a simple polygon in linear time. Disc. & Comp. Geom., 6:485–524, 1991.
5. O. Devillers. Randomization yields simple O(n log* n) algorithms for difficult Ω(n) problems. Int. J. Comp. Geom. App., 2(1):97–111, 1992.
Cited by
28 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献