A generalized combinatorial marching hypercube algorithm
From MaRDI portal
Recommendations
- Simplicial isosurfacing in arbitrary dimension and codimension
- scientific article; zbMATH DE number 2147455
- Tracing Isomanifolds in \(\mathbb{R}\) d in Time Polynomial in d using Coxeter–Freudenthal–Kuhn Triangulations
- Comparison between the marching-cube and the marching-simplex methods
- Coreduction homology algorithm
Cites work
- Computation of smooth manifolds via rigorous multi-parameter continuation in infinite dimensions
- Discrete groups generated by reflections.
- scientific article; zbMATH DE number 3774548 (Why is no real title available?)
- scientific article; zbMATH DE number 1232476 (Why is no real title available?)
- Implicit Curves and Surfaces: Mathematics, Data Structures and Algorithms
- Polygonization of implicit surfaces
- Simplicial and Continuation Methods for Approximating Fixed Points and Solutions to Systems of Equations
- SIMPLICIAL APPROXIMATION OF FIXED POINTS
- Simplicial isosurfacing in arbitrary dimension and codimension
- Simplizialzerlegungen von beschränkter Flachheit
- The Approximation of Fixed Points of a Continuous Mapping
- The computation of simplicial approximations of implicitly defined \(p\)-dimensional manifolds
- Tracing Isomanifolds in \(\mathbb{R}\) d in Time Polynomial in d using Coxeter–Freudenthal–Kuhn Triangulations
This page was built for publication: A generalized combinatorial marching hypercube algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6537158)