Paper Info
Title
A decomposable algorithm for contour surface display generation
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.
Year
DOI
Venue
1988
10.1145/42458.42461
ACM Trans. Graph.
Keywords
Field
DocType
contouring tree,contouring tree algorithm,contour line,two-dimensional contouring algorithm,decomposable algorithm,new algorithm,contour surface display generation,data structure,general terms: algorithms additional key words and phrases: contouring,larger grid,core component,contour surface display,intuitive procedure
Computer vision,Parallel generation,Algorithm,Surface display,Core component,Artificial intelligence,Contouring,Mathematics
Journal
Volume
Issue
ISSN
7
2
0730-0301
Citations 
PageRank 
References 
0
0.34
11
Authors
1
Name
Order
Citations
PageRank
Michael Zyda1927149.60