1. N. Amenta, D. Attali, O. Devillers, Complexity of Delaunay triangulation for points on lower-dimensional polyhedra, in: Proc. ACM–SIAM Sympos. Discrete Algorithms (SODAʼ07), New Orleans, Louisiana, USA, January 7–9, 2007.
2. Surface reconstruction by Voronoi filtering;Amenta;Discrete and Computational Geometry,1999
3. The crust and the β-skeleton: Combinatorial curve reconstruction;Amenta;Graphical Models and Image Processing,1998
4. r-Regular shape reconstruction from unorganized points;Attali;Computational Geometry: Theory and Applications,1998
5. A linear bound on the complexity of the Delaunay triangulation of points on polyhedral surfaces;Attali;Discrete and Computational Geometry,2004