Manifold reconstruction using tangential Delaunay complexes
From MaRDI portal
Recommendations
- Manifold reconstruction using tangential Delaunay complexes
- Manifold reconstruction from point samples
- Stability and minimax optimality of tangential Delaunay complexes for manifold reconstruction
- Delaunay triangulation of manifolds
- Manifold reconstruction in arbitrary dimensions using witness complexes
Cites work
- A SIMPLE ALGORITHM FOR HOMEOMORPHIC SURFACE RECONSTRUCTION
- An optimal algorithm for constructing the weighted Voronoi diagram in the plane
- An optimal convex hull algorithm in any fixed dimension
- Applications of random sampling in computational geometry. II
- Bregman Voronoi diagrams
- Convergence of curvatures in secant approximations
- Curvature Measures
- Curve and Surface Reconstruction
- Discrete laplace operator on meshed surfaces
- Finding the homology of submanifolds with high confidence from random samples
- Generating well-shaped \(d\)-dimensional Delaunay meshes.
- Hessian eigenmaps: Locally linear embedding techniques for high-dimensional data
- scientific article; zbMATH DE number 425858 (Why is no real title available?)
- scientific article; zbMATH DE number 3136785 (Why is no real title available?)
- scientific article; zbMATH DE number 1220053 (Why is no real title available?)
- scientific article; zbMATH DE number 3016052 (Why is no real title available?)
- scientific article; zbMATH DE number 2119739 (Why is no real title available?)
- scientific article; zbMATH DE number 3246034 (Why is no real title available?)
- scientific article; zbMATH DE number 3280855 (Why is no real title available?)
- scientific article; zbMATH DE number 3401836 (Why is no real title available?)
- Locally uniform anisotropic meshing
- Manifold reconstruction from point samples
- Manifold reconstruction in arbitrary dimensions using witness complexes
- On the local behavior of spaces of natural images
- Power Diagrams: Properties, Algorithms and Applications
- Principal Manifolds and Nonlinear Dimensionality Reduction via Tangent Space Alignment
- PROVABLE DIMENSION DETECTION USING PRINCIPAL COMPONENT ANALYSIS
- Shape dimension and intrinsic metric from samples of manifolds
- Silver exudation
- Smooth manifold reconstruction from noisy and non-uniform approximation with guarantees
- Some properties of invariant sets of a flow
- Star splaying
- Surface reconstruction by Voronoi filtering
- The stability of Delaunay triangulations
- Towards persistence-based reconstruction in euclidean spaces
Cited in
(48)- Stability and minimax optimality of tangential Delaunay complexes for manifold reconstruction
- Nonlinear multi-output regression on unknown input manifold
- Manifold construction over polyhedral mesh
- Only distances are required to reconstruct submanifolds
- Nonasymptotic rates for manifold, tangent space and curvature estimation
- Delaunay triangulation of manifolds
- Shape dimension and intrinsic metric from samples of manifolds
- Triangulating submanifolds: an elementary and quantified version of Whitney's method
- Local conditions for triangulating submanifolds of Euclidean space
- Minimax adaptive estimation in manifold inference
- The numerical algebraic geometry of bottlenecks
- Manifold reconstruction and denoising from scattered data in high dimension
- Solution manifold and its statistical applications
- The topological correctness of PL approximations of isomanifolds
- Manifold approximation by moving least-squares projection (MMLS)
- 2-manifold tests for 3D Delaunay triangulation-based surface reconstruction
- Local criteria for triangulating general manifolds
- Recovering the homology of immersed manifolds
- Manifold reconstruction from point samples
- Delaunay stability via perturbations
- Fixed points of the restricted Delaunay triangulation operator
- Tangent estimation from point samples
- scientific article; zbMATH DE number 2062540 (Why is no real title available?)
- The bottleneck degree of algebraic varieties
- Local criteria for triangulation of manifolds
- How much geometry it takes to reconstruct a 2-manifold in \(\mathbb{R}^3\)
- Shape dimension and intrinsic metric from samples of manifolds with high co-dimension (extended abstract)
- Implicit manifold reconstruction
- Manifold reconstruction using tangential Delaunay complexes
- How much geometry it takes to reconstruct a 2-manifold in \(\mathbb{R}^{3}\)
- Computational Science - ICCS 2004
- Tracing Isomanifolds in \(\mathbb{R}\) d in Time Polynomial in d using Coxeter–Freudenthal–Kuhn Triangulations
- A deep network construction that adapts to intrinsic dimensionality beyond the domain
- Adversarial manifold estimation
- Optimal reach estimation and metric learning
- Reconstruction of manifold embeddings into Euclidean spaces via intrinsic distances
- Manifold evolution with tangential redistribution of points
- Delaunay-like triangulation of smooth orientable submanifolds by \(\ell_1\)-norm minimization
- Minimax boundary estimation and estimation with boundary
- Delaunay-like triangulation of smooth orientable submanifolds by _1-norm minimization
- Inner and outer approximation of the image of a set by a nonlinear function
- Wrapping cycles in Delaunay complexes: bridging persistent homology and discrete Morse theory
- Estimating the convex hull of the image of a set with smooth boundary: error bounds and applications
- Estimation of local geometric structure on manifolds from noisy data
- Manifold fitting under unbounded noise
- Tracing isomanifolds in \(\mathbb{R}^d\) in time polynomial in \(d\) using Coxeter-Freudenthal-Kuhn triangulations
- Restricted constrained Delaunay triangulations
- Riemannian simplices and triangulations
This page was built for publication: Manifold reconstruction using tangential Delaunay complexes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2441577)
