Structural design concepts - Technical brief
Structural design concepts involving transformation of polyhedra and columns for lunar application
SEARCH · Engineering Papers
Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.
Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.
Structural design concepts involving transformation of polyhedra and columns for lunar application
Description of some easily computable textural features based on gray-tone spatial dependances, and illustration of their application in category-identification tasks of three different kinds of image data - namely, photomicrographs of five kinds of sandstones, 1:20,000 panchromatic aerial photographs of eight land-use categories, and ERTS multispectral imagery containing several land-use categories. Two kinds of decision rules are used - one for which the decision regions are convex polyhedra (a piecewise-linear decision rule), and one for which the decision regions are rectangular parallelpipeds (a min-max decision rule). In each experiment the data set was divided into two parts, a training set and a test set. Test set identification accuracy is 89% for the photomicrographs, 82% for the aerial photographic imagery, and 83% for the satellite imagery. These results indicate that the easily computable textural features probably have a general applicability for a wide variety of image-classification applications.
For purposes of geological interpretation, techniques are developed to compute directly the geoid anomaly over models of density within the earth. Ideal bodies such as line segments, vertical sheets, and rectangles are first used to calculate the geoid anomaly. Realistic bodies are modeled with formulas for two-dimensional polygons and three-dimensional polyhedra. By using Fourier transform methods the two-dimensional geoid is seen to be a filtered version of the gravity field, in which the long-wavelength components are magnified and the short-wavelength components diminished.
A method for computation of reflective dihedral symmetry in symmetrical structures under nonsymmetric loads is described. The method makes it possible to confine the analysis to a half, a quarter, or an octagonal segment. The symmetry of elastic deformation is discussed, and antisymmetrical deformation is distinguished from nonsymmetrical deformation. Modes of deformation considered are axial, bending, membrane, and torsional deformation. Examples of one and two dimensional elements are presented and extended to three dimensional elements. The method of setting up a problem within NASTRAN is discussed. The technique is applied to a thick structure having quarter symmetry which was modeled with polyhedra and subjected to five distinct loads having varying degrees of symmetry.
Two special polyhedra present themselves for the definition of B-splines: a simplex S and a box or parallelepiped B, where the edges of S project into an irregular grid, while the edges of B project into the edges of a regular grid. More general splines may be found by forming linear combinations of these B-splines, where the three-dimensional coefficients are called the spline control points. Univariate splines are simplex splines, where s = 1, whereas splines over a regular triangular grid are box splines, where s = 2. Two simple facts render the development of the construction of B-splines: (1) any face of a simplex or a box is again a simplex or box but of lower dimension; and (2) any simplex or box can be easily subdivided into smaller simplices or boxes. The first fact gives a geometric approach to Mansfield-like recursion formulas that express a B-spline in B-splines of lower order, where the coefficients depend on x. By repeated recursion, the B-spline will be expressed as B-splines of order 1; i.e., piecewise constants. In the case of a simplex spline, the second fact gives a so-called insertion algorithm that constructs the new control points if an additional knot is inserted.
Finite element meshes derived automatically from solid models through recursive spatial subdivision schemes (octrees) can be made to inherit the hierarchical structure and the spatial addressability intrinsic to the underlying grid. These two properties, together with the geometric regularity that can also be built into the mesh, make octree based meshes ideally suited for efficient analysis and self-adaptive remeshing and reanalysis. The element decomposition of the octal cells that intersect the boundary of the domain is emphasized. The problem, central to octree based meshing, is solved by combining template mapping and element extraction into a procedure that utilizes both constructive solid geometry and boundary respresentation techniques. Boundary cells that are not intersected by the edge of the domain boundary are easily mapped to predefined element topology. Cells containing edges (and vertices) are first transformed into a planar polyhedron and then triangulated via element extractors. The modeling environments required for the derivation of planar polyhedra and for element extraction are analyzed.
Finite element meshes derived automatically from solid models through recursive spatial subdivision schemes (octrees) can be made to inherit the hierarchical structure and the spatial addressability intrinsic to the underlying grid. These two properties, together with the geometric regularity that can also be built into the mesh, make octree based meshes ideally suited for efficient analysis and self-adaptive remeshing and reanalysis. The element decomposition of the octal cells that intersect the boundary of the domain is discussed. The problem, central to octree based meshing, is solved by combining template mapping and element extraction into a procedure that utilizes both constructive solid geometry and boundary representation techniques. Boundary cells that are not intersected by the edge of the domain boundary are easily mapped to predefined element topology. Cells containing edges (and vertices) are first transformed into a planar polyhedron and then triangulated via element extractor. The modeling environments required for the derivation of planar polyhedra and for element extraction are analyzed.
The objective is to demonstrate discrete extremum methods of structural analysis as a tool for structural system reliability evaluation. Specifically, linear and multiobjective linear programming models for analysis of rigid plastic frames under proportional and multiparametric loadings, respectively, are considered. Kinematic and static approaches for analysis form a primal-dual pair in each of these models and have a polyhedral format. Duality relations link extreme points and hyperplanes of these polyhedra and lead naturally to dual methods for system reliability evaluation.
The structural changes of aragonite and dolomite taking place at high pressures and temperatures were investigated by measuring the Raman spectra of these materials to pressures of 23 and 28 GPa (generated in a diamond anvil cell), respectively; in addition, the IR spectra of aragonite were measured to 40 GPa. The spectroscopic data demonstrated that, at 300 K, dolomite and aragonite samples were stable to pressures of 28 and 41 GPa, respectively. No phase transitions were observed following heating of aragonite and dolomite to temperatures of 2000 K and 800 K, respectively. The mode Grueneisen parameters indicate that the carbonate group in these two minerals is relatively insensitive to pressure, with the dominant compaction mechanism being the compression of the Ca and Mg polyhedra.
Research and development efforts in our research group are focused on the generation of more efficacious biological control agents through the techniques of biotechnology for use against forest insect pests and diseases. Effective biological controls for the gypsy moth and for tree fungal wilt pathogens are under development. The successful use of Gypchek, a formulation of the Lymantria dispar nuclear polyhedrosis virus (LdNPV), in gypsy moth control programs has generated considerable interest in that agent. As a consequence of its specificity, LdPNV has negligible adverse ecological impacts compared to most gypsy moth control agents. However, LdNPV is not competitive with other control agents in terms of cost and efficacy. We are investigating several parameters of LdNPV replication and polyhedra production in order to enhance viral potency and efficacy thus mitigating the current disadvantages of LdNPV for gypsy moth control, and have identified LdNPV variants that will facilitate these efforts. Tree endophytic bacteria that synthesize antifungal compounds were identified and an antibiotic compound from one of these bacteria was characterized. The feasibility of developing tree endophytes as biological control agents for tree vascular fungal pathogens is being investigated.
An efficient method for computing the minimum distance and predicting collisions between moving objects is presented. This problem is incorporated into the framework of an in-line motion-planning algorithm to satisfy collision avoidance between a robot and moving objects modeled as convex polyhedra. In the beginning, the deterministic problem where the information about the objects is assumed to be certain is examined. L(1) or L(infinity) norms are used to represent distance and the problem becomes a linear programming problem. The stochastic problem is formulated where the uncertainty is induced by sensing and the unknown dynamics of the moving obstacles. Two problems are considered: First, filtering of the distance between the robot and the moving object at the present time. Second, prediction of the minimum distance in the future in order to predict the collision time.
An efficient method for computing the minimum distance and predicting collisions between moving objects is presented. This problem has been incorporated in the framework of an in-line motion planning algorithm to satisfy collision avoidance between a robot and moving objects modeled as convex polyhedra. In the beginning the deterministic problem, where the information about the objects is assumed to be certain is examined. If instead of the Euclidean norm, L(sub 1) or L(sub infinity) norms are used to represent distance, the problem becomes a linear programming problem. The stochastic problem is formulated, where the uncertainty is induced by sensing and the unknown dynamics of the moving obstacles. Two problems are considered: (1) filtering of the minimum distance between the robot and the moving object, at the present time; and (2) prediction of the minimum distance in the future, in order to predict possible collisions with the moving obstacles and estimate the collision time.
Surface acquisition deals with the reconstruction of three dimensional objects from a set of data points. The most straightforward techniques require human intervention, a time consuming proposition. It is desirable to develop a fully automated alternative. Such a method is proposed in this paper. It makes use of surface measurements obtained from a 3-D laser digitizer - an instrument which provides the (x,y,z) coordinates of surface data points from various viewpoints. These points are assembled into several partial surfaces using a visibility constraint and a 2-D triangulation technique. Reconstruction of the final object requires merging these partial surfaces. This is accomplished through a procedure that emulates milling, a standard machining operation. From a geometrical standpoint the problem reduces to constructing the intersection of two or more non-convex polyhedra.
An approach for solving the compressible Euler and Navier-Stokes equations upon meshes composed of nearly arbitrary polyhedra is described. Each polyhedron is constructed from an arbitrary number of triangular and quadrilateral face elements, allowing the unified treatment of tetrahedral, prismatic, pyramidal, and hexahedral cells, as well the general cut cells produced by Cartesian mesh approaches. The basics behind the numerical approach and the resulting data structures are described. The accuracy of the mixed volume grid approach is assessed by performing a grid refinement study upon a series of hexahedral, tetrahedral, prismatic, and Cartesian meshes for an analytic inviscid problem. A series of laminar validation cases are made, comparing the results upon differing grid topologies to each other, to theory, and experimental data. A computation upon a prismatic/tetrahedral mesh is made simulating the laminar flow over a wall/cylinder combination.
The work began in October 1994 with the following objectives: (1) to produce an improved version of the programming language Formian; and (2) to create a means for computer aided handling of polyhedric configurations including the geodesic forms of all kinds. A new version of Formian, referred to as Formian 2, is being implemented to operate in the Windows 95 environment. It is an ideal tool for configuration management in a convenient and user-friendly manner. The second objective was achieved by creating a standard Formian function that allows convenient handling of all types of polyhedric configurations. In particular, the focus of attention is on polyhedric configurations that are of importance in architectural and structural engineering fields. The natural medium for processing of polyhedric configurations is a programming language that incorporates the concepts of 'formex algebra'. Formian is such a programming language in which the processing of polyhedric configurations can be carried out using the standard elements of the language. A description of this function is included in a chapter for a book entitled 'Beyond the Cube: the Architecture of space Frames and Polyhedra'. A copy of this chapter is appended.
This workshop paper presents the current status in the development of a new approach for the solution of the Euler equations on Cartesian meshes with embedded boundaries in three dimensions on distributed and shared memory architectures. The approach uses adaptively refined Cartesian hexahedra to fill the computational domain. Where these cells intersect the geometry, they are cut by the boundary into arbitrarily shaped polyhedra which receive special treatment by the solver. The presentation documents a newly developed multilevel upwind solver based on a flexible domain-decomposition strategy. One novel aspect of the work is its use of space-filling curves (SFC) for memory efficient on-the-fly parallelization, dynamic re-partitioning and automatic coarse mesh generation. Within each subdomain the approach employs a variety reordering techniques so that relevant data are on the same page in memory permitting high-performance on cache-based processors. Details of the on-the-fly SFC based partitioning are presented as are construction rules for the automatic coarse mesh generation. After describing the approach, the paper uses model problems and 3- D configurations to both verify and validate the solver. The model problems demonstrate that second-order accuracy is maintained despite the presence of the irregular cut-cells in the mesh. In addition, it examines both parallel efficiency and convergence behavior. These investigations demonstrate a parallel speed-up in excess of 28 on 32 processors of an SGI Origin 2000 system and confirm that mesh partitioning has no effect on convergence behavior.
The original motivation for the construction of the BESL prototype was to obtain the first proof of a 50-year-old hypothesis regarding the solidification of liquid metals. Since the 1950s it has been known that under proper conditions liquid metals can be cooled below their melting temperature (undercooled) without crystallizing to the stable solid phase. In 1952 Frank proposed that this was because the atoms in the metallic liquid were arranged with the symmetry of an icosahedron, a Platonic solid consisting of 20 tetrahedra (4-sided pyramid-shaped polyhedra) arranged around a common center. Since this local atomic order is incompatible with the long-range translational periodicity of crystal phases, a barrier is formed to the formation of small regions of the crystal phase, the nucleation barrier. A proof of Frank's hypothesis required a direct correlation between measured icosahedral order in the undercooled liquid and the nucleation barrier. The tendency of sample containers to catalyze nucleation obscured this relation, requiring containerless techniques. Combining containerless processing techniques for electrostatically levitated droplets (ESL) with x-ray synchrotron methods, a team from Washington University, St. Louis, MO, NASA Marshall Space Flight Center, and MUCAT at the APS demonstrated an increasing icosahedral order in TiZrNi liquids with decreasing temperature below the melting temperature. The increased icosahedral order caused the transformation of the liquid to a metastable icosahedral quasicrystal phase, instead of the stable tetrahedrally-coordinated crystal intermetallic, giving the first clear demonstration of the connection between the nucleation barrier and the local structure of the liquid, verifying Frank's hypothesis for this alloy.
We report on progress in modeling of asteroids as collections of rigid polyhedra ("rubble piles"). Such models are (idealized) candidates for asteroid structures: aggregates of irregular rocky subunits that are held together by self-gravity and friction. We have taken several steps toward greater realism and physical interest in construction of the models (although the gravitational fields are being treated in a simplified manner). -