Search NASA⌕ Search

SEARCH · Search NASA

Results for “Triangle 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.

At least 19 records
All sourcesNASA NTRSDOE OSTI
NASA NTRS1993

Time-dependent grid adaptation for meshes of triangles and tetrahedra

This paper presents in viewgraph form a method of optimizing grid generation for unsteady CFD flow calculations that distributes the numerical error evenly throughout the mesh. Adaptive meshing is used to locally enrich in regions of relatively large errors and to locally coarsen in regions of relatively small errors. The enrichment/coarsening procedures are robust for isotropic cells; however, enrichment of high aspect ratio cells may fail near boundary surfaces with relatively large curvature. The enrichment indicator worked well for the cases shown, but in general requires user supervision for a more efficient solution.

Russ D Rausch↗
DOE OSTI2018

Continuously differentiable PIC shape functions for triangular meshes

In this study, a new class of continuously-differentiable shape functions is developed and applied to two-dimensional electrostatic PIC simulation on an unstructured simplex (triangle) mesh. It is shown that troublesome aliasing instabilities are avoided for cold plasma simulation in which the Debye length is as small as 0.01 cell sizes. These new shape functions satisfy all requirements for PIC particle shape. They are non-negative, have compact support, and partition unity. They are given explicitly by cubic expressions in the usual triangle logical (areal) coordinates. The shape functions are not finite elements because their structure depends on the topology of the mesh, in particular, the number of triangles neighboring each mesh vertex. Nevertheless, they may be useful as approximations to solution of other problems in which continuity of derivatives is required or desired.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2018

Unstructured Primal-Dual Mesh Improvement: Target Matrix Optimization Paradigm (Final Technical Report)

The work performed at Dihedral LLC supported the collaboration via two research topics: (1) Hodge-Optimized Triangulations and (2) Target-Matrix Opti-mization Paradigm. Because the project was focused on primal-dual meshes, attention in TMOP was partially confined to linear element triangle meshes in the plane and their duals. However, a lot of our results extend to other element types.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS2011

Image Segmentation, Registration, Compression, and Matching

A novel computational framework was developed of a 2D affine invariant matching exploiting a parameter space. Named as affine invariant parameter space (AIPS), the technique can be applied to many image-processing and computer-vision problems, including image registration, template matching, and object tracking from image sequence. The AIPS is formed by the parameters in an affine combination of a set of feature points in the image plane. In cases where the entire image can be assumed to have undergone a single affine transformation, the new AIPS match metric and matching framework becomes very effective (compared with the state-of-the-art methods at the time of this reporting). No knowledge about scaling or any other transformation parameters need to be known a priori to apply the AIPS framework. An automated suite of software tools has been created to provide accurate image segmentation (for data cleaning) and high-quality 2D image and 3D surface registration (for fusing multi-resolution terrain, image, and map data). These tools are capable of supporting existing GIS toolkits already in the marketplace, and will also be usable in a stand-alone fashion. The toolkit applies novel algorithmic approaches for image segmentation, feature extraction, and registration of 2D imagery and 3D surface data, which supports first-pass, batched, fully automatic feature extraction (for segmentation), and registration. A hierarchical and adaptive approach is taken for achieving automatic feature extraction, segmentation, and registration. Surface registration is the process of aligning two (or more) data sets to a common coordinate system, during which the transformation between their different coordinate systems is determined. Also developed here are a novel, volumetric surface modeling and compression technique that provide both quality-guaranteed mesh surface approximations and compaction of the model sizes by efficiently coding the geometry and connectivity/topology components of the generated models. The highly efficient triangular mesh compression compacts the connectivity information at the rate of 1.5-4 bits per vertex (on average for triangle meshes), while reducing the 3D geometry by 40-50 percent. Finally, taking into consideration the characteristics of 3D terrain data, and using the innovative, regularized binary decomposition mesh modeling, a multistage, pattern-drive modeling, and compression technique has been developed to provide an effective framework for compressing digital elevation model (DEM) surfaces, high-resolution aerial imagery, and other types of NASA data.

Yadegar, Jacob↗
DOE OSTI2024

Automatic Digitization and Orientation of Scanned Mesh Data for Floor Plan and 3D Model Generation

