Master of Science (MS)
Number of Pages
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.).
Approach; Contour; Data; Plotting; Problem; Structural
Computer science; Mathematics
University of Nevada, Las Vegas
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 email@example.com and include clear identification of the work, preferably with URL.
Pradhaan, Sivesh, "A data structural approach to the problem of contour plotting" (1990). UNLV Retrospective Theses & Dissertations. 102.
IN COPYRIGHT. For more information about this rights statement, please visit http://rightsstatements.org/vocab/InC/1.0/