SEARCH · Search NASA

Results for “triangulation number”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 19 records

All sources NASA NTRS DOE OSTI

DOE OSTI2022

Alphavirus Particles Can Assemble with an Alternate Triangulation Number

Alphaviruses are spherical, enveloped RNA viruses primarily transmitted by mosquitoes, and cause significant arthritogenic and neurotropic disease in humans and livestock. Previous reports have shown that—in contrast to prototypical icosahedral viruses—alphaviruses incorporate frequent defects, and these may serve important functions in the viral life cycle. We confirm the genus-wide pleomorphism in live viral particles and extend our understanding of alphavirus assembly through the discovery of an alternate architecture of Eastern equine encephalitis virus (EEEV) particles. The alternate T = 3 icosahedral architecture differs in triangulation number from the classic T = 4 icosahedral organization that typifies alphaviruses, but the alternate architecture maintains the quasi-equivalence relationship of asymmetric units. The fusion spike glycoproteins are more loosely apposed in the T = 3 form with corresponding changes in the underlying capsid protein lattice. This alternate architecture could potentially be exploited in engineering alphavirus-based particles for delivery of alphaviral or other RNA.

59 BASIC BIOLOGICAL SCIENCES↗

NASA NTRS1985

Some properties of n-dimensional triangulations

A number of mathematical results relevant to the problem of constructing a triangulation, i.e., a simplicial tessellation, of the convex hull of an arbitrary finite set of points in n-space are described. The principal results achieved are: (1) a set of n+2 points in n-space may be triangulated in at most 2 different ways; (2) the sphere test defined in this report selects a preferred one of these two triangulations; (3) a set of parameters is defined that permits the characterization and enumeration of all sets of n+2 points in n-space that are significantly different from the point of view of their possible triangulation; (4) the local sphere test induces a global sphere test property for a triangulation; and (5) a triangulation satisfying the global sphere property is dual to the n-dimensional Dirichlet tesselation, i.e., it is a Delaunay triangulation.

Lawson, C. L.↗

DOE OSTI2025

Circles and triangles, the NLSM and Tr(Φ 3 )

A surprising connection has recently been made between the amplitudes for Tr(Φ 3 ) theory and the non-linear sigma model (NLSM). A simple shift of kinematic variables naturally suggested by the associahedron/stringy representation of Tr(Φ 3 ) theory yields pion amplitudes at all loops. In this note we provide an elementary motivation and proof for this link going in the opposite direction, starting from the non-linear sigma model and discovering its formulation as a sum over triangulations of surfaces with simple numerator factors. This uses an ancient connection between “circles” and “triangles”, interpreting the equation y = $\sqrt{1 – x^2}$ both as parametrizing points a circle as well as generating the number of triangulations of polygons. A further simplification of the numerator factors exposes them as arising from the kinematically shifted Tr(Φ3) theory, and gives rise to novel tropical representations of NLSM amplitudes. The connection to Tr(Φ 3 ) theory defines a natural notion of “surface-soft limit” intrinsic to curves on surfaces. Remarkably, with this definition, the soft limit of pion amplitudes vanishes directly at the level of the integrand, via obvious pairwise cancellations. We also give simple, explicit expressions for the multi-soft factors for tree and loop-level integrands in the limit as any number of pions are taken “surface-soft”.

Scattering Amplitudes↗

NASA NTRS1989

Vehicle path-planning in three dimensions using optics analogs for optimizing visibility and energy cost

