Publisher
Springer Science and Business Media LLC
Reference13 articles.
1. Technical Memorandum;C L Lawson,1972
2. Sloan S W. A fast algorithm constructing Delaunay triangulations in the plane[J]. Adv Eng Soft Workstage, 1987, 9(1): 34–55.
3. Shamos M I, Hoey D. Closest point problems[C]// Proceedings of 16th Annual IEEE Symposium on Foundations of Computer Science. Washington D C: IEEE, 1975: 151–162.
4. Lewis B A, Robinson J S. Triangulation of planar regions with applications [J]. The Computer Journal, 1978, 21(4): 324–332.
5. Guibas L, Stolfi J. Primitives for the manipulation of general subdivisions and the computation of voronoi diagrams[J]. ACM Transactions on Graphics, 1985, 4(2): 75–123.
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献