CLIPPING AND CAPPING ALGORITHM FOR AN N-SIDED POLYHEDRAL FINITE ELEMENT

Persistent Link:
http://hdl.handle.net/10150/282193
Title:
CLIPPING AND CAPPING ALGORITHM FOR AN N-SIDED POLYHEDRAL FINITE ELEMENT
Author:
Konrath, Edwin John
Issue Date:
1980
Publisher:
The University of Arizona.
Rights:
Copyright © is held by the author. Digital access to this material is made possible by the University Libraries, University of Arizona. Further transmission, reproduction or presentation (such as public display or performance) of protected items is prohibited except with permission of the author.
Abstract:
A computer algorithm is developed for clipping and capping N-sided polyhedra with arbitrary planes. The algorithm is then expanded to include the processing of general two and three dimensional geometric finite element model data. Data processing is included for the transformation of original model results to match the clipped and capped graphical display model. The algorithms are implemented in a FORTRAN program that may be directly substituted into the MOVIE.BYU/ARIZONA graphics system. The new SECTION program maintains all the functions of the original version while incorporating several major new features. These new features include the expansion of the geometric library to two and three dimensional elements and two new general forms for polygons and polyhedra. Another significant change in the processing is the implementation of the reentrant clipping and capping routines. This feature permits a previously clipped model to be clipped again and again by new and different clipping planes. The above features as well as enhanced input data schemes including a preliminary interface to NASTRAN are offered as a skeleton for future modifications. The major routines in the program have taken advantage of dynamic memory allocation via FORTRAN subroutine argument calls. Through this latter feature new capability can be concatenated to the end of the current processing in a prototype manner for rapid implementation and exploration.
Type:
text; Dissertation-Reproduction (electronic)
Keywords:
Computer graphics.; Polyhedra -- Data processing.; Finite element method -- Data processing.
Degree Name:
Ph.D.
Degree Level:
doctoral
Degree Program:
Graduate College; Civil Engineering and Engineering Mechanics
Degree Grantor:
University of Arizona
Advisor:
Stephenson, Michael B.

Full metadata record

DC FieldValue Language
dc.language.isoen_USen_US
dc.titleCLIPPING AND CAPPING ALGORITHM FOR AN N-SIDED POLYHEDRAL FINITE ELEMENTen_US
dc.creatorKonrath, Edwin Johnen_US
dc.contributor.authorKonrath, Edwin Johnen_US
dc.date.issued1980en_US
dc.publisherThe University of Arizona.en_US
dc.rightsCopyright © is held by the author. Digital access to this material is made possible by the University Libraries, University of Arizona. Further transmission, reproduction or presentation (such as public display or performance) of protected items is prohibited except with permission of the author.en_US
dc.description.abstractA computer algorithm is developed for clipping and capping N-sided polyhedra with arbitrary planes. The algorithm is then expanded to include the processing of general two and three dimensional geometric finite element model data. Data processing is included for the transformation of original model results to match the clipped and capped graphical display model. The algorithms are implemented in a FORTRAN program that may be directly substituted into the MOVIE.BYU/ARIZONA graphics system. The new SECTION program maintains all the functions of the original version while incorporating several major new features. These new features include the expansion of the geometric library to two and three dimensional elements and two new general forms for polygons and polyhedra. Another significant change in the processing is the implementation of the reentrant clipping and capping routines. This feature permits a previously clipped model to be clipped again and again by new and different clipping planes. The above features as well as enhanced input data schemes including a preliminary interface to NASTRAN are offered as a skeleton for future modifications. The major routines in the program have taken advantage of dynamic memory allocation via FORTRAN subroutine argument calls. Through this latter feature new capability can be concatenated to the end of the current processing in a prototype manner for rapid implementation and exploration.en_US
dc.typetexten_US
dc.typeDissertation-Reproduction (electronic)en_US
dc.subjectComputer graphics.en_US
dc.subjectPolyhedra -- Data processing.en_US
dc.subjectFinite element method -- Data processing.en_US
thesis.degree.namePh.D.en_US
thesis.degree.leveldoctoralen_US
thesis.degree.disciplineGraduate Collegeen_US
thesis.degree.disciplineCivil Engineering and Engineering Mechanicsen_US
thesis.degree.grantorUniversity of Arizonaen_US
dc.contributor.advisorStephenson, Michael B.en_US
dc.identifier.proquest8017798en_US
dc.identifier.oclc7618066en_US
dc.identifier.bibrecord.b13469496en_US
All Items in UA Campus Repository are protected by copyright, with all rights reserved, unless otherwise indicated.