Publications

PREPRINTS SURVEYS JOURNALS CONFERENCES MISCELLANEOUS TALKS

Preprints


Dominique Attali, Tuong-Bach Nguyen, and Isabelle Sivignon. (δ,ε)-ball approximation of a shape: defintion and complexity. [pdf]

Surveys

D. Attali, J.-D. Boissonnat, and H. Edelsbrunner. Stability and Computation of the Medial Axes — A State-of-the-Art Report. In T. Möller, B. Hamann, and R. Russell, editors, Mathematical Foundations of Scientific Visualization, Computer Graphics, and Massive Data Exploration, Mathematics and Vizualization, pages 109–125. Springer-Verlag, Berlin, Germany, 2009. [psfile] [pdf]


D. Attali, D. Coeurjolly et E. Remy. Représentation par axe médian. Chapitre 9 du livre "Géométrie discrète et images numériques" par D. Coeurjolly, A. Montanvert, and J.-M. Chassery. Ouvrage collectif. Traité IC2 série signal et image, Hermès, 2007. [pdf]

Selected publications in journals



Dominique Attali, Olivier Devillers, Marc Glisse, and Sylvain Lazard. Recognizing shrinkable complexes is NP-complete. Journal of Computational Geometry (JoCG), 7(1):430–443, 2016. [Doi] [pdf]


J. André, D. Attali, Q. Mérigot and B. Thibert. Far-field reflector problem under design constraints. International Journal of Computational Geometry & Applications (IJCGA), 25(2), June 2015. [Doi] [pdf]

D. Attali and A. Lieutier. Geometry driven collapses for converting a Čech complex into a triangulation of a nicely triangulable shape. Discrete and Computational Geometry, 54(4):798–825, 2015. [Doi] [pdf] [arXiv:1304.3680]

D. Attali, U. Bauer, O. Devillers, M. Glisse, and A. Lieutier. Homological Reconstruction and Simplification in R3. Computational Geometry: Theory and Applications (CGTA), 48(8):606–621, September 2015. [pdf]



D. Attali and A. Lieutier. Optimal Reconstruction Might be Hard. Discrete and Computational Geometry, 49(2):133–156, 2013. [DOI] [pdf]



D. Attali, A. Lieutier, and D. Salinas. Efficient data structure for representing and simplifying simplicial complexes in high dimensions. International Journal of Computational Geometry and Applications (IJCGA), 22(4):279–303, 2012. [pdf]



D. Attali, A. Lieutier, and D. Salinas. Vietoris-Rips complexes also provide topologically correct reconstructions of sampled shapes. Computational Geometry: Theory and Applications (CGTA), 46:448–465, 2012. [DOI] [pdf] [Errata]



N. Amenta, D. Attali, and O. Devillers. A tight bound for the Delaunay triangulation of points on a polyhedron. Discrete and Computational Geometry, 48(1):19–38, 2012. [pdf]

Old version:[Research Report INRIA 6522]



D. Attali and H. Edelsbrunner. Inclusion-exclusion formulas from independent complexes. Discrete and Computational Geometry. Vol. 37, No. 1, January, pages 59–77, 2007. [ps] [pdf]

D. Attali and J.-D. Boissonnat. A Linear Bound on the Complexity of the Delaunay Triangulation of Points on Polyhedral Surfaces. Discrete and Computational Geometry. Vol. 31, No. 3, February, pages 369–384, 2004. [ps] [pdf]

Dominique Attali and Jean-Daniel Boissonnat. Complexity of the Delaunay Triangulation of Points on Polyhedral Surfaces. Discrete and Computational Geometry. Vol. 30, pages 437–452, 2003. [psfile]



D. Attali. r-regular Shape Reconstruction from Unorganized Points. Computational Geometry: Theory and Applications, Vol. 10, pages 239–247, 1998.


D. Attali and A. Montanvert. Computing and Simplifying 2D and 3D Semicontinuous Skeletons of 2D and 3D shapes. Computer Vision and Image Understanding (CVIU), Vol. 67, No. 3, September, pages 261–273, 1997. [scanned pdf]

Selected proceedings of conferences

publications.bib

Maxime Sainlot, Vincent Nivoliers, and Dominique Attali. Restricting Voronoi diagrams to meshes using corner validation. In Computer Graphics Forum , volume 36, pages 81–91. Wiley Online Library, 2017. [pdf]

Dominique Attali, Tuong-Bach Nguyen, and Isabelle Sivignon. ε-covering is NP-complete. In Proc. European Workshop on Computational Geometry (EuroCG 2016), Lugano, Switzerland, March 30-April 1, 2016. [pdf]

