A decomposable algorithm for contour surface display generation - Info and Reading Options

The Open Library:

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.

Search for “A decomposable algorithm for contour surface display generation” downloads:

Visit our Downloads Search page to see if downloads are available.

Borrow "A decomposable algorithm for contour surface display generation" Online:

Check on the availability of online borrowing. Please note that online borrowing has copyright-based limitations and that the quality of ebooks may vary.

• Is Online Borrowing Available: Yes
• Preview Status: full
• Check if available: The Open Library & The Internet Archive

Find “A decomposable algorithm for contour surface display generation” in Libraries Near You:

Read or borrow “A decomposable algorithm for contour surface display generation” from your local library.

• The WorldCat Libraries Catalog: Find a copy of “A decomposable algorithm for contour surface display generation” at a library near you.