Publication | Date of Publication | Type |
---|
Dimensionality Reduction for k-Distance Applied to Persistent Homology | 2023-11-02 | Paper |
Edge Collapse and Persistence of Flag Complexes | 2023-11-02 | Paper |
The Topological Correctness of PL-Approximations of Isomanifolds | 2023-11-02 | Paper |
The reach of subsets of manifolds | 2023-09-18 | Paper |
Tracing Isomanifolds in \(\mathbb{R}\) d in Time Polynomial in d using Coxeter–Freudenthal–Kuhn Triangulations | 2023-04-28 | Paper |
Strong collapse and persistent homology | 2023-03-09 | Paper |
Local criteria for triangulating general manifolds | 2023-01-23 | Paper |
Topological data analysis | 2022-10-07 | Paper |
On the boundary of a union of Rays | 2022-08-16 | Paper |
The topological correctness of PL approximations of isomanifolds | 2022-08-05 | Paper |
Computing Persistent Homology of Flag Complexes via Strong Collapses | 2022-07-18 | Paper |
https://portal.mardi4nfdi.de/entity/Q5075759 | 2022-05-11 | Paper |
Dimensionality reduction for \(k\)-distance applied to persistent homology | 2022-01-10 | Paper |
Local conditions for triangulating submanifolds of Euclidean space | 2021-08-18 | Paper |
Strong Collapse for Persistence | 2021-08-04 | Paper |
Randomized incremental construction of Delaunay triangulations of nice point sets | 2021-07-02 | Paper |
Triangulating submanifolds: an elementary and quantified version of Whitney's method | 2021-07-02 | Paper |
Local criteria for triangulation of manifolds | 2020-08-18 | Paper |
The Reach, Metric Distortion, Geodesic Convexity and the Variation of Tangent Spaces. | 2020-08-18 | Paper |
https://portal.mardi4nfdi.de/entity/Q5111239 | 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 | 2019-09-11 | Paper |
Computing persistent homology with various coefficient fields in a single pass | 2019-09-11 | Paper |
Anisotropic Triangulations via Discrete Riemannian Voronoi Diagrams | 2019-09-02 | Paper |
An Efficient Representation for Filtrations of Simplicial Complexes | 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 | 2018-07-16 | Paper |
Delaunay triangulation of manifolds | 2018-05-18 | Paper |
An obstruction to Delaunay triangulations in Riemannian manifolds | 2018-02-28 | Paper |
Only distances are required to reconstruct submanifolds | 2018-02-12 | Paper |
Incremental construction of the delaunay triangulation and the delaunay graph in medium dimension | 2017-10-20 | Paper |
Anisotropic Delaunay Meshes of Surfaces | 2017-10-20 | Paper |
Learning smooth objects by probing | 2017-10-20 | Paper |
Building efficient and compact data structures for simplicial complexes | 2017-10-10 | Paper |
Building Efficient and Compact Data Structures for Simplicial Complexes | 2017-10-10 | Paper |
Triangulations in CGAL (extended abstract) | 2017-09-29 | Paper |
Smooth surface reconstruction via natural neighbour interpolation of distance functions | 2017-09-29 | Paper |
Complexity of the delaunay triangulation of points on surfaces the smooth case | 2017-09-29 | Paper |
CGALmesh | 2016-10-24 | Paper |
On the complexity of the representation of simplicial complexes by trees | 2016-01-28 | Paper |
The compressed annotation matrix: an efficient data structure for computing persistent cohomology | 2015-11-19 | Paper |
A Probabilistic Approach to Reducing Algebraic Complexity of Delaunay Triangulations | 2015-11-19 | Paper |
An elementary approach to tangent space variation on Riemannian submanifolds | 2015-06-21 | Paper |
Anisotropic Delaunay Mesh Generation | 2015-06-02 | Paper |
DELAUNAY STABILITY VIA PERTURBATIONS | 2015-01-23 | Paper |
The Simplex Tree: An Efficient Data Structure for General Simplicial Complexes | 2015-01-19 | Paper |
https://portal.mardi4nfdi.de/entity/Q2934661 | 2014-12-18 | Paper |
Computing persistent homology with various coefficient fields in a single pass | 2014-10-08 | Paper |
The Gudhi Library: Simplicial Complexes and Persistent Homology | 2014-09-08 | Paper |
THE STABILITY OF DELAUNAY TRIANGULATIONS | 2014-08-11 | Paper |
Stability of Delaunay-type structures for manifolds | 2014-08-07 | Paper |
The Simplex Tree: An Efficient Data Structure for General Simplicial Complexes | 2014-05-14 | Paper |
Geometric tomography with topological guarantees | 2014-04-03 | Paper |
Manifold reconstruction using tangential Delaunay complexes | 2014-04-03 | Paper |
Manifold reconstruction using tangential Delaunay complexes | 2014-03-25 | Paper |
Geometric tomography with topological guarantees | 2014-01-24 | Paper |
The compressed annotation matrix: an efficient data structure for computing persistent cohomology | 2013-09-17 | Paper |
The Simplex Tree: An Efficient Data Structure for General Simplicial Complexes | 2012-09-25 | Paper |
Triangulating smooth submanifolds with light scaffolding | 2012-01-02 | Paper |
Bregman Voronoi diagrams | 2010-09-22 | Paper |
Isotopic implicit surface meshing | 2010-08-15 | Paper |
Stability and Computation of Medial Axes - a State-of-the-Art Report | 2009-12-11 | Paper |
Manifold reconstruction in arbitrary dimensions using witness complexes | 2009-07-06 | Paper |
https://portal.mardi4nfdi.de/entity/Q3619937 | 2009-04-14 | Paper |
Manifold reconstruction in arbitrary dimensions using witness complexes | 2009-02-12 | Paper |
Visualizing bregman voronoi diagrams | 2009-02-12 | Paper |
Locally uniform anisotropic meshing | 2009-02-12 | Paper |
https://portal.mardi4nfdi.de/entity/Q3601557 | 2009-02-10 | Paper |
Anisotropic diagrams: Labelle Shewchuk approach revisited | 2008-12-12 | Paper |
Isotopic implicit surface meshing | 2008-04-16 | Paper |
https://portal.mardi4nfdi.de/entity/Q5292190 | 2007-06-19 | Paper |
https://portal.mardi4nfdi.de/entity/Q5292193 | 2007-06-19 | Paper |
Learning smooth shapes by probing | 2007-03-15 | Paper |
Algorithms – ESA 2005 | 2006-06-27 | Paper |
https://portal.mardi4nfdi.de/entity/Q5290245 | 2006-04-28 | Paper |
Provably good sampling and meshing of surfaces | 2005-11-01 | Paper |
COMPUTING LARGEST CIRCLES SEPARATING TWO SETS OF SEGMENTS | 2005-06-10 | Paper |
A linear bound on the complexity of the Delaunay triangulation of points on polyhedral surfaces | 2004-12-16 | Paper |
COMPUTING THE DIAMETER OF A POINT SET | 2004-09-29 | Paper |
A Polynomial-Time Algorithm for Computing Shortest Paths of Bounded Curvature Amidst Moderate Obstacles | 2004-09-29 | Paper |
https://portal.mardi4nfdi.de/entity/Q4738260 | 2004-08-11 | Paper |
https://portal.mardi4nfdi.de/entity/Q4472298 | 2004-08-04 | Paper |
https://portal.mardi4nfdi.de/entity/Q4472473 | 2004-08-04 | Paper |
https://portal.mardi4nfdi.de/entity/Q4471312 | 2004-07-28 | Paper |
Complexity of the Delaunay triangulation of points on polyhedral surfaces | 2004-07-07 | Paper |
Slicing Minkowski sums for satellite antenna layout. | 2003-09-24 | Paper |
An algorithm for computing a convex and simple path of bounded curvature in a simple polygon | 2002-09-25 | Paper |
Natural neighbor coordinates of points on a surface | 2002-06-26 | Paper |
Triangulations in CGAL | 2002-06-24 | Paper |
Smooth surface reconstruction via natural neighbour interpolation of distance functions | 2002-06-24 | Paper |
Circular separability of polygons | 2002-05-14 | Paper |
An elementary algorithm for reporting intersections of red/blue curve segments | 2002-03-14 | Paper |
Efficient algorithms for line and curve segment intersection using restricted predicates | 2001-04-09 | Paper |
Motion Planning of Legged Robots | 2000-10-18 | Paper |
Robust Plane Sweep for Intersecting Segments | 2000-03-19 | Paper |
Convex tours of bounded curvature | 2000-01-17 | Paper |
Shortest plane paths with bounded derivative of the curvature | 1999-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q4217293 | 1998-11-08 | Paper |
Voronoi diagrams in higher dimensions under certain polyhedral distance functions | 1998-06-11 | Paper |
Evaluating signs of determinants using single-precision arithmetic | 1997-06-30 | Paper |
https://portal.mardi4nfdi.de/entity/Q4848585 | 1997-04-23 | Paper |
Shortest paths of bounded curvature in the plane | 1997-03-25 | Paper |
An algorithm for constructing the convex hull of a set of spheres in dimension \(d\) | 1996-11-04 | Paper |
https://portal.mardi4nfdi.de/entity/Q4886057 | 1996-08-22 | Paper |
On-line construction of the upper envelope of triangles and surface patches in three dimensions | 1996-07-14 | Paper |
OUTPUT SENSITIVE CONSTRUCTION OF THE DELAUNAY TRIANGULATION OF POINTS LYING IN TWO PLANES | 1996-06-04 | Paper |
MOTION PLANNING OF LEGGED ROBOTS: THE SPIDER ROBOT PROBLEM | 1996-02-26 | Paper |
https://portal.mardi4nfdi.de/entity/Q4848590 | 1996-01-17 | Paper |
https://portal.mardi4nfdi.de/entity/Q3139120 | 1993-12-07 | Paper |
A semidynamic construction of higher-order Voronoi diagrams and its randomized analysis | 1993-06-29 | Paper |
On the randomized construction of the Delaunay tree | 1993-05-24 | Paper |
Applications of random sampling to on-line algorithms in computational geometry | 1992-09-27 | Paper |
Probing a scene of nonconvex polyhedra | 1992-09-27 | Paper |
COMPUTING THE UNION OF 3-COLORED TRIANGLES | 1992-06-27 | Paper |
An optimal algorithm for the boundary of a cell in a union of rays - Corrigendum | 1991-01-01 | Paper |
An optimal algorithm for the boundary of a cell in a union of rays | 1990-01-01 | Paper |
Non-convex contour reconstruction | 1990-01-01 | Paper |
Representing stereo data with the Delaunay triangulation | 1990-01-01 | Paper |
Polygon placement under translation and rotation | 1989-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3787492 | 1988-01-01 | Paper |