# Dominique Attali

According to our database

Collaborative distances:

^{1}, Dominique Attali authored at least 43 papers between 1994 and 2017.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2017

Restricting Voronoi diagrams to meshes using corner validation.

Comput. Graph. Forum, 2017

2016

Recognizing shrinkable complexes is NP-complete.

JoCG, 2016

2015

Far-Field Reflector Problem Under Design Constraints.

Int. J. Comput. Geometry Appl., 2015

Geometry-driven Collapses for Converting a Čech Complex into a Triangulation of a Nicely Triangulable Shape.

Discrete & Computational Geometry, 2015

Homological reconstruction and simplification in R

^{3}.
Comput. Geom., 2015

2014

Recognizing Shrinkable Complexes Is NP-Complete.

Proceedings of the Algorithms - ESA 2014, 2014

2013

Optimal Reconstruction Might be Hard.

Discrete & Computational Geometry, 2013

Geometry driven collapses for converting a Cech complex into a triangulation of a nicely triangulable shape

CoRR, 2013

Vietoris-Rips complexes also provide topologically correct reconstructions of sampled shapes.

Comput. Geom., 2013

Homological reconstruction and simplification in R

^{3}.
Proceedings of the Symposuim on Computational Geometry 2013, 2013

2012

Efficient Data Structure for Representing and Simplifying Simplicial complexes in High Dimensions.

Int. J. Comput. Geometry Appl., 2012

A Tight Bound for the Delaunay Triangulation of Points on a Polyhedron.

Discrete & Computational Geometry, 2012

2011

Efficient data structure for representing and simplifying simplicial complexes in high dimensions.

Proceedings of the 27th ACM Symposium on Computational Geometry, 2011

Vietoris-rips complexes also provide topologically correct reconstructions of sampled shapes.

Proceedings of the 27th ACM Symposium on Computational Geometry, 2011

2010

Reconstructing shapes with guarantees by unions of convex sets.

Proceedings of the 26th ACM Symposium on Computational Geometry, 2010

Optimal reconstruction might be hard.

Proceedings of the 26th ACM Symposium on Computational Geometry, 2010

2008

Skeletal Structures.

Proceedings of the Shape Analysis and Structuring, 2008

2007

Inclusion-Exclusion Formulas from Independent Complexes.

Discrete & Computational Geometry, 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

Inclusion-exclusion formulas from independent complexes.

Proceedings of the 21st ACM Symposium on Computational Geometry, 2005

2004

A Linear Bound on the Complexity of the Delaunay Triangulation of Points on Polyhedral Surfaces.

Discrete & Computational Geometry, 2004

2003

A new method for analyzing local shape in three-dimensional images based on medial axis transformation.

IEEE Trans. Systems, Man, and Cybernetics, Part B, 2003

Complexity of the Delaunay Triangulation of Points on Polyhedral Surfaces.

Discrete & Computational Geometry, 2003

Topological quadrangulations of closed triangulated surfaces using the Reeb graph.

Graphical Models, 2003

Detection of constrictions on closed polyhedral surfaces.

Proceedings of the VisSym 2003, 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 (PG 2003), 2003

Complexity of the delaunay triangulation of points on surfaces the smooth case.

Proceedings of the 19th ACM Symposium on Computational Geometry, 2003

2002

A linear bound on the complexity of the delaunay triangulation of points on polyhedral surfaces.

Proceedings of the Seventh ACM Symposium on Solid Modeling and Applications, 2002

Topological Quadrangulations of Closed Triangulated Surfaces Using the Reeb Graph.

Proceedings of the Discrete Geometry for Computer Imagery, 10th International Conference, 2002

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.

Computer Vision and Image Understanding, 1997

Skeletal Reconstruction of Branching Shapes.

Comput. Graph. Forum, 1997

*r*-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