Path planning is an important issue for space robotics. Finding safe and energy-efficient paths in the presence of obstacles and other constraints can be complex although important. High-level (large-scale) path planning for robotic vehicles was investigated in three-dimensional space with obstacles, accounting for: (1) energy costs proportional to path length; (2) turn costs where paths change trajectory abruptly; and (3) safety costs for the danger associated with traversing a particular path due to visibility or invisibility from a fixed set of observers. Paths optimal with respect to these cost factors are found. Autonomous or semi-autonomous vehicles were considered operating either in a space environment around satellites and space platforms, or aircraft, spacecraft, or smart missiles operating just above lunar and planetary surfaces. One class of applications concerns minimizing detection, as for example determining the best way to make complex modifications to a satellite without being observed by hostile sensors; another example is verifying there are no paths (holes) through a space defense system. Another class of applications concerns maximizing detection, as finding a good trajectory between mountain ranges of a planet while staying reasonably close to the surface, or finding paths for a flight between two locations that maximize the average number of triangulation points available at any time along the path.

Rowe, Neil C.↗

NASA NTRS1986

Properties of n-dimensional triangulations

This paper establishes a number of mathematical results relevant to the problem of constructing a triangulation, i.e., a simplical tessellation of the convex hull of an arbitrary finite set of points in n-space. The principal results of the present paper are: (1) a set of n + 2 points in n-space may be triangulated in at most 2 different ways; (2) the 'sphere test' defined in this paper selects a preferred one of these two triangulations; (3) a set of parameters is defined that permits the characterization and enumeration of all sets on n + 2 points in n-space that are significantly different from the point of view of their possible triangulations; and (4) the local sphere test induces a global sphere test property for a triangulation.

Lawson, Charles L.↗

NASA NTRS1998

A Parallel Non-Overlapping Domain-Decomposition Algorithm for Compressible Fluid Flow Problems on Triangulated Domains

This paper considers an algebraic preconditioning algorithm for hyperbolic-elliptic fluid flow problems. The algorithm is based on a parallel non-overlapping Schur complement domain-decomposition technique for triangulated domains. In the Schur complement technique, the triangulation is first partitioned into a number of non-overlapping subdomains and interfaces. This suggests a reordering of triangulation vertices which separates subdomain and interface solution unknowns. The reordering induces a natural 2 x 2 block partitioning of the discretization matrix. Exact LU factorization of this block system yields a Schur complement matrix which couples subdomains and the interface together. The remaining sections of this paper present a family of approximate techniques for both constructing and applying the Schur complement as a domain-decomposition preconditioner. The approximate Schur complement serves as an algebraic coarse space operator, thus avoiding the known difficulties associated with the direct formation of a coarse space discretization. In developing Schur complement approximations, particular attention has been given to improving sequential and parallel efficiency of implementations without significantly degrading the quality of the preconditioner. A computer code based on these developments has been tested on the IBM SP2 using MPI message passing protocol. A number of 2-D calculations are presented for both scalar advection-diffusion equations as well as the Euler equations governing compressible fluid flow to demonstrate performance of the preconditioning algorithm.

Barth, Timothy J.↗

DOE OSTI2026

Supersymmetric lattice theories on curved space

We show how to construct Hamiltonian lattice theories with one exact supersymmetry on arbitrary triangulations of curved space in any number of dimensions. Both bosons and fermions satisfy discrete Kähler-Dirac equations. The quantization of the fermions proceeds by imposing conventional anticommutation relations while the bosons require a modification of the usual canonical commutator. On regular lattices we construct parity, time reversal and translation-by-one (shift) symmetries. We argue that the latter are generically noninvertible symmetries. We also show how to couple these degrees of freedom to background gauge fields which leads to a theory with enhanced supersymmetry.

Anomalies↗

NASA NTRS1997

Progress in Parallel Schur Complement Preconditioning for Computational Fluid Dynamics

We consider preconditioning methods for nonself-adjoint advective-diffusive systems based on a non-overlapping Schur complement procedure for arbitrary triangulated domains. The ultimate goal of this research is to develop scalable preconditioning algorithms for fluid flow discretizations on parallel computing architectures. In our implementation of the Schur complement preconditioning technique, the triangulation is first partitioned into a number of subdomains using the METIS multi-level k-way partitioning code. This partitioning induces a natural 2X2 partitioning of the p.d.e. discretization matrix. By considering various inverse approximations of the 2X2 system, we have developed a family of robust preconditioning techniques. A computer code based on these ideas has been developed and tested on the IBM SP2 and the SGI Power Challenge array using MPI message passing protocol. A number of example CFD calculations will be presented to illustrate and assess various Schur complement approximations.

