Related papers: O(N^2) fragmentation algorithm
Our knowledge of the strengths of small bodies in the Solar System is limited by our poor understanding of their internal structures, and this, in turn, clouds our understanding of the formation and evolution of these bodies. Observations…
In collider physics, jet algorithms are a ubiquitous tool for clustering particles into discrete jet objects. Event shapes offer an alternative way to characterize jets, and one can define a jet multiplicity event shape, which can take on…
There are many space subdivision and space partitioning techniques used in many algorithms to speed up computations. They mostly rely on orthogonal space subdivision, resp. using hierarchical data structures, e.g. BSP trees, quadtrees,…
Background: Neutron stars are astronomical systems with nucleons submitted to extreme conditions. Due to the long range coulomb repulsion between protons, the system has structural inhomogeneities. These structural inhomogeneities arise…
We use SPH simulations to investigate the gravitational fragmentation of expanding shells through the linear and non--linear regimes. The results are analysed using spherical harmonic decomposition to capture the initiation of structure…
Dust properties, such as mass and porosity, impact planet formation directly. Understanding the time evolution of dust distribution across multiple properties requires numerical computation. However, available ways to calculate the…
Quantum search is a technique for searching N possibilities in only O(sqrt(N)) steps. It has been applied in the design of quantum algorithms for several structured problems. Many of these algorithms require significant amount of quantum…
A bonded particle model is used to explore how variations in the material properties of brittle, isotropic solids affect critical behavior in fragmentation. To control material properties, a new model is proposed which includes breakable…
Quasi-2D Coulomb systems are of fundamental importance and have attracted much attention in many areas nowadays. Their reduced symmetry gives rise to interesting collective behaviors, but also brings great challenges for particle-based…
The statistical physics approach to the number partioning problem, a classical NP-hard problem, is both simple and rewarding. Very basic notions and methods from statistical mechanics are enough to obtain analytical results for the phase…
Systems of reaction-diffusion equations are commonly used in biological models of food chains. The populations and their complicated interactions present numerous challenges in theory and in numerical approximation. In particular,…
Consider the problem of estimating the median of N items to a precision epsilon, i.e., the estimate should be such that, with a high probability, the number of items, with values both smaller than and larger than this estimate, is less than…
The evolution of occupied volume under progressive fragmentation of granular matter is studied using a purely geometric model. Rather than modelling disorder directly, properties are investigated by analysing highly ordered reference…
Fragmentation and binary formation processes are studied using three-dimensional resistive MHD nested grid simulations. Starting with a Bonnor-Ebert isothermal cloud rotating in a uniform magnetic field, we calculate the cloud evolution…
Collision detection algorithms are used in aerospace, swarm robotics, automotive, video gaming, dynamics simulation and other domains. As many applications of collision detection run online, timing requirements are imposed on the algorithm…
We provide a comprehensive survey of splitting and composition methods for the numerical integration of ordinary differential equations (ODEs). Splitting methods constitute an appropriate choice when the vector field associated with the ODE…
Planet formation simulations are capable of directly integrating the evolution of hundreds to thousands of planetary embryos and planetesimals, as they accrete pairwise to become planets. In principle such investigations allow us to better…
This article presents uniform random generators of plane partitions according to the size (the number of cubes in the 3D interpretation). Combining a bijection of Pak with the method of Boltzmann sampling, we obtain random samplers that are…
In the number partitioning problem (NPP) one aims to partition a given set of $N$ real numbers into two subsets with approximately equal sum. The NPP is a well-studied optimization problem and is famous for possessing a…
The most difficult aspect of the realistic modeling of granular materials is how to capture the real shape of the particles. Here we present a method to simulate granular materials with complex-shaped particles. The particle shape is…