Search NASA⌕ Search

SEARCH · Search NASA

Results for “Euler's polyhedral formula”

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.

The Euler characteristic as a basis for teaching topology concepts to crystallographers

The simple Euler polyhedral formula, expressed as an alternating count of the bounding faces, edges and vertices of any polyhedron, V – E + F = 2, is a fundamental concept in several branches of mathematics. Obviously, it is important in geometry, but it is also well known in topology, where a similar telescoping sum is known as the Euler characteristic χ of any finite space. The value of χ can also be computed for the unit polyhedra (such as the unit cell, the asymmetric unit or Dirichlet domain) which build, in a symmetric fashion, the infinite crystal lattices in all space groups. In this application χ has a modified form (χ m ) and value because the addends have to be weighted according to their symmetry. Although derived in geometry (in fact in crystallography), χ m has an elegant topological interpretation through the concept of orbifolds. Alternatively, χ m can be illustrated using the theorems of Harriot and Descartes, which predate the discovery made by Euler. Those historical theorems, which focus on angular defects of polyhedra, are beautifully expressed in the formula of de Gua de Malves. In a still more general interpretation, the theorem of Gauss–Bonnet links the Euler characteristic with the general curvature of any closed space. This article presents an overview of these interesting aspects of mathematics with Euler's formula as the leitmotif. Finally, a game is designed, allowing readers to absorb the concept of the Euler characteristic in an entertaining way.

97 MATHEMATICS AND COMPUTING↗

Lipid vesicles induced ordered nanoassemblies of Janus nanoparticles

Since many advanced applications require specific assemblies of nanoparticles (NPs), considerable efforts have been made to fabricate nanoassemblies with specific geometries. Although nanoassemblies can be fabricated through top-down approaches, recent advances show that intricate nanoassemblies can also be obtained through self-assembly, mediated for example by DNA strands. Here, we show, through extensive molecular dynamics simulations, that highly ordered self-assemblies of NPs can be mediated by their adhesion to lipid vesicles (LVs). Specifically, Janus NPs are considered so that the amount by which they are wrapped by the LV is controlled. The specific geometry of the nanoassembly is the result of effective curvature-mediated repulsion between the NPs and the number of NPs adhering to the LV. Further, the NPs are arranged on the LV into polyhedra which satisfy the upper limit of Euler's polyhedral formula, including several deltahedra and three Platonic solids, corresponding to the tetrahedron, octahedron, and icosahedron.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

An efficient method to integrate polynomials over polytopes and curved solids

Here in this paper, we present an efficient approach to compute the integral of monomials and polynomials over polyhedra and regions defined by parametric curved boundary surfaces. We use Euler's theorem for homogeneous functions in combination with Stokes's theorem to reduce the integration of a monomial over a three-dimensional solid to its boundary. If the solid is a polytope, through a recursive application of these theorems, the integral is further reduced to just the evaluation of the monomial and its derivatives at the vertices of the polytope. The present approach is simpler than existing techniques that rely on repeated use of the divergence theorem, which require the antiderivative of the monomials and the projection of these functions onto hyperplanes. For convex and nonconvex polytopes, our approach does not introduce any approximation for the integration of monomials. For curved solid regions bounded by surfaces that admit a parameterization, the same approach yields simplified formulas to compute the integral of any homogeneous function, including monomials. For surfaces parameterized by polynomial surfaces (such as Bezier surface triangles and B-spline patches), the method yields machine-precision accuracy for the volumetric integration of monomials with an appropriate quadrature rule. Numerical examples over regions bounded by polynomial surfaces and rational surfaces are presented to establish the accuracy and efficiency of the method.

97 MATHEMATICS AND COMPUTING↗