This paper describes a novel approach for generating accurate floor plans and 3D models of building interiors using scanned mesh data. Unlike previous methods, which begin with a high resolution point cloud from a laser range-finder, our approach begins with triangle mesh data, as from a Microsoft HoloLens. It generates two types of floor plans, a “pen-and-ink” style that preserves details and a drafting-style that reduces clutter. It processes the 3D model for use in applications by aligning it with coordinate axes, annotating important objects, dividing it into stories, and removing the ceiling. Its performance is evaluated on commercial and residential buildings, with experiments to assess quality and dimensional accuracy. Our approach demonstrates promising potential for automatic digitization and orientation of scanned mesh data, enabling floor plan and 3D model generation in various applications such as navigation, interior design, furniture placement, facilities management, building construction, and HVAC design.

Sharma, Ritesh↗
NASA NTRS2000

High Order Discontinuous Gelerkin Methods for Convection Dominated Problems with Application to Aeroacoustics

This project is about the investigation of the development of the discontinuous Galerkin finite element methods, for general geometry and triangulations, for solving convection dominated problems, with applications to aeroacoustics. On the analysis side, we have studied the efficient and stable discontinuous Galerkin framework for small second derivative terms, for example in Navier-Stokes equations, and also for related equations such as the Hamilton-Jacobi equations. This is a truly local discontinuous formulation where derivatives are considered as new variables. On the applied side, we have implemented and tested the efficiency of different approaches numerically. Related issues in high order ENO and WENO finite difference methods and spectral methods have also been investigated. Jointly with Hu, we have presented a discontinuous Galerkin finite element method for solving the nonlinear Hamilton-Jacobi equations. This method is based on the RungeKutta discontinuous Galerkin finite element method for solving conservation laws. The method has the flexibility of treating complicated geometry by using arbitrary triangulation, can achieve high order accuracy with a local, compact stencil, and are suited for efficient parallel implementation. One and two dimensional numerical examples are given to illustrate the capability of the method. Jointly with Hu, we have constructed third and fourth order WENO schemes on two dimensional unstructured meshes (triangles) in the finite volume formulation. The third order schemes are based on a combination of linear polynomials with nonlinear weights, and the fourth order schemes are based on combination of quadratic polynomials with nonlinear weights. We have addressed several difficult issues associated with high order WENO schemes on unstructured mesh, including the choice of linear and nonlinear weights, what to do with negative weights, etc. Numerical examples are shown to demonstrate the accuracies and robustness of the methods for shock calculations. Jointly with P. Montarnal, we have used a recently developed energy relaxation theory by Coquel and Perthame and high order weighted essentially non-oscillatory (WENO) schemes to simulate the Euler equations of real gas. The main idea is an energy decomposition under the form epsilon = epsilon(sub 1) + epsilon(sub 2), where epsilon(sub 1) is associated with a simpler pressure law (gamma)-law in this paper) and the nonlinear deviation epsilon(sub 2) is convected with the flow. A relaxation process is performed for each time step to ensure that the original pressure law is satisfied. The necessary characteristic decomposition for the high order WENO schemes is performed on the characteristic fields based on the epsilon(sub l) gamma-law. The algorithm only calls for the original pressure law once per grid point per time step, without the need to compute its derivatives or any Riemann solvers. Both one and two dimensional numerical examples are shown to illustrate the effectiveness of this approach.

Shu, Chi-Wang↗
DOE OSTI2019

A Domain Decomposition Model Reduction Method for Linear Convection-Diffusion Equations with Random Coefficients

We developed a domain decomposition model reduction method for linear steady- state convection-diffusion equations with random coefficients. Of particular interest to this effort are the diffusion equation with random diffusivity and the convection-dominated transport equation with random velocity. We investigated two types of random fields, i.e., colored noises and discrete white noises, both of which can lead to high-dimensional parametric dependence in practice. The motivation is to exploit domain decomposition to reduce the parametric dimension of local problems in subdomains, such that an entire parametric map can be approximated with a small number of expensive partial differential equation (PDE) simulations. The new method combines domain decomposition with model reduction and sparse polynomial approximation, so as to simultaneously handle the high dimensionality and irregular behavior of the PDEs under consideration. Here, the advantages of our method lie in three aspects: (i) online-offline decomposition, i.e., the online cost is independent of the size of the triangle mesh; (ii) sparse approximation of operators involving nonaffine high-dimensional random fields; (iii) an effective strategy to capture irregular behaviors, e.g., sharp transitions of the PDE solutions. Two numerical examples are provided to demonstrate the advantageous performance of our method.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Spatially Accelerated Winding Numbers for Curved Geometry

