{"id":{"repo_id":"unlv","oai_identifier":"oai:oasis.library.unlv.edu:rtds-1101"},"canonical_url":"https://search.dev.ndltd.org/etd/unlv/oai:oasis.library.unlv.edu:rtds-1101","repository":{"repo_id":"unlv","name":"University of Nevada - Las Vegas","base_url":"https://oasis.library.unlv.edu/do/oai/"},"display":{"title":"A data structural approach to the problem of contour plotting","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.).","abstract_html":"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.).","abstract_has_math":false,"creators":["Pradhaan, Sivesh"],"institution":"University of Nevada, Las Vegas","degree_name":"Master of Science (MS)","degree_level":"Thesis","degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":[],"advisors":[],"committee_chairs":[],"committee_members":[],"year":1990,"date_issued":"1990-01-01T08:00:00Z","date_published":"1990-01-01T08:00:00Z","updated_at":"2026-07-24T05:24:07Z","subjects":[],"languages":["English"],"rights":["IN COPYRIGHT. For more information about this rights statement, please visit http://rightsstatements.org/vocab/InC/1.0/"],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["https://oasis.library.unlv.edu/rtds/102"],"render_values":[{"text":"https://oasis.library.unlv.edu/rtds/102","href":"https://oasis.library.unlv.edu/rtds/102","code":true}]}]},"links":{"outbound_url":"https://doi.org/10.25669/nwjk-bvp9","outbound_label":"DOI","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:creator","label":"Author","values":["Pradhaan, Sivesh"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:publisher","label":"Institution","values":["University of Nevada, Las Vegas"]},{"key":"dc:type","label":"Dc Type","values":["Text"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer Science"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Master of Science (MS)"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["English"]},{"key":"dc:rights","label":"Dc Rights","values":["IN COPYRIGHT. For more information about this rights statement, please visit http://rightsstatements.org/vocab/InC/1.0/"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["10.25669/nwjk-bvp9","https://oasis.library.unlv.edu/rtds/102","https://oasis.library.unlv.edu/context/rtds/article/1101/viewcontent/uc.pdf"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["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.)."]},{"key":"dc:format","label":"Dc Format","values":["pdf"]},{"key":"dc:title","label":"Title","values":["A data structural approach to the problem of contour plotting"]}]}],"canonical_facts":{"dc:creator":["Pradhaan, Sivesh"],"dc:description.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.)."],"dc:format":["pdf"],"dc:identifier":["10.25669/nwjk-bvp9","https://oasis.library.unlv.edu/rtds/102","https://oasis.library.unlv.edu/context/rtds/article/1101/viewcontent/uc.pdf"],"dc:language":["English"],"dc:publisher":["University of Nevada, Las Vegas"],"dc:rights":["IN COPYRIGHT. For more information about this rights statement, please visit http://rightsstatements.org/vocab/InC/1.0/"],"dc:title":["A data structural approach to the problem of contour plotting"],"dc:type":["Text"],"thesis:degree_discipline":["Computer Science"],"thesis:degree_level":["Thesis"],"thesis:degree_name":["Master of Science (MS)"]},"updated_at":"2026-07-24T05:24:07Z"}