| Publication | Date of Publication | Type |
|---|
| On edge collapse of random simplicial complexes | 2025-11-24 | Paper |
| Edge Collapse and Persistence of Flag Complexes | 2023-11-02 | Paper |
| Dimensionality Reduction for k-Distance Applied to Persistent Homology | 2023-11-02 | Paper |
| The Topological Correctness of PL-Approximations of Isomanifolds | 2023-11-02 | Paper |
The reach of subsets of manifolds
Journal of Applied and Computational Topology | 2023-09-18 | Paper |
Tracing Isomanifolds in \(\mathbb{R}\) <sup><i>d</i></sup> in Time Polynomial in <i>d</i> using Coxeter–Freudenthal–Kuhn Triangulations
SIAM Journal on Computing | 2023-04-28 | Paper |
Strong collapse and persistent homology
Journal of Topology and Analysis | 2023-03-09 | Paper |
Local criteria for triangulating general manifolds
Discrete & Computational Geometry | 2023-01-23 | Paper |
| Topological data analysis | 2022-10-07 | Paper |
On the boundary of a union of Rays
STACS 89 | 2022-08-16 | Paper |
The topological correctness of PL approximations of isomanifolds
Foundations of Computational Mathematics | 2022-08-05 | Paper |
| Computing persistent homology of flag complexes via strong collapses | 2022-07-18 | Paper |
| scientific article; zbMATH DE number 7525459 (Why is no real title available?) | 2022-05-11 | Paper |
Dimensionality reduction for \(k\)-distance applied to persistent homology
Journal of Applied and Computational Topology | 2022-01-10 | Paper |
Local conditions for triangulating submanifolds of Euclidean space
Discrete & Computational Geometry | 2021-08-18 | Paper |
Strong Collapse for Persistence
(available as arXiv preprint) | 2021-08-04 | Paper |
Triangulating submanifolds: an elementary and quantified version of Whitney's method
Discrete & Computational Geometry | 2021-07-02 | Paper |
Randomized incremental construction of Delaunay triangulations of nice point sets
Discrete & Computational Geometry | 2021-07-02 | Paper |
| The reach, metric distortion, geodesic convexity and the variation of tangent spaces | 2020-08-18 | Paper |
Local criteria for triangulation of manifolds
(available as arXiv preprint) | 2020-08-18 | Paper |
| Kernelization of the subset general position problem in geometry | 2020-05-26 | Paper |
| Tight kernels for covering and hitting: point hyperplane cover and polynomial point hitting set | 2020-02-12 | Paper |
The reach, metric distortion, geodesic convexity and the variation of tangent spaces
Journal of Applied and Computational Topology | 2019-09-11 | Paper |
Computing persistent homology with various coefficient fields in a single pass
Journal of Applied and Computational Topology | 2019-09-11 | Paper |
Anisotropic triangulations via discrete Riemannian Voronoi diagrams
SIAM Journal on Computing | 2019-09-02 | Paper |
An efficient representation for filtrations of simplicial complexes
ACM Transactions on Algorithms | 2019-03-28 | Paper |
| Geometric and topological inference | 2018-10-25 | Paper |
| Anisotropic triangulations via discrete Riemannian Voronoi diagrams | 2018-08-13 | Paper |
An efficient representation for filtrations of simplicial complexes
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Delaunay triangulation of manifolds
Foundations of Computational Mathematics | 2018-05-18 | Paper |
An obstruction to Delaunay triangulations in Riemannian manifolds
Discrete & Computational Geometry | 2018-02-28 | Paper |
An obstruction to Delaunay triangulations in Riemannian manifolds
Discrete & Computational Geometry | 2018-02-28 | Paper |
Only distances are required to reconstruct submanifolds
Computational Geometry | 2018-02-12 | Paper |
Incremental construction of the delaunay triangulation and the delaunay graph in medium dimension
Proceedings of the twenty-fifth annual symposium on Computational geometry | 2017-10-20 | Paper |
Learning smooth objects by probing
Proceedings of the twenty-first annual symposium on Computational geometry | 2017-10-20 | Paper |
Anisotropic Delaunay meshes of surfaces
ACM Transactions on Graphics | 2017-10-20 | Paper |
Building efficient and compact data structures for simplicial complexes
(available as arXiv preprint) | 2017-10-10 | Paper |
Building efficient and compact data structures for simplicial complexes
Algorithmica | 2017-10-10 | 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 |
Smooth surface reconstruction via natural neighbour interpolation of distance functions
Proceedings of the sixteenth annual symposium on Computational geometry | 2017-09-29 | Paper |
Triangulations in CGAL (extended abstract)
Proceedings of the sixteenth annual symposium on Computational geometry | 2017-09-29 | Paper |
CGALmesh: a generic framework for Delaunay mesh generation
ACM Transactions on Mathematical Software | 2016-10-24 | Paper |
On the complexity of the representation of simplicial complexes by trees
Theoretical Computer Science | 2016-01-28 | Paper |
A probabilistic approach to reducing algebraic complexity of Delaunay triangulations
Algorithms - ESA 2015 | 2015-11-19 | Paper |
The compressed annotation matrix: an efficient data structure for computing persistent cohomology
Algorithmica | 2015-11-19 | Paper |
| An elementary approach to tangent space variation on Riemannian submanifolds | 2015-06-21 | Paper |
Anisotropic Delaunay mesh generation
SIAM Journal on Computing | 2015-06-02 | Paper |
Delaunay stability via perturbations
International Journal of Computational Geometry & Applications | 2015-01-23 | Paper |
The simplex tree: an efficient data structure for general simplicial complexes
Algorithmica | 2015-01-19 | Paper |
| On Bregman Voronoi diagrams | 2014-12-18 | Paper |
Computing persistent homology with various coefficient fields in a single pass
Lecture Notes in Computer Science | 2014-10-08 | Paper |
The Gudhi library: simplicial complexes and persistent homology
Mathematical Software – ICMS 2014 | 2014-09-08 | Paper |
The stability of Delaunay triangulations
International Journal of Computational Geometry & Applications | 2014-08-11 | Paper |
Stability of Delaunay-type structures for manifolds (extended abstract)
Proceedings of the twenty-eighth annual symposium on Computational geometry | 2014-08-07 | Paper |
Manifold reconstruction using tangential Delaunay complexes
Proceedings of the twenty-sixth annual symposium on Computational geometry | 2014-04-03 | Paper |
Geometric tomography with topological guarantees
Proceedings of the twenty-sixth annual symposium on Computational geometry | 2014-04-03 | Paper |
Manifold reconstruction using tangential Delaunay complexes
Discrete & Computational Geometry | 2014-03-25 | Paper |
Geometric tomography with topological guarantees
Discrete & Computational Geometry | 2014-01-24 | Paper |
The compressed annotation matrix: an efficient data structure for computing persistent cohomology
Lecture Notes in Computer Science | 2013-09-17 | Paper |
The simplex tree: an efficient data structure for general simplicial complexes
Lecture Notes in Computer Science | 2012-09-25 | Paper |
Triangulating smooth submanifolds with light scaffolding
Mathematics in Computer Science | 2012-01-02 | Paper |
Bregman Voronoi diagrams
Discrete & Computational Geometry | 2010-09-22 | Paper |
Isotopic implicit surface meshing
Proceedings of the thirty-sixth annual ACM symposium on Theory of computing | 2010-08-15 | Paper |
Stability and computation of medial axes: a state-of-the-art report
Mathematics and Visualization | 2009-12-11 | Paper |
Manifold reconstruction in arbitrary dimensions using witness complexes
Discrete & Computational Geometry | 2009-07-06 | Paper |
| scientific article; zbMATH DE number 5542491 (Why is no real title available?) | 2009-04-14 | Paper |
Locally uniform anisotropic meshing
Proceedings of the twenty-fourth annual symposium on Computational geometry | 2009-02-12 | Paper |
Manifold reconstruction in arbitrary dimensions using witness complexes
Proceedings of the twenty-third annual symposium on Computational geometry - SCG '07 | 2009-02-12 | Paper |
Visualizing bregman voronoi diagrams
Proceedings of the twenty-third annual symposium on Computational geometry - SCG '07 | 2009-02-12 | Paper |
| scientific article; zbMATH DE number 5506225 (Why is no real title available?) | 2009-02-10 | Paper |
Anisotropic diagrams: Labelle Shewchuk approach revisited
Theoretical Computer Science | 2008-12-12 | Paper |
Isotopic implicit surface meshing
Discrete & Computational Geometry | 2008-04-16 | Paper |
| Meshing of surfaces | 2007-06-19 | Paper |
| Curved Voronoi diagrams | 2007-06-19 | Paper |
Learning smooth shapes by probing
Computational Geometry | 2007-03-15 | Paper |
Algorithms – ESA 2005
Lecture Notes in Computer Science | 2006-06-27 | Paper |
| Voronoi diagrams, triangulations and surfaces | 2006-04-28 | Paper |
Provably good sampling and meshing of surfaces
Graphical Models | 2005-11-01 | Paper |
COMPUTING LARGEST CIRCLES SEPARATING TWO SETS OF SEGMENTS
International Journal of Computational Geometry & Applications | 2005-06-10 | Paper |
A linear bound on the complexity of the Delaunay triangulation of points on polyhedral surfaces
Discrete & Computational Geometry | 2004-12-16 | Paper |
A Polynomial-Time Algorithm for Computing Shortest Paths of Bounded Curvature Amidst Moderate Obstacles
International Journal of Computational Geometry & Applications | 2004-09-29 | Paper |
COMPUTING THE DIAMETER OF A POINT SET
International Journal of Computational Geometry & Applications | 2004-09-29 | Paper |
| scientific article; zbMATH DE number 2087464 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 2080230 (Why is no real title available?) | 2004-08-04 | Paper |
| scientific article; zbMATH DE number 2080091 (Why is no real title available?) | 2004-08-04 | Paper |
| scientific article; zbMATH DE number 2079353 (Why is no real title available?) | 2004-07-28 | Paper |
Complexity of the Delaunay triangulation of points on polyhedral surfaces
Discrete & Computational Geometry | 2004-07-07 | Paper |
Slicing Minkowski sums for satellite antenna layout.
CAD. Computer-Aided Design | 2003-09-24 | Paper |
An algorithm for computing a convex and simple path of bounded curvature in a simple polygon
Algorithmica | 2002-09-25 | Paper |
Natural neighbor coordinates of points on a surface
Computational Geometry | 2002-06-26 | Paper |
Triangulations in CGAL
Computational Geometry | 2002-06-24 | Paper |
Smooth surface reconstruction via natural neighbour interpolation of distance functions
Computational Geometry | 2002-06-24 | Paper |
Circular separability of polygons
Algorithmica | 2002-05-14 | Paper |
An elementary algorithm for reporting intersections of red/blue curve segments
Computational Geometry | 2002-03-14 | Paper |
Efficient algorithms for line and curve segment intersection using restricted predicates
Computational Geometry | 2001-04-09 | Paper |
Motion Planning of Legged Robots
SIAM Journal on Computing | 2000-10-18 | Paper |
Robust Plane Sweep for Intersecting Segments
SIAM Journal on Computing | 2000-03-19 | Paper |
Convex tours of bounded curvature
Computational Geometry | 2000-01-17 | Paper |
Shortest plane paths with bounded derivative of the curvature
Comptes Rendus de l'Académie des Sciences - Series I - Mathematics | 1999-01-01 | Paper |
| scientific article; zbMATH DE number 1220053 (Why is no real title available?) | 1998-11-08 | Paper |
Voronoi diagrams in higher dimensions under certain polyhedral distance functions
Discrete & Computational Geometry | 1998-06-11 | Paper |
Evaluating signs of determinants using single-precision arithmetic
Algorithmica | 1997-06-30 | Paper |
| scientific article; zbMATH DE number 797427 (Why is no real title available?) | 1997-04-23 | Paper |
Shortest paths of bounded curvature in the plane
Journal of Intelligent & Robotic Systems | 1997-03-25 | Paper |
An algorithm for constructing the convex hull of a set of spheres in dimension \(d\)
Computational Geometry | 1996-11-04 | Paper |
| scientific article; zbMATH DE number 910883 (Why is no real title available?) | 1996-08-22 | Paper |
On-line construction of the upper envelope of triangles and surface patches in three dimensions
Computational Geometry | 1996-07-14 | Paper |
OUTPUT SENSITIVE CONSTRUCTION OF THE DELAUNAY TRIANGULATION OF POINTS LYING IN TWO PLANES
International Journal of Computational Geometry & Applications | 1996-06-04 | Paper |
MOTION PLANNING OF LEGGED ROBOTS: THE SPIDER ROBOT PROBLEM
International Journal of Computational Geometry & Applications | 1996-02-26 | Paper |
| scientific article; zbMATH DE number 797430 (Why is no real title available?) | 1996-01-17 | Paper |
| scientific article; zbMATH DE number 432983 (Why is no real title available?) | 1993-12-07 | Paper |
A semidynamic construction of higher-order Voronoi diagrams and its randomized analysis
Algorithmica | 1993-06-29 | Paper |
On the randomized construction of the Delaunay tree
Theoretical Computer Science | 1993-05-24 | Paper |
Applications of random sampling to on-line algorithms in computational geometry
Discrete & Computational Geometry | 1992-09-27 | Paper |
Probing a scene of nonconvex polyhedra
Algorithmica | 1992-09-27 | Paper |
COMPUTING THE UNION OF 3-COLORED TRIANGLES
International Journal of Computational Geometry & Applications | 1992-06-27 | Paper |
An optimal algorithm for the boundary of a cell in a union of rays - Corrigendum
Algorithmica | 1991-01-01 | Paper |
Representing stereo data with the Delaunay triangulation
Artificial Intelligence | 1990-01-01 | Paper |
Non-convex contour reconstruction
Journal of Symbolic Computation | 1990-01-01 | Paper |
An optimal algorithm for the boundary of a cell in a union of rays
Algorithmica | 1990-01-01 | Paper |
Polygon placement under translation and rotation
RAIRO - Theoretical Informatics and Applications | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4051003 (Why is no real title available?) | 1988-01-01 | Paper |