The generalized winding number (GWN) is a scalar field that supports robust containment queries on curved geometry, including non-watertight, overlapping, and nested boundary representations. While queries can be easily parallelized over samples, direct evaluation on parametric curves and surfaces remains costly for large and complex models. Fast, state-of-the-art GWN approaches leverage a spatial index to approximate the GWN, typically coupled with a Taylor expansion which approximates the GWN contribution for far clusters of geometric primitives. However, such methods operate only on discrete inputs such as triangle meshes and point clouds, and would introduce containment errors near boundaries if applied to curved input. We extend support for fast GWN evaluation over arbitrary collections of NURBS curves in 2D and trimmed NURBS patches in 3D via a Bounding Volume Hierarchy that stores efficiently precomputed moment data in the hierarchy nodes. When querying the hierarchy, approximations for far clusters are used alongside direct evaluation for nearby NURBS primitives, achieving sub-linear complexity while preserving the geometric features in the vicinity of the query point. Central to our performance improvements is an adaptive subdivision strategy for NURBS primitives during a preprocessing phase, creating better spatial partitions while retaining the same accuracy for containment decisions as a direct evaluation. We demonstrate the performance and accuracy of our approach across a large collection of 2D and 3D datasets.

Computer science↗
DOE OSTI2018

Omega_h

Omega_h is a C++11 library that implements tetrahedron and triangle mesh adaptativity, with a focus on scalable HPC performance using (optionally) MPI, OpenMP, or CUDA. It is intended to provided adaptive functionality to existing simulation codes. Mesh adaptivity allows one to minimize both discretization error and number of degrees of freedom live during the simulation, as well as enabling moving object and evolving geometry simulations. Omega_h will do this for you in a way that is fast, memory-efficient, and portable across many different architectures, including NVIDIA GPUs.

