Simplicial isosurfacing in arbitrary dimension and codimension (Q1408435)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1981548
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Simplicial isosurfacing in arbitrary dimension and codimension |
scientific article; zbMATH DE number 1981548 |
Statements
Simplicial isosurfacing in arbitrary dimension and codimension (English)
0 references
15 September 2003
0 references
An efficient isosurfacing algorithm that works in an arbitrary number of dimensions and codimensions is introduced. The simplicial interpolation algorithm is briefly reviewed, the triangulation tables of the intersection of a simplex and a hyperplane are given, and a counting theorem is stated to prove the optimality of the tables. A visualisation of the projected isosurface in discussed. A dyadic grid is introduced to reduce the numerical costs. Numerical examples are constructed by the proposed isosurface algorithm.
0 references
isosurface
0 references
simplicial interpolant
0 references
discrete function
0 references
surface visualization
0 references
algorithm
0 references
triangulation
0 references
dyadic grid
0 references
numerical examples
0 references
0 references
0.7562991976737976
0 references
0.7504187226295471
0 references
0.738178014755249
0 references
0.7271409034729004
0 references
