Author:
Chen Renjie,Gotsman Craig
Publisher
Springer Berlin Heidelberg
Reference35 articles.
1. Dwyer, R.: A faster divide-and-conquer algorithm for constructing Delaunay triangulations. Algorithmica 2, 137–151 (1987)
2. Fortune, S.: A sweepline algorithm for Voronoi diagrams. In: SCG 1986, pp. 313–322. ACM, NY (1986)
3. Green, P.J., Sibson, R.: Computing Dirichlet tessellations in the plane. The Computer Journal 21(2), 168–173 (1978)
4. Guibas, L., Knuth, D., Sharir, M.: Randomized incremental construction of Delaunay and Voronoi diagrams. Algorithmica 7, 381–413 (1992)
5. Barber, C.B.: Computational geometry with imprecise data and arithmetic. PhD thesis, Princeton (1993)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献