Ibanez, Daniel [Sandia National Laboratories] (000↗
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.↗
NASA NTRS2000

Higher Order Modeling In the BEM/FEM Hybrid Formulation

Hybrid formulations using low order curl-conforming bases to represent the total electric field within a finite element region and low order divergence-conforming bases to represent equivalent electric and magnetic currents on the boundary are well known. However, higher-order divergence and curl-conforming bases have been shown to provide significant benefits in convergence rates and accuracy when employed in strictly integral equation and strictly finite element formulations. In this paper, a hybrid electric field formulation employing higher order bases is presented. The paper addresses benefits and issues associated with using higher order divergence-and curl-conforming bases in the hybrid finite element/boundary element electric field formulation. The method of singularity subtraction may be used to compute the self terms of the boundary integral when the bases are of low order. But this method becomes laborious and requires great care when the divergence conforming bases are of higher order. In order to handle these singularities simply and accurately, a generalized Gaussian quadrature method is employed in which the expansion functions account for the singularity. In preliminary tests of the higher order hybrid formulation, the equivalent electric current induced by scattering of a plane wave from a square dielectric cylinder is examined. Accurate results are obtained using only a two-triangle mesh when the current basis is of order 4 or 5. Additional results are presented comparing the error obtained using higher order bases to that obtained using lower order bases when the number of unknowns is approximately equal. Also, convergence rates obtained with higher order bases are compared to those obtained with lower order bases for selected sample problems.

Fink, Patrick W.↗
NASA NTRS1992

Spatial and temporal adaptive procedures for the unsteady aerodynamic analysis of airfoils using unstructured meshes

An algorithm which combines spatial and temporal adaption for the time integration of the two dimensional Euler equations on unstructured meshes of triangles is presented. Spatial adaption involves mesh enrichment to add elements in high gradient regions of the flow and mesh coarsening to remove elements where they are no longer needed. Temporal adaption is a time accurate, local time stepping procedure which integrates the flow equations in each cell according to the local numerical stability constraint. The flow solver utilizes a four stage Runge-Kutta time integration scheme with an upwind flux-split spatial discretization. Results obtained using spatial and temporal adaption indicate that highly accurate solutions can be obtained with a significant savings of computing time over global time stepping.

Hooker, John R.↗
NASA NTRS1992

Spatial and temporal adaptive procedures for the unsteady aerodynamic analysis of airfoils using unstructured meshes

An algorithm which combines spatial and temporal adaption for the time integration of the two-dimensional Euler equations on unstructured meshes of triangles is presented. Spatial adaption involves mesh enrichment to add elements in high gradient regions of the flow and mesh coarsening to remove elements where they are no longer needed. Temporal adaption is a time accurate, local time stepping procedure which integrates the flow equations in each cell according to the local numerical stability constraint. The flow solver utilizes a four-stage Runge-Kutta time integration scheme with an upwind flux-split spatial discretization. Results obtained using spatial and temporal adaption indicate that highly accurate solutions can be obtained with a significant savings of computing time over global time stepping.

Hooker, John R.↗
NASA NTRS2006

Numerical Schemes for the Hamilton-Jacobi and Level Set Equations on Triangulated Domains

Borrowing from techniques developed for conservation law equations, we have developed both monotone and higher order accurate numerical schemes which discretize the Hamilton-Jacobi and level set equations on triangulated domains. The use of unstructured meshes containing triangles (2D) and tetrahedra (3D) easily accommodates mesh adaptation to resolve disparate level set feature scales with a minimal number of solution unknowns. The minisymposium talk will discuss these algorithmic developments and present sample calculations using our adaptive triangulation algorithm applied to various moving interface problems such as etching, deposition, and curvature flow.

Barth, Timothy J.↗
NASA NTRS1999

Improvements to the Unstructured Mesh Generator MESH3D

The AIRPLANE process starts with an aircraft geometry stored in a CAD system. The surface is modeled with a mesh of triangles and then the flow solver produces pressures at surface points which may be integrated to find forces and moments. The biggest advantage is that the grid generation bottleneck of the CFD process is eliminated when an unstructured tetrahedral mesh is used. MESH3D is the key to turning around the first analysis of a CAD geometry in days instead of weeks. The flow solver part of AIRPLANE has proven to be robust and accurate over a decade of use at NASA. It has been extensively validated with experimental data and compares well with other Euler flow solvers. AIRPLANE has been applied to all the HSR geometries treated at Ames over the course of the HSR program in order to verify the accuracy of other flow solvers. The unstructured approach makes handling complete and complex geometries very simple because only the surface of the aircraft needs to be discretized, i.e. covered with triangles. The volume mesh is created automatically by MESH3D. AIRPLANE runs well on multiple platforms. Vectorization on the Cray Y-MP is reasonable for a code that uses indirect addressing. Massively parallel computers such as the IBM SP2, SGI Origin 2000, and the Cray T3E have been used with an MPI version of the flow solver and the code scales very well on these systems. AIRPLANE can run on a desktop computer as well. AIRPLANE has a future. The unstructured technologies developed as part of the HSR program are now targeting high Reynolds number viscous flow simulation. The pacing item in this effort is Navier-Stokes mesh generation.

Thomas, Scott D.↗
NASA NTRS1993

Line relaxation methods for the solution of 2D and 3D compressible flows

An implicit finite element based algorithm for the compressible Navier-Stokes equations is outlined, and the solution of the resulting equation by a line relaxation on general meshes of triangles or tetrahedra is described. The problem of generating and adapting unstructured meshes for viscous flows is reexamined, and an approach for both 2D and 3D simulations is proposed. An efficient approach appears to be the use of an implicit/explicit procedure, with the implicit treatment being restricted to those regions of the mesh where viscous effects are known to be dominant. Numerical examples demonstrating the computational performance of the proposed techniques are given.

Hassan, O.↗
NASA NTRS1988

Finite element solution of the Euler equations in two and three dimensions

The paper presents a finite element procedure for solving the equations of compressible flow over bodies of arbitrary geometry. The numerical solution algorithm employed is an explicit two-step version of a second order Taylor-Galerkin scheme. The discretization of the computational domain into unstructured meshes of triangles in two dimensions and tetrahedra in three dimensions is performed by an automatic mesh generator. In the approach, the mesh generator is coupled to the finite element solver to produce an adaptive remeshing procedure.

Peiro, J.↗
NASA NTRS1990

Unstructured finite element mesh generation and adaptive procedures for CFD

A method is described for generating unstructured meshes of triangles or tetrahedra for computational domains of complex geometrical shape. To illustrate the power of the approach, it is applied to the solution of flows past several complete aircraft configurations. The advocated approach allows for the natural incorporation of mesh adaptivity and this is demonstrated for both inviscid and viscous computations in two and three dimensions.

Peraire, J.↗