A sparse Delaunay filtration
From MaRDI portal
Cites work
- A Delaunay Refinement Algorithm for Quality 2-Dimensional Mesh Generation
- A new approach to output-sensitive construction of Voronoi diagrams and Delaunay triangulations
- A simple heuristic for the p-centre problem
- Approximating persistent homology in Euclidean space through collapses
- Beating the spread, time-optimal point meshing
- Clustering to minimize the maximum intercluster distance
- Efficient and robust persistent homology for measures
- Fast Construction of Nets in Low-Dimensional Metrics and Their Applications
- Geometry and topology for mesh generation
- scientific article; zbMATH DE number 3633698 (Why is no real title available?)
- scientific article; zbMATH DE number 1501063 (Why is no real title available?)
- Improved topological approximations by digitization
- Incremental topological flipping works for regular triangulations
- Linear-size approximations to the Vietoris-Rips filtration
- On the shape of a set of points in the plane
- SimBa: an efficient tool for approximating Rips-filtration persistence via simplicial batch-collapse
- The structure and stability of persistence modules
- The union of balls and its dual shape
- Three-Dimensional Triangulations from Local Transformations
- Topological inference via meshing
- Topological persistence and simplification
- Towards persistence-based reconstruction in euclidean spaces
- Transforming triangulations
- Voronoi diagrams and arrangements
- Voronoi Diagrams for Parallel Halflines and Line Segments in Space
- Voronoi diagrams from convex hulls
This page was built for publication: A sparse Delaunay filtration
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7234116)
