1. Amenta, N., Attali, D., Devillers, O.: Complexity of Delaunay triangulation for points on lower-dimensional polyhedra. In: Proc. ACM-SIAM Sympos. Discrete Algorithms (SODA), New-Orleans, Louisiana, USA, 7–9 January 2007
2. Attali, D., Boissonnat, J.-D.: A linear bound on the complexity of the Delaunay triangulation of points on polyhedral surfaces. Discrete Comput. Geom. 31(3), 369–384 (2004)
3. Attali, D., Boissonnat, J.-D., Lieutier, A.: Complexity of the Delaunay triangulation of points on surfaces: the smooth case. In: Proc. of the 19th ACM Symposium on Computational Geometry, pp. 201–210 (2003)
4. Cheng, S.-W., Dey, T.K., Levine, J.A.: A practical Delaunay meshing algorithm for a large class of domains. In: Proceedings of the 16th International Meshing Roundtable, pp. 477–494 (2007)
5. Demmel, J.W.: The probability that a numerical analysis problem is difficult. Math. Comput. 50(182), 449–480 (1988)