Search NASA⌕ Search

SEARCH · Search NASA

Results for “polygonal mesh”

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.

22 records · Page 2
All sourcesNASA NTRSDOE OSTI
NASA NTRS2017

JIGSAW-GEO (1.0): Locally Orthogonal Staggered Unstructured Grid Generation for General Circulation Modelling on the Sphere

An algorithm for the generation of non-uniform, locally orthogonal staggered unstructured spheroidal grids is described. This technique is designed to generate very high-quality staggered VoronoiDelaunay meshes appropriate for general circulation modelling on the sphere, including applications to atmospheric simulation, ocean-modelling and numerical weather prediction. Using a recently developed Frontal-Delaunay refinement technique, a method for the construction of high-quality unstructured spheroidal Delaunay triangulations is introduced. A locally orthogonal polygonal grid, derived from the associated Voronoi diagram, is computed as the staggered dual. It is shown that use of the Frontal-Delaunay refinement technique allows for the generation of very high-quality unstructured triangulations, satisfying a priori bounds on element size and shape. Grid quality is further improved through the application of hill-climbing-type optimisation techniques. Overall, the algorithm is shown to produce grids with very high element quality and smooth grading characteristics, while imposing relatively low computational expense. A selection of uniform and non-uniform spheroidal grids appropriate for high-resolution, multi-scale general circulation modelling are presented. These grids are shown to satisfy the geometric constraints associated with contemporary unstructured C-grid-type finite-volume models, including the Model for Prediction Across Scales (MPAS-O). The use of user-defined mesh-spacing functions to generate smoothly graded, non-uniform grids for multi-resolution-type studies is discussed in detail.

geophysical fluid dynamics↗
NASA NTRS1985

Spline Curves, Wire Frames and Bvalue

The methods that were developed for wire-frame design are described. The principal tools for control of a curve during interactive design are mathematical ducks. The simplest of these devices is an analog of the draftsman's lead weight that he uses to control a mechanical spline also create Ducks for controlling differential and integral properties of curves were created. Other methods presented include: constructing the end of a Bezier polygon to gain quick and reasonably confident control of the end tangent vector, end curvature and end torsion; keeping the magnitude of unwanted curvature oscillations within tolerance; constructing the railroad curves that appear in many engineering design problems; and controlling the frame to minimize errors at mesh points and to optimize the shapes of the curve elements.

Smith, L.↗
NASA NTRS1996

Numerical Conformal Mapping Using Cross-Ratios and Delaunay Triangulation

We propose a new algorithm for computing the Riemann mapping of the unit disk to a polygon, also known as the Schwarz-Christoffel transformation. The new algorithm, CRDT, is based on cross-ratios of the prevertices, and also on cross-ratios of quadrilaterals in a Delaunay triangulation of the polygon. The CRDT algorithm produces an accurate representation of the Riemann mapping even in the presence of arbitrary long, thin regions in the polygon, unlike any previous conformal mapping algorithm. We believe that CRDT can never fail to converge to the correct Riemann mapping, but the correctness and convergence proof depend on conjectures that we have so far not been able to prove. We demonstrate convergence with computational experiments. The Riemann mapping has applications to problems in two-dimensional potential theory and to finite-difference mesh generation. We use CRDT to produce a mapping and solve a boundary value problem on long, thin regions for which no other algorithm can solve these problems.

Driscoll, Tobin A.↗
NASA NTRS1985

Finite difference operators on unstructured triangular meshes

A new form of the Laplace operator is derived which is shown to be second-order accurate when calculated at mesh triangle nodes if the cells corresponding to the nodes have a high degree of symmetry. It is demonstrated that the Laplace operator directly derived from Stokes' integral theorem is only zeroth-order accurate on these same cells. The construction of gradient and Laplace operators on unstructured triangular grids are discussed from the variational point of view. Two discrete representations of the Laplacian are compared to each other, and conclusions are drawn regarding their accuracy on a pointwise basis. Finally, geometric relations valid on arbitrary polygons are given for completeness in an appendix.

Erlebacher, G.↗