Reference15 articles.
1. Amenta N, Choi S, Rote G (2003) Incremental constructions con BRIO. In: Proceedings of the 19th annual symposium on computational geometry, San Diego, pp 211–219. DOI10.1145/777792.777824,
http://page.inf.fu-berlin.de/~rote/Papers/pdf/Incremental+constructions+con+BRIO.pdf
2. Amenta N, Attali D, Devillers O (2012) A tight bound for the Delaunay triangulation of points on a polyhedron. Discret Comput Geom 48:19–38. DOI10.1007/s00454-012-9415-7,
http://hal.inria.fr/hal-00784900
3. Attali D, Boissonnat JD, Lieutier A (2003) Complexity of the Delaunay triangulation of points on surfaces: the smooth case. In: Proceedings of the 19th annual symposium on computational geometry, San Diego, pp 201–210. DOI10.1145/777792.777823,
http://dl.acm.org/citation.cfm?id=777823
4. Aurenhammer F, Klein R (2000) Voronoi diagrams. In: Sack JR, Urrutia J (eds) Handbook of computational geometry. Elsevier/North-Holland, Amsterdam, pp 201–290.
ftp://ftp.cis.upenn.edu/pub/cis610/public_html/ak-vd-00.ps
5. Boissonnat JD, Teillaud M (1986) A hierarchical representation of objects: the Delaunay tree. In: Proceedings of the 2nd annual symposium computational geometry, Yorktown Heights, pp 260–268.
http://dl.acm.org/citation.cfm?id=10543
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献