• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 1
  • Tagged with
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

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

Konrath, Edwin John January 1980 (has links)
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.

Page generated in 0.2052 seconds