Related papers: Algorithm for generating quasiperiodic packings of…
We study the cohomology and hence $K$-theory of the aperiodic tilings formed by the so called 'cut and project' method, i.e., patterns in $d$ dimensional Euclidean space which arise as sections of higher dimensional, periodic structures.…
Multi-component aggregates are being intensively researched in various fields because of their highly tunable properties and wide applications. Due to the complex configurational space of these systems, research would greatly benefit from a…
For a three dimensional system we answer two questions, how simple a particle system might be to show the quasicrystal order and, what system features are the most important for quasicrystal formation? One-component system of particles with…
We propose and study a new quasi-interpolation method on spheres featuring the following two-phase construction and analysis. In Phase I, we analyze and characterize a large family of zonal kernels (e.g., the spherical version of Poisson…
In this paper, we propose PASS3D to achieve point-wise semantic segmentation for 3D point cloud. Our framework combines the efficiency of traditional geometric methods with robustness of deep learning methods, consisting of two stages: At…
Quasicrystals are aperiodically ordered solids that exhibit long-range order without translational periodicity, bridging the gap between crystalline and amorphous materials. Due to their lack of translational periodicity, information on…
The set of 2-dimensional packing problems builds an important class of optimization problems and Strip Packing together with 2-dimensional Bin Packing and 2-dimensional Knapsack is one of the most famous of these problems. Given a set of…
3D Gaussian Splatting (3DGS) has emerged as an advanced technique for real-time novel view synthesis by representing scene geometry and appearance using differentiable Gaussian primitives. However, efficiently computing precise…
Clustering is a fundamental task in machine learning. One of the most successful and broadly used algorithms is DBSCAN, a density-based clustering algorithm. DBSCAN requires $\epsilon$-nearest neighbor graphs of the input dataset, which are…
The analysis of extensive numerical data for the percolation probabilities of incipient spanning clusters in two dimensional percolation at criticality are presented. We developed an effective code for the single-scan version of the…
Segmentation from point cloud data is essential in many applications such as remote sensing, mobile robots, or autonomous cars. However, the point clouds captured by the 3D range sensor are commonly sparse and unstructured, challenging…
We present a method to fabricate double shell structures printed in trans-versal directions using multi-axis fused-deposition-modeling (FDM) robot-ic 3D printing. Shell structures, characterized by lightweight, thin walls, fast buildup, and…
Clustering mixtures of Gaussian distributions is a fundamental and challenging problem that is ubiquitous in various high-dimensional data processing tasks. While state-of-the-art work on learning Gaussian mixture models has focused…
Machine learning techniques have successfully been used to extract structural information such as the crystal space group from powder X-ray diffractograms. However, training directly on simulated diffractograms from databases such as the…
We present an icosahedral quasicrystal as a modification of the icosagrid, a multigrid with 10 plane sets that are arranged with icosahedral symmetry. We use the Fibonacci chain to space the planes, thereby obtaining a quasicrystal with…
DBSCAN is a popular density-based clustering algorithm that has many different applications in practice. However, the running time of DBSCAN in high-dimensional space or general metric space ({\em e.g.,} clustering a set of texts by using…
Single cluster covering approach provides a plausible mechanism for the formation and stability of octagonal and decagonal quasiperiodic structures. For dodecagonal quasiperiodic pattern such a single cluster covering scheme is still…
In this paper, we develop constructive algorithms for generating quasi-uniform point sets and sequences over arbitrary two-dimensional triangular domains. Our proposed method, called the \emph{Voronoi-guided greedy packing} algorithm,…
We describe a way to obtain a two-dimensional quasiperiodic tiling with eight-fold symmetry using cold atoms. A series of such optical tilings, related by scale transformations, is obtained for a series of specific values of the chemical…
This paper puts forth a coarse grid projection (CGP) multiscale method to accelerate computations of quasigeostrophic (QG) models for large scale ocean circulation. These models require solving an elliptic sub-problem at each time step,…