Barth, Timothy J.↗

NASA NTRS1998

Algebraic Nonoverlapping Domain Decomposition Methods for Stabilized FEM and FV Discretizations

We consider preconditioning methods for convection dominated fluid flow problems based on a nonoverlapping Schur complement domain decomposition procedure for arbitrary triangulated domains. The triangulation is first partitioned into a number of subdomains and interfaces which induce a natural 2 x 2 partitioning of the p.d.e. discretization matrix. We view the Schur complement induced by this partitioning as an algebraically derived coarse space approximation. This avoids the known difficulties associated with the direct formation of an effective coarse discretization for advection dominated equations. By considering various approximations of the block factorization of the 2 x 2 system, we have developed a family of robust preconditioning techniques. A computer code based on these ideas has been developed and tested on the IBM SP2 using MPI message passing protocol. A number of 2-D CFD calculations will be presented for both scalar advection-diffusion equations and the Euler equations discretized using stabilized finite element and finite volume methods. These results show very good scalability of the preconditioner for various discretizations as the number of processors is increased while the number of degrees of freedom per processor is fixed.

Barth, Timothy J.↗

NASA NTRS1988

Adaptive mesh generation for viscous flows using Delaunay triangulation

A method for generating an unstructured triangular mesh in two dimensions, suitable for computing high Reynolds number flows over arbitrary configurations is presented. The method is based on a Delaunay triangulation, which is performed in a locally stretched space, in order to obtain very high aspect ratio triangles in the boundary layer and the wake regions. It is shown how the method can be coupled with an unstructured Navier-Stokes solver to produce a solution adaptive mesh generation procedure for viscous flows.

Mavriplis, Dimitri J.↗

NASA NTRS1988

Adaptive mesh generation for viscous flows using Delaunay triangulation

Mavriplis, Dimitri J.↗

NASA NTRS1990

Adaptive mesh generation for viscous flows using Delaunay triangulation

Mavriplis, Dimitri J.↗

NASA NTRS2002

Minimizing Cache Misses Using Minimum-Surface Bodies

A number of known techniques for improving cache performance in scientific computations involve the reordering of the iteration space. Some of these reorderings can be considered as coverings of the iteration space with the sets having good surface-to-volume ratio. Use of such sets reduces the number of cache misses in computations of local operators having the iteration space as a domain. First, we derive lower bounds which any algorithm must suffer while computing a local operator on a grid. Then we explore coverings of iteration spaces represented by structured and unstructured grids which allow us to approach these lower bounds. For structured grids we introduce a covering by successive minima tiles of the interference lattice of the grid. We show that the covering has low surface-to-volume ratio and present a computer experiment showing actual reduction of the cache misses achieved by using these tiles. For planar unstructured grids we show existence of a covering which reduces the number of cache misses to the level of structured grids. On the other hand, we present a triangulation of a 3-dimensional cube such that any local operator on the corresponding grid has significantly larger number of cache misses than a similar operator on a structured grid.

Frumkin, Michael↗

DOE OSTI2023

Toddler home math environment: Triangulating multi-method assessments in a U.S. Sample

