“ISOSRF—an algorithm for plotting Iso-valued surfaces of a function of three variables” by Wright and Humbrecht

Given a three-dimensional array containing values of a function of three variables, the algorithm presented here draws an approximation of the surface or surfaces where the function attains a specified value. This is done by contouring two-dimensional subsets of the three-dimensional array and suppressing the invisible parts of the contours. The union of all the contour line parts approximates the desired surface. The suppression of the invisible lines is the most complicated part of the algorithm and is done by forming a silhouette of the processed subset of the array and testing lines against this structure.

1. Cline, A., “Scalar and planar-valued curve fitting using splines under tension.” Comm ACM, 17, 4 (April 1974) pp 218-223.
2. Kubert, B., Szabo, J., and Giulieri, S., “The perspective representation of functions of two variables.” Jnl ACM, 15,2 (April 1968) pp 193-204.
3. Loutrel, p., “A solution to the hidden-line problem for computer drawn polyhedra.” IEEE Trans Comp, C-19, 3 (March 1970) pp 205-213.
4. Ricci, A., “A constructive geometry for computer graphics.” Comp Jnl, 16,2 (May 1973) pp 157-160.
5. Schweikert, D., “An interpolation curve using a spline in tension.” Jnl Math and physics, 45, 3 (September 1966) pp 312-317.
6. Warnock, J., “A hidden-line algorithm for halftone picture representation.” Dept. Comp. Sci., Univ. Utah, Tech. Rep. 4-5, May 1968.
7. Watkins, G., “A real-time visible surface algorithm.” Ph.D. dissertation, Dept. Comp. Sci., Univ. Utah, June 1970.
8. Williamson, H., “Hidden-line plotting program.” Comm ACM, 15, 2 (February 1972) pp 100-103.
9. Wright, T., “A two-space solution to the hidden line problem for plotting functions of two variables.” IEEE Trans Comp, C-22, 1 (January 1973) pp 28-33.
10. Wright, T., “A one pass hidden line remover for computer drawn three-space objects.” Proc 1972 Summer Simulation Conference, pp 261-267.
11. Wright, T., “Visible surface plotting program.” Comm ACM, 17, 3 (March 1972) pp 152-155.