A data structural approach to the problem of contour plotting

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.).

Name thesis:degree_name

Master of Science (MS)

Level thesis:degree_level

Thesis

Discipline thesis:degree_discipline

Computer Science

Grantor dc:publisher

University of Nevada, Las Vegas

Year

1990

Author dc:creator

• Pradhaan, Sivesh

Statement dc:rights

• IN COPYRIGHT. For more information about this rights statement, please visit http://rightsstatements.org/vocab/InC/1.0/

Language dc:language

English

Identifier

https://oasis.library.unlv.edu/rtds/102

OAI identifier oai:identifier

oai:oasis.library.unlv.edu:rtds-1101