Show simple item record

dc.contributor.advisorStephenson, Michael B.en_US
dc.contributor.authorKonrath, Edwin John
dc.creatorKonrath, Edwin Johnen_US
dc.date.accessioned2013-04-18T09:34:49Z
dc.date.available2013-04-18T09:34:49Z
dc.date.issued1980en_US
dc.identifier.urihttp://hdl.handle.net/10150/282193
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.
dc.language.isoen_USen_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.subjectComputer graphics.en_US
dc.subjectPolyhedra -- Data processing.en_US
dc.subjectFinite element method -- Data processing.en_US
dc.titleCLIPPING AND CAPPING ALGORITHM FOR AN N-SIDED POLYHEDRAL FINITE ELEMENTen_US
dc.typetexten_US
dc.typeDissertation-Reproduction (electronic)en_US
dc.identifier.oclc7618066en_US
thesis.degree.grantorUniversity of Arizonaen_US
thesis.degree.leveldoctoralen_US
dc.identifier.proquest8017798en_US
thesis.degree.disciplineGraduate Collegeen_US
thesis.degree.disciplineCivil Engineering and Engineering Mechanicsen_US
thesis.degree.namePh.D.en_US
dc.identifier.bibrecord.b13469496en_US
refterms.dateFOA2018-06-18T06:22:08Z
html.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.


Files in this item

Thumbnail
Name:
azu_td_8017798_sip1_m.pdf
Size:
3.465Mb
Format:
PDF

This item appears in the following Collection(s)

Show simple item record