ISOSRF—an algorithm for plotting Iso-valued surfaces of a function of three variables
- 1 August 1979
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGGRAPH Computer Graphics
- Vol. 13 (2) , 182-189
- https://doi.org/10.1145/965103.807442
Abstract
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.Keywords
This publication has 7 references indexed in Scilit:
- Scalar- and planar-valued curve fitting using splines under tensionCommunications of the ACM, 1974
- Visible surface plotting programCommunications of the ACM, 1974
- A constructive geometry for computer graphicsThe Computer Journal, 1973
- A Two-Space Solution to the Hidden Line Problem for Plotting Functions of Two VariablesIEEE Transactions on Computers, 1973
- Algorithm 420: hidden-line plotting program [J6]Communications of the ACM, 1972
- A Solution to the Hidden-Line Problem for Computer-Drawn PolyhedraIEEE Transactions on Computers, 1970
- The Perspective Representation of Functions of Two VariablesJournal of the ACM, 1968