Related papers: Algorithm for generating quasiperiodic packings of…
We study the strip packing problem, a classical packing problem which generalizes both bin packing and makespan minimization. Here we are given a set of axis-parallel rectangles in the two-dimensional plane and the goal is to pack them in a…
We design new parallel algorithms for clustering in high-dimensional Euclidean spaces. These algorithms run in the Massively Parallel Computation (MPC) model, and are fully scalable, meaning that the local memory in each machine may be…
In this work, we present a high-fidelity and efficient point-particle direct numerical simulation framework based on a multi-block overset curvilinear grid system, enabling large-scale Lagrangian particle tracking in complex geometries with…
Recently, we have shown how current cosmological N-body codes already follow the fine grained phase-space information of the dark matter fluid. Using a tetrahedral tesselation of the three-dimensional manifold that describes perfectly cold…
The architecture of infinite structures with non-crystallographic symmetries can be modeled via aperiodic tilings, but a systematic construction method for finite structures with non-crystallographic symmetry at different radial levels is…
This paper introduces a novel technique to track structures in time varying graphs. The method uses a maximum a posteriori approach for adjusting a three-dimensional co-clustering of the source vertices, the destination vertices and the…
A numerical integration method for guiding-center orbits of charged particles in toroidal fusion devices with three-dimensional field geometry is described. Here, high order interpolation of electromagnetic fields in space is replaced by a…
Hypo-elastoplasticity is a flexible framework for modeling the mechanics of many hard materials under small elastic deformation and large plastic deformation. Under typical loading rates, most laboratory tests of these materials happen in…
We introduce a highly efficient method for panoptic segmentation of large 3D point clouds by redefining this task as a scalable graph clustering problem. This approach can be trained using only local auxiliary tasks, thereby eliminating the…
A new parallel algorithm utilizing partitioned global address space (PGAS) programming model to achieve high scalability is reported for particle tracking in direct numerical simulations of turbulent flow. The work is motivated by the…
We address semantic segmentation on omnidirectional images, to leverage a holistic understanding of the surrounding scene for applications like autonomous driving systems. For the spherical domain, several methods recently adopt an…
We consider the $k$-means clustering problem in the dynamic streaming setting, where points from a discrete Euclidean space $\{1, 2, \ldots, \Delta\}^d$ can be dynamically inserted to or deleted from the dataset. For this problem, we…
Ebert et al. [Phys. Rev. Lett. 77, 3827 (1996)] have fractured icosahedral Al-Mn-Pd single crystals in ultrahigh vacuum and have investigated the cleavage planes in-situ by scanning tunneling microscopy (STM). Globular patterns in the…
This paper continues our study of quasicrystals initiated in Part I. We propose a general mechanism for constructing quasicrystals, existing globally in time, in spatially-extended systems (partial differential equations with Euclidean…
In this paper, we present a cluster algorithm for the simulation of hard spheres and related systems. In this algorithm, a copy of the configuration is rotated with respect to a randomly chosen pivot point. The two systems are then…
We derive a semiclassical trace formula for the level density of the three-dimensional spheroidal cavity. To overcome the divergences and discontinuities occurring at bifurcation points and in the spherical limit, the trace integrals over…
This paper presents an accurate density computation approach for large dark matter simulations, based on a recently introduced phase-space tessellation technique and designed for massively parallel, heterogeneous cluster architectures. We…
We reinterpret jet clustering as an axis-finding procedure which, along with the proton beam, defines the virtual-photon transverse momentum $q_T$ in deep inelastic scattering (DIS). In this way, we are able to probe the nucleon intrinsic…
3D printing of surfaces has become an established method for prototyping and visualisation. However, surfaces often contain certain degenerations, such as self-intersecting faces or non-manifold parts, which pose problems in obtaining a 3D…
High-dimensional datasets are increasingly common across scientific and industrial domains, yet they remain difficult to cluster effectively due to the diminishing usefulness of distance metrics and the tendency of clusters to collapse or…