A generalized combinatorial marching hypercube algorithm
From MaRDI portal
Publication:6537158
DOI10.1007/s40314-024-02627-4MaRDI QIDQ6537158
Marcio Gameiro, Guilherme Nakassima, Antonio Castelo, Lucas Moutinho Bueno
Publication date: 14 May 2024
Published in: Computational and Applied Mathematics (Search for Journal in Brave)
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical approximation of high-dimensional functions; sparse grids (65D40)
Cites Work
- Unnamed Item
- Unnamed Item
- Computation of smooth manifolds via rigorous multi-parameter continuation in infinite dimensions
- Polygonization of implicit surfaces
- The computation of simplicial approximations of implicitly defined \(p\)-dimensional manifolds
- Simplicial isosurfacing in arbitrary dimension and codimension
- Discrete groups generated by reflections.
- Simplizialzerlegungen von beschränkter Flachheit
- Implicit Curves and Surfaces: Mathematics, Data Structures and Algorithms
- Simplicial and Continuation Methods for Approximating Fixed Points and Solutions to Systems of Equations
- The Approximation of Fixed Points of a Continuous Mapping
- SIMPLICIAL APPROXIMATION OF FIXED POINTS
- 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
