Related papers: Generating $N$-point spherical configurations with…
This paper describes a novel method of generating hex-dominant meshes using pre-computed optimal subdivisions of the unit cube in a grid-based approach. Our method addresses geometries that are standard in mechanical engineering and often…
Spherical nanoclusters and nanoparticles are rising materials whose functional design provides many useful applications ranging from catalysis, molecular sensing, gas storage to drug targeting and delivery. Here, we develop phenomenological…
In this paper we propose a simple method for generating short-length rate-compatible codes over $\mathbb{Z}_M$ that are robust to non-coherent detection for $M$-PSK constellations. First, a greedy algorithm is used to construct a family of…
Spherical $t$-designs on $\mathbb{S}^{d}\subset\mathbb{R}^{d+1}$ provide $N$ nodes for an equal weight numerical integration rule which is exact for all spherical polynomials of degree at most $t$. This paper considers the generation of…
We present a novel orbit parameterization in spherical coordinates. This parameterization enables the mixing of varying and invariant orbital parameters, and clarifies the physics of the orbit. It also simplifies the process of placing…
We study the problem of determining the least symmetric triangle, which arises both from pure geometry and from the study of molecular chirality in chemistry. Using the correspondence between planar $n$-gons and points in the Grassmannian…
We develop an algorithm for i) computing generalized regular $k$-point grids, ii) reducing the grids to their symmetrically distinct points, and iii) mapping the reduced grid points into the Brillouin zone. The algorithm exploits the…
An approximate but straight forward projection method to molecular many alpha-particle states is proposed and the overlap to the shell model space is determined. The resulting space is in accordance with the shell model, but still contains…
Here we show how to produce a 3D density field with a given set of higher-order correlation functions. Our algorithm enables producing any desired two-point, three-point, and four-point functions, including odd-parity for the latter. We…
We provide theoretical procedures and practical recipes to simulate non-Gaussian correlated, homogeneous random fields with prescribed marginal distributions and cross-correlation structure, either in a N-dimensional Cartesian space or on…
This article reports the spherical coordinate form of three-dimensional generalized dynamics of soft-matter quasicrystals with 12-fold symmetry which provides a basis for solving initial-boundary value problems of the equations under some…
$\newcommand{\Re}{\mathbb{R}}$We study the minWSPD problem of computing the minimum-size well-separated pairs decomposition of a set of points, and show constant approximation algorithms in low-dimensional Euclidean space and doubling…
Streamline-based quad meshing algorithms use smooth cross fields to partition surfaces into quadrilateral regions by tracing cross field separatrices. In practice, re-entrant corners and misalignment of singularities lead to small regions…
Spherical t-designs are Chebyshev-type averaging sets on the d-sphere S^d which are exact for polynomials of degree at most t. This concept was introduced in 1977 by Delsarte, Goethals, and Seidel, who also found the minimum possible size…
A new grid system on a sphere is proposed that allows for straight-forward implementation of both spherical-harmonics-based spectral methods and gridpoint-based multigrid methods. The latitudinal gridpoints in the new grid are equidistant…
We numerically examine the exterior solution of spherically symmetric and static configuration in scalar-tensor theories by using the nonminimally coupled scalar field with zero potential as our sample model. Our main purpose in this work…
We introduce series-triangular graph embeddings and show how to partition point sets with them. This result is then used to improve the upper bound on the number of Steiner points needed to obtain compatible triangulations of point sets.…
We present an isogeometric framework based on collocation to construct a $C^2$-smooth approximation of the solution of the Poisson's equation over planar bilinearly parameterized multi-patch domains. The construction of the used globally…
This paper introduces a directional multiscale algorithm for the two dimensional $N$-body problem of the Helmholtz kernel with applications to high frequency scattering. The algorithm follows the approach in [Engquist and Ying, SIAM Journal…
The creation of a volumetric mesh representing the interior of an input polygonal mesh is a common requirement in graphics and computational mechanics applications. Most mesh creation techniques assume that the input surface is not…