# André Lieutier

According to our database

Collaborative distances:

^{1}, André Lieutier authored at least 43 papers between 1999 and 2018.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2018

The Reach, Metric Distortion, Geodesic Convexity and the Variation of Tangent Spaces.

Proceedings of the 34th International Symposium on Computational Geometry, 2018

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

2013

A computational model for multi-variable differential calculus.

Inf. Comput., 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

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

Ball-Map: Homeomorphism between Compatible Surfaces.

Int. J. Comput. Geometry Appl., 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

2009

A Sampling Theory for Compact Sets in Euclidean Space.

Discrete & Computational Geometry, 2009

Normal cone approximation and offset shape isotopy.

Comput. Geom., 2009

Discrete Critical Values: a General Framework for Silhouettes Computation.

Comput. Graph. Forum, 2009

Stability of Curvature Measures.

Comput. Graph. Forum, 2009

Convergence of geodesics on triangulations.

Computer Aided Geometric Design, 2009

2008

Stability of Curvature Measures

CoRR, 2008

Smooth manifold reconstruction from noisy and non-uniform approximation with guarantees.

Comput. Geom., 2008

Geodesic as Limit of Geodesics on PL-Surfaces.

Proceedings of the Advances in Geometric Modeling and Processing, 2008

2007

Normal-Map between Normal-Compatible Manifolds.

Int. J. Comput. Geometry Appl., 2007

Discrete & Computational Geometry, 2007

Shape smoothing using double offsets.

Proceedings of the 2007 ACM Symposium on Solid and Physical Modeling, 2007

2006

Topology guaranteeing manifold reconstruction using distance function to noisy data.

Proceedings of the 22nd ACM Symposium on Computational Geometry, 2006

A sampling theory for compact sets in Euclidean space.

Proceedings of the 22nd ACM Symposium on Computational Geometry, 2006

2005

The "

*lambda*-medial axis".
Graphical Models, 2005

Projection-homeomorphic surfaces.

Proceedings of the Ninth ACM Symposium on Solid and Physical Modeling 2005, 2005

A Computational Model for Multi-variable Differential Calculus.

Proceedings of the Foundations of Software Science and Computational Structures, 2005

Weak feature size and persistent homology: computing homology of solids in R

^{n}from noisy data samples.
Proceedings of the 21st ACM Symposium on Computational Geometry, 2005

Geometric Software: Robustness Issues and Model of Computation.

Proceedings of the New Computational Paradigms, 2005

Computability in Computational Geometry.

Proceedings of the New Computational Paradigms, 2005

2004

Domain theory and differential calculus (functions of one variable).

Mathematical Structures in Computer Science, 2004

Any open bounded subset of R

^{n}has the same homotopy type as its medial axis.
Computer-Aided Design, 2004

2003

Any open bounded subset of R

*has the same homotopy type than its medial axis.*^{n}
Proceedings of the Eighth ACM Symposium on Solid Modeling and Applications 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

Foundation of a computable solid modelling.

Theor. Comput. Sci., 2002

Computability of Partial Delaunay Triangulation and Voronoi Diagram.

Electr. Notes Theor. Comput. Sci., 2002

Domain Theory and Differential Calculus (Functions of one Variable).

Proceedings of the 17th IEEE Symposium on Logic in Computer Science (LICS 2002), 2002

2001

The convex hull in a new model of computation.

Proceedings of the 13th Canadian Conference on Computational Geometry, 2001

1999

Foundation of a computable solid modeling.

Proceedings of the Fifth ACM Symposium on Solid Modeling and Applications, 1999

Invited Paper: Computable Partial Solids and Voxels Sets.

Proceedings of the Discrete Geometry for Computer Imagery, 1999