Dominique Attali

According to our database1, Dominique Attali authored at least 43 papers between 1994 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
The Ultimate Frontier: An Optimality Construction for Homotopy Inference (Media Exposition).
Proceedings of the 40th International Symposium on Computational Geometry, 2024

Tight Bounds for the Learning of Homotopy à la Niyogi, Smale, and Weinberger for Subsets of Euclidean Spaces and of Riemannian Manifolds.
Proceedings of the 40th International Symposium on Computational Geometry, 2024

2022
Optimal homotopy reconstruction results à la Niyogi, Smale, and Weinberger.
CoRR, 2022

Delaunay-like Triangulation of Smooth Orientable Submanifolds by L1-Norm Minimization.
CoRR, 2022

Flat Delaunay Complexes for Homeomorphic Manifold Reconstruction.
CoRR, 2022

Delaunay-Like Triangulation of Smooth Orientable Submanifolds by ℓ<sub>1</sub>-Norm Minimization.
Proceedings of the 38th International Symposium on Computational Geometry, 2022

2019
(δ, ε)-Ball Approximation of a Shape: Definition and Complexity.
Discret. Comput. Geom., 2019

When Convexity Helps Collapsing Complexes.
Proceedings of the 35th International Symposium on Computational Geometry, 2019

2017
Restricting Voronoi diagrams to meshes using corner validation.
Comput. Graph. Forum, 2017

2016
Recognizing shrinkable complexes is NP-complete.
J. Comput. Geom., 2016

2015
Far-Field Reflector Problem Under Design Constraints.
Int. J. Comput. Geom. Appl., 2015

Geometry-driven Collapses for Converting a Čech Complex into a Triangulation of a Nicely Triangulable Shape.
Discret. Comput. Geom., 2015

Homological reconstruction and simplification in R<sup>3</sup>.
Comput. Geom., 2015

2013
Optimal Reconstruction Might be Hard.
Discret. Comput. Geom., 2013

Vietoris-Rips complexes also provide topologically correct reconstructions of sampled shapes.
Comput. Geom., 2013

2012
Efficient Data Structure for Representing and Simplifying Simplicial complexes in High Dimensions.
Int. J. Comput. Geom. Appl., 2012

A Tight Bound for the Delaunay Triangulation of Points on a Polyhedron.
Discret. Comput. Geom., 2012

2010
Reconstructing shapes with guarantees by unions of convex sets.
Proceedings of the 26th ACM Symposium on Computational Geometry, 2010

2009
Stability and Computation of Medial Axes - a State-of-the-Art Report.
Proceedings of the Mathematical Foundations of Scientific Visualization, 2009

2008

2007
Inclusion-Exclusion Formulas from Independent Complexes.
Discret. Comput. Geom., 2007

Alpha-Beta Witness Complexes.
Proceedings of the Algorithms and Data Structures, 10th International Workshop, 2007

Complexity of Delaunay triangulation for points on lower-dimensional polyhedra.
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

Weak witnesses for Delaunay triangulations of submanifolds.
Proceedings of the 2007 ACM Symposium on Solid and Physical Modeling, 2007

2005
Extraction and Simplification of Iso-surfaces in Tandem.
Proceedings of the Third Eurographics Symposium on Geometry Processing, 2005

2004
A Linear Bound on the Complexity of the Delaunay Triangulation of Points on Polyhedral Surfaces.
Discret. Comput. Geom., 2004

2003
A new method for analyzing local shape in three-dimensional images based on medial axis transformation.
IEEE Trans. Syst. Man Cybern. Part B, 2003

Complexity of the Delaunay Triangulation of Points on Polyhedral Surfaces.
Discret. Comput. Geom., 2003

Topological quadrangulations of closed triangulated surfaces using the Reeb graph.
Graph. Model., 2003

Detection of constrictions on closed polyhedral surfaces.
Proceedings of the 5th Joint Eurographics - IEEE TCVG Symposium on Visualization, 2003

From a Closed Piecewise Geodesic to a Constriction on a Closed Triangulated Surface.
Proceedings of the 11th Pacific Conference on Computer Graphics and Applications, 2003

Complexity of the delaunay triangulation of points on surfaces the smooth case.
Proceedings of the 19th ACM Symposium on Computational Geometry, 2003

2001
Delaunay conforming iso-surface, skeleton extraction and noise removal.
Comput. Geom., 2001

Shape description of three-dimensional images based on medial axis.
Proceedings of the 2001 International Conference on Image Processing, 2001

1999
Constructing Iso-Surfaces Satisfying the Delaunay Constraint: Application to the Skeleton Computation.
Proceedings of the 1oth International Conference on Image Analysis and Processing (ICIAP 1999), 1999

1998
r-regular shape reconstruction from unorganized points.
Comput. Geom., 1998

1997
Computing and Simplifying 2D and 3D Continuous Skeletons.
Comput. Vis. Image Underst., 1997

Skeletal Reconstruction of Branching Shapes.
Comput. Graph. Forum, 1997

<i>r</i>-Regular Shape Reconstruction from Unorganized Points.
Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997

1996
Modeling noise for a better simplification of skeletons.
Proceedings of the Proceedings 1996 International Conference on Image Processing, 1996

1995
Squelettes et graphes de Voronoï 2D et 3D. (2D and 3D skeletons and Voronoi graphs).
PhD thesis, 1995

Pruning Discrete and Semiocontinuous Skeletons.
Proceedings of the Image Analysis and Processing, 8th International Conference, 1995

1994
Using polyballs to approximate shapes and skeletons.
Proceedings of the 12th IAPR International Conference on Pattern Recognition, 1994


  Loading...