Dominique Attali, Olivier Devillers, Marc Glisse, and Sylvain Lazard. Recognizing shrinkable complexes is NP-complete. In A. Schulz and D. Wagner, editors, In Proc. 22nd European Symposium on Algorithms (ESA'14), pages 74–86, Wroclaw, Poland, 2014. Springer.

D. Attali, U. Bauer, O. Devillers, M. Glisse, and A. Lieutier. Homological reconstruction and simplification in R3. In Proc. 29th Ann. Sympos. Comput. Geom. (SoCG'13), Rio de Janeiro, Brazil, June 17-20, 2013. [pdf]

D. Attali, A. Lieutier, and D. Salinas. Efficient data structure for representing and simplifying simplicial complexes in high dimension. In Proc. 27th Ann. Sympos. Comput. Geom. (SoCG'11), pages 501–509, Paris, France, June 13-15 2011. [pdf][Slides]

D. Attali, A. Lieutier, and D. Salinas. Vietoris-rips completes also provide topologically correct reconstructions of sampled shapes. In Proc. 27th Ann. Sympos. Comput. Geom. (SoCG'11), pages 491–500, Paris, France, June 13-15, 2011. [pdf]

D. Attali and A. Lieutier. Optimal reconstruction might be hard. In Proc. 26th Ann. Sympos. Comput. Geom. (SoCG'10), pages 334–342, Snowbird, Utah, June 13-16, 2010. [pdf]



D. Attali and A. Lieutier. Reconstructing shapes with guarantees by unions of convex sets. In Proc. 26th Ann. Sympos. Comput. Geom. (SoCG'10), pages 344–353, Snowbird, Utah, June 13-16, 2010. [pdf]

Full version: [Research Report HAL]


D. Attali, N. Amenta and O. Devillers. A Tight Bound for the Delaunay Triangulation of Points on a Polyhedron. In Proc. 24th European Workshop on Computational Geometry (EuroCG'08), Nancy, France. March 18--20, 2008. [pdf]


D. Attali, H. Edelsbrunner, J. Harer, and Y. Mileyko. Alpha-Beta Witness Complexes. In Proc. 10th Workshop on Algorithms and Data Structures (WADS), Halifax, Nova Scotia, Canada, August 15-17, 2007. [pdf]

Spheres


D. Attali, H. Edelsbrunner, and Y. Mileyko. Weak Witnesses for Delaunay triangulations of Submanifold. In Proc. ACM Sympos. Solid and Physical Modeling (SPM), Beijing, China, June 4-6, pages 143–150, 2007. [ps] [pdf]
   


N. Amenta, D. Attali, and O. Devillers. Complexity of Delaunay Triangulation for Points on Lower-dimensional Polyhedra. In Proc. ACM-SIAM Sympos. Discrete Algorithms (SODA07), New-Orleans, Lousiane, USA, January 7-9, 2007. [pdf]




D. Attali, D. Cohen-Steiner, and H. Edelsbrunner. Extraction and Simplification of Iso-surfaces in Tandem. In Proc. 3rd Ann. Sympos. Geom. Process. (SGP), Vienna, Autria, July 4-6, pages 139–148, 2005. [psfile] [pdf]



D. Attali and H. Edelsbrunner. Inclusion-exclusion formulas from independent complexes. In Proc. 21st Ann. Sympos. Comput. Geom. (SoCG), pages 247–254, 2005 [psfile] [pdf]
D. Attali, J.-D. Boissonnat, and A. Lieutier. Complexity of the Delaunay triangulation of Points on Surfaces: the Smooth Case. In Proc. of the 19th ACM Symposium on Computational Geometry (SoCG), pages 201–210, San-Diego, California, USA, June 2003. [psfile]


D. Attali and J.-D. Boissonnat. A Linear Bound on the Complexity of the Delaunay Triangulation of Points on Polyhedral Surfaces. In Proc. of the 7th ACM Symposium on Solid Modeling and applications, pages 139–145, Saarbrücken, Germany, June 17-21, 2002. [psfile][slides] [slides 16x16]




D. Attali. r-Regular Shape Reconstruction from Unorganized Points. In Proc. of the 13th ACM Symposium on Computational Geometry (SoCG), pages 248–253, Nice, France, June 1997. [psfile]


D. Attali and A. Montanvert. Modeling noise for a better simplification of skeletons. In Proc. of the International Conference on Image Processing (ICIP), Volume III, pages 13–16, Lausanne, Switzerland, September 1996.
[psfile]


D. Attali, P. Bertolino, and A. Montanvert. Using polyballs to approximate shapes and skeletons. In 12th International Conference on Pattern Recognition (ICPR), pages 626–628, Jerusalem, Israël, October 1994. [scanned pdf]

Miscellaneous

Manuscripts:
Journals:
Conferences:
Theses:

Talks (at workshops)

International:
National: