| Publication | Date of Publication | Type |
|---|
Delaunay-like triangulation of smooth orientable submanifolds by \(\ell_1\)-norm minimization
| 2024-05-14 | Paper |
When Convexity Helps Collapsing Complexes
| 2022-07-18 | Paper |
\((\delta ,\varepsilon)\)-ball approximation of a shape: definition and complexity
Discrete & Computational Geometry | 2019-03-13 | Paper |
Inclusion-exclusion formulas from independent complexes
Proceedings of the twenty-first annual symposium on Computational geometry | 2017-10-20 | Paper |
Complexity of the Delaunay triangulation of points on surfaces the smooth case (extended abstract)
Proceedings of the nineteenth annual symposium on Computational geometry | 2017-09-29 | Paper |
Recognizing shrinkable complexes is NP-complete
| 2017-03-30 | Paper |
Geometry-driven collapses for converting a Čech complex into a triangulation of a nicely triangulable shape
Discrete & Computational Geometry | 2016-02-03 | Paper |
Far-field reflector problem under design constraints
International Journal of Computational Geometry & Applications | 2015-11-03 | Paper |
Homological reconstruction and simplification in \(\mathbb{R}^3\)
Computational Geometry | 2015-07-27 | Paper |
Homological reconstruction and simplification in \(\mathbb{R}^3\)
Proceedings of the twenty-ninth annual symposium on Computational geometry | 2015-02-17 | Paper |
Complexity of Delaunay triangulation for points on lower-dimensional polyhedra
| 2014-12-18 | Paper |
Recognizing shrinkable complexes is NP-complete
Algorithms - ESA 2014 | 2014-10-08 | Paper |
Reconstructing shapes with guarantees by unions of convex sets
Proceedings of the twenty-sixth annual symposium on Computational geometry | 2014-04-03 | Paper |
Optimal reconstruction might be hard
Proceedings of the twenty-sixth annual symposium on Computational geometry | 2014-04-03 | Paper |
Efficient data structure for representing and simplifying simplicial complexes in high dimensions
Proceedings of the twenty-seventh annual symposium on Computational geometry | 2014-03-24 | Paper |
Vietoris-rips complexes also provide topologically correct reconstructions of sampled shapes
Proceedings of the twenty-seventh annual symposium on Computational geometry | 2014-03-24 | Paper |
Optimal reconstruction might be hard
Discrete & Computational Geometry | 2013-03-20 | Paper |
Vietoris-Rips complexes also provide topologically correct reconstructions of sampled shapes
Computational Geometry | 2013-03-07 | Paper |
A tight bound for the Delaunay triangulation of points on a polyhedron
Discrete & Computational Geometry | 2012-08-13 | Paper |
Stability and computation of medial axes: a state-of-the-art report
Mathematics and Visualization | 2009-12-11 | Paper |
Alpha-Beta Witness Complexes
Lecture Notes in Computer Science | 2009-02-17 | Paper |
LOCAL GEOMETRICAL ANALYSIS OF 3D POROUS NETWORKS BASED ON THE MEDIAL AXIS: APPLICATION TO BONE MICROARCHITECTURE MICROTOMOGRAPHY IMAGES
Image Analysis & Stereology | 2009-02-03 | Paper |
Inclusion-exclusion formulas from independent complexes
Discrete & Computational Geometry | 2007-02-14 | Paper |
A linear bound on the complexity of the Delaunay triangulation of points on polyhedral surfaces
Discrete & Computational Geometry | 2004-12-16 | Paper |
scientific article; zbMATH DE number 2087451 (Why is no real title available?)
| 2004-08-11 | Paper |
Complexity of the Delaunay triangulation of points on polyhedral surfaces
Discrete & Computational Geometry | 2004-07-07 | Paper |
scientific article; zbMATH DE number 2064504 (Why is no real title available?)
| 2004-05-18 | Paper |
Topological quadrangulations of closed triangulated surfaces using the Reeb graph
Graphical Models | 2003-08-20 | Paper |
Delaunay conforming iso-surface, skeleton extraction and noise removal
Computational Geometry | 2001-10-14 | Paper |
\(r\)-regular shape reconstruction from unorganized points
Computational Geometry | 1998-09-28 | Paper |
