Asymptotic decider
In scientific visualization the asymptotic decider is an algorithm developed by Nielson and Hamann in 1991 that creates isosurfaces from a given scalar field. It was proposed as an improvement to the marching cubes algorithm, which can produce some "bad" topology,[1] but can also be considered an algorithm in its own right.[2]
Principle
The algorithm first divides the scalar field into uniform cubes. It draws topologically correct contours on the sides (interface) of the cubes. These contours can then be connected to polygons and triangulated. The triangles of all cubes form the isosurfaces and are thus the output of the algorithm.[1] Sometimes there is more than one way to connect adjacent constructs. This algorithm describes a method for resolving these ambiguous configurations in a consistent manner.[3]
See also
References
- Notes
- ↑ 1.0 1.1 Nielson & Hamann 1991, p. 83.
- ↑ Seng et al. 2005, abstract. "The asymptotic decider algorithm was employed to solve the ambiguity problem associated with the MC algorithm."
- ↑ Nielson & Hamann 1991, p. 84.
- Bibliography
- Lua error in package.lua at line 80: module 'strict' not found.
- Lua error in package.lua at line 80: module 'strict' not found. Abstract.
Further reading
- Lua error in package.lua at line 80: module 'strict' not found.
- Lua error in package.lua at line 80: module 'strict' not found.
<templatestyles src="Asbox/styles.css"></templatestyles>
 |
This computer science article is a stub. You can help Wikipedia by expanding it. |
<templatestyles src="Asbox/styles.css"></templatestyles>
 |
This computer graphics–related article is a stub. You can help Wikipedia by expanding it. |
