Tracing Isomanifolds in R d in Time Polynomial in d using Coxeter–Freudenthal–Kuhn Triangulations
From MaRDI portal
Publication:5890033
Recommendations
- The topological correctness of PL approximations of isomanifolds
- The computation of simplicial approximations of implicitly defined two- dimensional manifolds
- Triangulating smooth submanifolds with light scaffolding
- Isotopic implicit surface meshing
- Simplicial isosurfacing in arbitrary dimension and codimension
Cites work
- A course in triangulations for solving equations with deformations
- An Algorithm for Piecewise-Linear Approximation of an Implicitly Defined Manifold
- Building efficient and compact data structures for simplicial complexes
- Coxeter triangulations have good quality
- Efficient data structure for representing and simplifying simplicial complexes in high dimensions
- Estimates for piecewise linear approximations of implicitly defined manifolds
- Geometric and topological inference
- scientific article; zbMATH DE number 1713119 (Why is no real title available?)
- scientific article; zbMATH DE number 3136785 (Why is no real title available?)
- scientific article; zbMATH DE number 42440 (Why is no real title available?)
- scientific article; zbMATH DE number 47206 (Why is no real title available?)
- scientific article; zbMATH DE number 53657 (Why is no real title available?)
- scientific article; zbMATH DE number 65167 (Why is no real title available?)
- scientific article; zbMATH DE number 1220053 (Why is no real title available?)
- scientific article; zbMATH DE number 731846 (Why is no real title available?)
- scientific article; zbMATH DE number 1506516 (Why is no real title available?)
- scientific article; zbMATH DE number 2123480 (Why is no real title available?)
- Implicit Curves and Surfaces: Mathematics, Data Structures and Algorithms
- Isosurfaces. Geometry, topology, and algorithms
- Iterative Solution of Nonlinear Equations in Several Variables
- Lectures on Polytopes
- Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations
- Manifold reconstruction from point samples
- Manifold reconstruction using tangential Delaunay complexes
- On stirling numbers of the second kind
- Polynomial-sized topological approximations using the permutahedron
- Simplicial isosurfacing in arbitrary dimension and codimension
- Simplizialzerlegungen von beschränkter Flachheit
- The computation of fixed points and applications
- The topological correctness of PL approximations of isomanifolds
- Tighter bounds for random projections of manifolds
- Triangulating submanifolds: an elementary and quantified version of Whitney's method
- What happens to a manifold under a bi-Lipschitz map?
Cited in
(2)
This page was built for publication: Tracing Isomanifolds in \(\mathbb{R}\) d in Time Polynomial in d using Coxeter–Freudenthal–Kuhn Triangulations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5890033)