Introduction Current research has documented the home math environment (HME) of preschoolers and kindergarteners. Very few studies, however, have explored the number and spatial activities in which parents engage with children during their toddler years. Methods This study examined the HME of 157 toddlers using several methodologies, including surveys, time diaries, and observations of math talk. Further, it examined correlations within and across data sources to identify areas of convergence and triangulation, and correlated HME measures with measures of toddlers’ number and spatial skills. Results Findings showed that, in general, uses of different types of math activities, including both number and spatial, were intercorrelated within method. Across methods, there was high intercorrelation between the frequency of math activities reported on parent surveys and the diversity of types of math activities endorsed in time diary interviews. Parent math talk gleaned from semi-structured interviews functioned as a separate aspect of the HME; different types of math talk shared few intercorrelations with engagement in math activities as reported in either surveys or time diaries. Finally, several HME measures positively correlated with toddlers’ math skills. Discussion Given extant research demonstrating that both math activities and math talk predict children’s math skills, our results stress the need for multimethod studies that differentiate among these HME opportunities.

Miller, Portia↗

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 NTRS1974

Derivation of formulas for root-mean-square errors in location, orientation, and shape in triangulation solution of an elongated object in space

Formulas are derived for the root-mean-square (rms) displacement, slope, and curvature errors in an azimuth-elevation image trace of an elongated object in space, as functions of the number and spacing of the input data points and the rms elevation error in the individual input data points from a single observation station. Also, formulas are derived for the total rms displacement, slope, and curvature error vectors in the triangulation solution of an elongated object in space due to the rms displacement, slope, and curvature errors, respectively, in the azimuth-elevation image traces from different observation stations. The total rms displacement, slope, and curvature error vectors provide useful measure numbers for determining the relative merits of two or more different triangulation procedures applicable to elongated objects in space.

Long, S. A. T.↗

NASA NTRS1998

Automatic Generation of CFD-Ready Surface Triangulations from CAD Geometry

This paper presents an approach for the generation of closed manifold surface triangulations from CAD geometry. CAD parts and assemblies are used in their native format, without translation, and a part's native geometry engine is accessed through a modeler-independent application programming interface (API). In seeking a robust and fully automated procedure, the algorithm is based on a new physical space manifold triangulation technique which was developed to avoid robustness issues associated with poorly conditioned mappings. In addition, this approach avoids the usual ambiguities associated with floating-point predicate evaluation on constructed coordinate geometry in a mapped space, The technique is incremental, so that each new site improves the triangulation by some well defined quality measure. Sites are inserted using a variety of priority queues to ensure that new insertions will address the worst triangles first, As a result of this strategy, the algorithm will return its 'best' mesh for a given (prespecified) number of sites. Alternatively, the algorithm may be allowed to terminate naturally after achieving a prespecified measure of mesh quality. The resulting triangulations are 'CFD-ready' in that: (1) Edges match the underlying part model to within a specified tolerance. (2) Triangles on disjoint surfaces in close proximity have matching length-scales. (3) The algorithm produces a triangulation such that no angle is less than a given angle bound, alpha, or greater than Pi - 2alpha This result also sets bounds on the maximum vertex degree, triangle aspect-ratio and maximum stretching rate for the triangulation. In addition to tile output triangulations for a variety of CAD parts, tile discussion presents related theoretical results which assert the existence of such all angle bound, and demonstrate that maximum bounds of between 25 deg and 30 deg may be achieved in practice.

Aftosmis, M. J.↗

NASA NTRS2001

Using Minimum-Surface Bodies for Iteration Space Partitioning

A number of known techniques for improving cache performance in scientific computations involve the reordering of the iteration space. Some of these reorderings can be considered as coverings of the iteration space with the sets having good surface-to-volume ratio. Use of such sets reduces the number of cache misses in computations of local operators having the iteration space as a domain. We study coverings of iteration spaces represented by structured and unstructured grids. For structured grids we introduce a covering based on successive minima tiles of the interference lattice of the grid. We show that the covering has good surface-to-volume ratio and present a computer experiment showing actual reduction of the cache misses achieved by using these tiles. For unstructured grids no cache efficient covering can be guaranteed. We present a triangulation of a 3-dimensional cube such that any local operator on the corresponding grid has significantly larger number of cache misses than a similar operator on a structured grid.

Frumlin, Michael↗