André Lieutier

Proceedings of the 40th International Symposium on Computational Geometry, 2024

The Ultimate Frontier: An Optimality Construction for Homotopy Inference (Media Exposition).

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the 40th International Symposium on Computational Geometry, 2024

2023

Delaunay and Regular Triangulations as Lexicographic Optimal Chains.

[BibT_eX]

[DOI]

Julien Vuillamy

Discret. Comput. Geom., July, 2023

Hausdorff and Gromov-Hausdorff Stable Subsets of the Medial Axis.

[BibT_eX]

[DOI]

Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

2022

Lexicographic Optimal Homologous Chains and Applications to Point Cloud Triangulations.

[BibT_eX]

[DOI]

Julien Vuillamy

Discret. Comput. Geom., 2022

The medial axis of closed bounded sets is Lipschitz stable with respect to the Hausdorff distance under ambient diffeomorphisms.

[BibT_eX]

[DOI]

CoRR, 2022

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

[BibT_eX]

[DOI]

CoRR, 2022

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

[BibT_eX]

[DOI]

CoRR, 2022

Flat Delaunay Complexes for Homeomorphic Manifold Reconstruction.

[BibT_eX]

[DOI]

CoRR, 2022

Simplification of 2D Polygonal Partitions via Point-line Projective Duality, and Application to Urban Reconstruction.

[BibT_eX]

[DOI]

Comput. Graph. Forum, 2022

Delaunay-Like Triangulation of Smooth Orientable Submanifolds by ℓ1-Norm Minimization.

[BibT_eX]

[DOI]

Proceedings of the 38th International Symposium on Computational Geometry, 2022

2021

Local Conditions for Triangulating Submanifolds of Euclidean Space.

[BibT_eX]

[DOI]

Jean-Daniel Boissonnat

Discret. Comput. Geom., 2021

Physically-Aware Generative Network for 3D Shape Modeling.

[BibT_eX]

[DOI]

Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, 2021

2019

The reach, metric distortion, geodesic convexity and the variation of tangent spaces.

[BibT_eX]

[DOI]

Jean-Daniel Boissonnat

J. Appl. Comput. Topol., 2019

The convex hull of finitely generable subsets and its predicate transformer.

[BibT_eX]

[DOI]

Mohammad-Javad Davari

Proceedings of the 34th Annual ACM/IEEE Symposium on Logic in Computer Science, 2019

When Convexity Helps Collapsing Complexes.

[BibT_eX]

[DOI]

David Salinas

Proceedings of the 35th International Symposium on Computational Geometry, 2019

2018

Manifold Learning in Quotient Spaces.

[BibT_eX]

[DOI]

Éloi Mehr

Fernando Sanchez Bermudez

Vincent Guitteny

Nicolas Thome

Matthieu Cord

Proceedings of the 2018 IEEE Conference on Computer Vision and Pattern Recognition, 2018

2015

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

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2015

Homological reconstruction and simplification in R3.

[BibT_eX]

[DOI]

Comput. Geom., 2015

2013

A computational model for multi-variable differential calculus.

[BibT_eX]

[DOI]

Dirk Pattinson

Inf. Comput., 2013

Optimal Reconstruction Might be Hard.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2013

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

[BibT_eX]

[DOI]

David Salinas

Comput. Geom., 2013

2012

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

[BibT_eX]

[DOI]

David Salinas

Int. J. Comput. Geom. Appl., 2012

2010

Ball-Map: Homeomorphism between Compatible Surfaces.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2010

Reconstructing shapes with guarantees by unions of convex sets.

[BibT_eX]

[DOI]

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

2009

A Sampling Theory for Compact Sets in Euclidean Space.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2009

Normal cone approximation and offset shape isotopy.

[BibT_eX]

[DOI]

Comput. Geom., 2009

Discrete Critical Values: a General Framework for Silhouettes Computation.

[BibT_eX]

[DOI]

N. Montana

Comput. Graph. Forum, 2009

Stability of Curvature Measures.

[BibT_eX]

[DOI]

Comput. Graph. Forum, 2009

Convergence of geodesics on triangulations.

[BibT_eX]

[DOI]

Boris Thibert

Comput. Aided Geom. Des., 2009

2008

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

[BibT_eX]

[DOI]

Comput. Geom., 2008

Geodesic as Limit of Geodesics on PL-Surfaces.

[BibT_eX]

[DOI]

Boris Thibert

Proceedings of the Advances in Geometric Modeling and Processing, 2008

2007

Normal-Map between Normal-Compatible Manifolds.

[BibT_eX]

[DOI]

Jarek Rossignac

Int. J. Comput. Geom. Appl., 2007

Stability and Computation of Topological Invariants of Solids in \Bbb Rn.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2007

Shape smoothing using double offsets.

[BibT_eX]

[DOI]

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

2006

Topology guaranteeing manifold reconstruction using distance function to noisy data.

[BibT_eX]

[DOI]

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

2005

The "lambda-medial axis".

[BibT_eX]

[DOI]

Graph. Model., 2005

Projection-homeomorphic surfaces.

[BibT_eX]

[DOI]

Jarek Rossignac

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

Weak feature size and persistent homology: computing homology of solids in Rn from noisy data samples.

[BibT_eX]

[DOI]

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

Geometric Software: Robustness Issues and Model of Computation.

[BibT_eX]

[DOI]

Proceedings of the New Computational Paradigms, 2005

Computability in Computational Geometry.

[BibT_eX]

[DOI]

Ali Asghar Khanban

Proceedings of the New Computational Paradigms, 2005

2004

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

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2004

Any open bounded subset of Rn has the same homotopy type as its medial axis.

[BibT_eX]

[DOI]

Comput. Aided Des., 2004

Stability and homotopy of a subset of the medial axis.

[BibT_eX]

[DOI]

Proceedings of the Ninth ACM Symposium on Solid Modeling and Applications, 2004

2003

Any open bounded subset of Rn has the same homotopy type than its medial axis.

[BibT_eX]

[DOI]

Proceedings of the Eighth ACM Symposium on Solid Modeling and Applications 2003, 2003

Domain-theoretic Solution of Differential Equations (Scalar Fields).

[BibT_eX]

[DOI]

Marko Krznaric

Proceedings of 19th Conference on the Mathematical Foundations of Programming Semantics, 2003

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

[BibT_eX]

[DOI]

Jean-Daniel Boissonnat

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

2002

Foundation of a computable solid modelling.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2002

Computability of Partial Delaunay Triangulation and Voronoi Diagram.

[BibT_eX]

[DOI]

Ali Asghar Khanban

Proceedings of the Computability and Complexity in Analysis, 2002

2001

The convex hull in a new model of computation.

[BibT_eX]

[DOI]

Elham Kashefi

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

1999

Foundation of a computable solid modeling.

[BibT_eX]

[DOI]

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

Invited Paper: Computable Partial Solids and Voxels Sets.

[BibT_eX]

[DOI]