| Publication | Date of Publication | Type |
|---|
Covering families of triangles
Periodica Mathematica Hungarica | 2023-10-04 | Paper |
| DTM-based filtrations | 2022-07-18 | Paper |
| scientific article; zbMATH DE number 7525459 (Why is no real title available?) | 2022-05-11 | Paper |
| Swap, Shift and Trim to Edge Collapse a Filtration | 2022-03-14 | Paper |
Randomized incremental construction of Delaunay triangulations of nice point sets
Discrete & Computational Geometry | 2021-07-02 | Paper |
DTM-based filtrations
Topological Data Analysis | 2020-09-08 | Paper |
| Monotone simultaneous paths embeddings in \(\mathbb{R}^d\) | 2018-12-10 | Paper |
Proximity of persistence modules and their diagrams
Proceedings of the twenty-fifth annual symposium on Computational geometry | 2017-10-20 | Paper |
| On the smoothed complexity of convex hulls | 2017-10-10 | Paper |
The number of lines tangent to arbitrary convex polyhedra in 3D
Proceedings of the twentieth annual symposium on Computational geometry | 2017-09-29 | Paper |
| Recognizing shrinkable complexes is NP-complete | 2017-03-30 | Paper |
| Smoothed complexity of convex hulls by witnesses and collectors | 2017-03-30 | Paper |
| Silhouette of a random polytope | 2017-03-30 | Paper |
Monotone simultaneous embeddings of paths in \(d\) dimensions
Lecture Notes in Computer Science | 2017-02-21 | Paper |
The structure and stability of persistence modules
SpringerBriefs in Mathematics | 2016-08-08 | Paper |
Convergence rates for persistence diagram estimation in topological data analysis
Journal of Machine Learning Research (JMLR) | 2016-02-19 | Paper |
Convergence rates for persistence diagram estimation in topological data analysis
Journal of Machine Learning Research (JMLR) | 2016-02-19 | Paper |
Homological reconstruction and simplification in \(\mathbb{R}^3\)
Computational Geometry | 2015-07-27 | Paper |
Complexity analysis of random geometric structures made simpler
Proceedings of the twenty-ninth annual symposium on Computational geometry | 2015-02-17 | Paper |
Homological reconstruction and simplification in \(\mathbb{R}^3\)
Proceedings of the twenty-ninth annual symposium on Computational geometry | 2015-02-17 | Paper |
Recognizing shrinkable complexes is NP-complete
Algorithms - ESA 2014 | 2014-10-08 | Paper |
The monotonicity of \(f\)-vectors of random polytopes
Electronic Communications in Probability | 2014-09-22 | Paper |
The Gudhi library: simplicial complexes and persistent homology
Mathematical Software – ICMS 2014 | 2014-09-08 | Paper |
On the complexity of sets of free lines and line segments among balls in three dimensions
Proceedings of the twenty-sixth annual symposium on Computational geometry | 2014-04-03 | Paper |
Point-set embeddability of 2-colored trees
Graph Drawing | 2013-04-03 | Paper |
On the complexity of sets of free lines and line segments among balls in three dimensions
Discrete & Computational Geometry | 2012-05-22 | Paper |
Farthest-polygon Voronoi diagrams
Computational Geometry | 2011-03-25 | Paper |
Helly-type theorems for approximate covering
Discrete & Computational Geometry | 2009-08-27 | Paper |
On the complexity of umbra and penumbra
Computational Geometry | 2009-06-30 | Paper |
LATIN 2004: Theoretical Informatics
Lecture Notes in Computer Science | 2009-05-07 | Paper |
| Between umbra and penumbra | 2009-02-12 | Paper |
Helly-type theorems for approximate covering
Proceedings of the twenty-fourth annual symposium on Computational geometry | 2009-02-12 | Paper |
Predicates for line transversals to lines and line segments in three-dimensional space
Proceedings of the twenty-fourth annual symposium on Computational geometry | 2009-02-12 | Paper |
| scientific article; zbMATH DE number 5506198 (Why is no real title available?) | 2009-02-10 | Paper |
An upper bound on the average size of silhouettes
Discrete & Computational Geometry | 2008-12-02 | Paper |
Farthest-Polygon Voronoi Diagrams
Algorithms – ESA 2007 | 2008-09-25 | Paper |
Lines and Free Line Segments Tangent to Arbitrary Three-Dimensional Convex Polyhedra
SIAM Journal on Computing | 2008-04-22 | Paper |
Octrees with near optimal cost for ray-shooting
Computational Geometry | 2006-06-30 | Paper |
