A decomposable algorithm for contour surface display generation

Authors:
Michael J. Zyda
Affiliations:
Naval Postgraduate School, Monterey, CA
Venue:
ACM Transactions on Graphics (TOG)
Year:
1988

Citing 8
Cited 0

Marching cubes: A high resolution 3D surface construction algorithm

SIGGRAPH '87 Proceedings of the 14th annual conference on Computer graphics and interactive techniques
Automatic contour map

Communications of the ACM
A contour-map program for x-ray crystallography

Communications of the ACM
Graph Algorithms

Graph Algorithms
An extensible approach to imagery of gridded data

SIGGRAPH '77 Proceedings of the 4th annual conference on Computer graphics and interactive techniques
Automated contour mapping using triangular element data structures and an interpolant over each irregular triangular domain

SIGGRAPH '77 Proceedings of the 4th annual conference on Computer graphics and interactive techniques
ISOSRF—an algorithm for plotting Iso-valued surfaces of a function of three variables

SIGGRAPH '79 Proceedings of the 6th annual conference on Computer graphics and interactive techniques
Algorithm directed architectures for real-time surface display generation

Algorithm directed architectures for real-time surface display generation

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a study of a highly decomposable algorithm useful for the parallel generation of a contour surface display. The core component of this algorithm is a two-dimensional contouring algorithm that operates on a single 2 x 2 subgrid of a larger grid. An intuitive procedure for the operations used to generate the contour lines for a subgrid is developed. A data structure, the contouring tree, is introduced as the basis of a new algorithm for generating the contour lines for the subgrid. The construction of the contouring tree is detailed. Space requirements for the contouring tree algorithm are described for particular implementations.