Author:
Buchin Kevin,Löffler Maarten,Morin Pat,Mulzer Wolfgang
Publisher
Springer Berlin Heidelberg
Reference23 articles.
1. Aronov, B., Har-Peled, S.: On approximating the depth and related problems. SIAM Journal on Computing 38(3), 899–921 (2008)
2. Bandyopadhyay, D., Snoeyink, J.: Almost-Delaunay simplices: Nearest neighbor relations for imprecise points. In: SODA, pp. 403–412 (2004)
3. Ben-Or, M.: Lower bounds for algebraic computation trees. In: STOC, pp. 80–86 (1983)
4. Bern, M., Eppstein, D., Gilbert, J.: Provably good mesh generation. J. Comput. System Sci. 48(3), 384–409 (1994)
5. Bern, M., Eppstein, D., Teng, S.-H.: Parallel construction of quadtrees and quality triangulations. Internat. J. Comput. Geom. Appl. 9(6), 517–532 (1999)