Award Date

1-1-1990

Degree Type

Thesis

Degree Name

Master of Science (MS)

Department

Computer Science

Number of Pages

71

Abstract

This paper describes the results of a research on the problem of contouring an estimated surface. It takes a data structural approach to the problem and also uses a special logic developed to make parallelism possible. This algorithm draws all the contour curves at the same time. The data structure used by this algorithm is described in detail here; Intersection points are connected by examining the orientation of the corresponding face used to represent that patch of the estimated surface. The total number of intersections with a contour plane in a cell and the presence of horizontal lines in a face is also used to guide the plotter. The logic developed for connecting the points of intersections in a cell is also described in detail. The computer programs which implement these concepts are included in the appendix. (Abstract shortened with permission of author.).

Keywords

Approach; Contour; Data; Plotting; Problem; Structural

Controlled Subject

Computer science; Mathematics

File Format

pdf

File Size

1454.08 KB

Degree Grantor

University of Nevada, Las Vegas

Language

English

Permissions

If you are the rightful copyright holder of this dissertation or thesis and wish to have the full text removed from Digital Scholarship@UNLV, please submit a request to digitalscholarship@unlv.edu and include clear identification of the work, preferably with URL.

Identifier

https://doi.org/10.25669/nwjk-bvp9


Share

COinS