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]

Ambiguous cases often occur if diagonally opposing points are found on the same side of the isoline, but on a different side to the other points in the square (for 2D systems) or cube (for 3D systems).[3] In a 2D case this means that there are two possibilities. If we suppose that we mark the corners as positive if their value is greater than that of the isoline, or negative if it is less, then either the positive corners are separated by two isolines, or the positive corners are in the main section of the square and the negative corners are separated by two isolines. The correct situation depends on the value at the asymptote of the isolines. Isolines are hyperbolae which can be described using the following formula:

${\displaystyle f(\alpha ,\beta )=\gamma (\alpha -\alpha _{0})(\beta -\beta _{0})+\delta }$

where ${\displaystyle \alpha }$ is the normalised distance in the square from the left-hand side, and ${\displaystyle \beta }$ is the normalised distance in the square from the bottom. The values ${\displaystyle \alpha _{0}}$ and ${\displaystyle \beta _{0}}$ are therefore the coordinates of the asymptotes, and ${\displaystyle \delta }$ is the value at the position ${\displaystyle (\alpha ,\beta )}$. This point ought to belong to the section which contains two corners. Therefore, if ${\displaystyle \delta }$ is greater than the value of the isoline the positive corners are in the main section of the square and the negative corners are separated by two isolines, and if ${\displaystyle \delta }$ is less than the value of isoline the negative corners are in the main section of the square and the positive corners are separated by two isolines.[4] A similar solution is used the 3D version.

See also

• Isosurface
• Marching cubes

 Science portal

References

Notes

1. Nielson & Hamann 1991, p. 83.
2. Seng et al. 2005, abstract. "The asymptotic decider algorithm was employed to solve the ambiguity problem associated with the MC algorithm."
3. Nielson & Hamann 1991, p. 84.
4. Nielson & Hamann 1991, p. 85.

Bibliography

• Nielson, Gregory M.; Hamann, Bernd (1991). Nielson, Gregory M.; Rosenblum, Larry (eds.). The asymptotic decider: resolving the ambiguity in marching cubes. Proceedings of the 2nd conference on Visualization '91 (VIS '91). Los Alamitos, CA: IEEE Computer Society. pp. 83–91. ISBN 978-0-8186-2245-8.CS1 maint: ref=harv (link)
• Seng Dewen; Li Zhongxue; Li Cuiping; Li Chumin (2005). "Application of marching cubes algorithm in visualization of mineral deposits". Journal of Beijing University of Science and Technology (English Edition). 12 (3). Abstract.

Further reading

• Charles D. Hansen; Chris R. Johnson (2004). Visualization Handbook. Academic Press. pp. 7–12. ISBN 978-0-12-387582-2.
• A. Lopes; K. Bordlie (2005). "Interactive approaches to contouring and isosurfaces for geovisualization". In Jason Dykes; Alan M. MacEachren; M. J. Kraak (eds.). Exploring Geovisualization. Elsevier. pp. 352–353. ISBN 978-0-08-044531-1.