A decomposable algorithm for contour surface display generation
Loading...
Authors
Zyda, Michael J.
Subjects
Advisors
Date of Issue
1984-08
Date
1984-08
Publisher
Monterey, California. Naval Postgraduate School
Language
en_US
Abstract
This paper is 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. A model for the operations used to generate the contour lines for a single subgrid is developed. The inadequacies of the currently published algorithms, with respect to contour line generation for a subgrid, are pointed out in a brief review of the available literature. 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, and the completeness of an algorithm based upon the contouring tree, within the constraints of the contouring model are shown
Type
Technical Report
Description
Series/Report No
Department
Computer Science
Identifiers
NPS Report Number
NPS-52-84-011
Sponsors
Prepared for: Chief of Naval Research, Arlington, VA 22217.
Funder
N0001484WR41001
Format
13 p. : ill. ; 28 cm.
Citation
Distribution Statement
Approved for public release; distribution is unlimited.