English
Related papers

Related papers: Multi-sphere approximation of realistic particles …

200 papers

This paper proposes improvements to the physically-based surface triangulation method, bubble meshing. The method simulates physical bubbles to automatically generate mesh vertices, resulting in high-quality Delaunay triangles. Despite its…

Computational Geometry · Computer Science 2025-08-08 Lei Shangyu , Fan Wei , Ren Hui

An adpative integration technique for time advancement of particle motion in the context of coupled computational fluid dynamics (CFD) - discrete element method (DEM) simulations is presented in this work. CFD-DEM models provide an accurate…

Computational Physics · Physics 2018-02-28 Hariswaran Sitaraman , Ray Grout

This paper proposes a novel block merging algorithm suitable for any block-based 3D instance segmentation technique. The proposed work improves over the state-of-the-art by allowing wrongly labelled points of already processed blocks to be…

Computer Vision and Pattern Recognition · Computer Science 2024-07-11 Leon Denis , Remco Royen , Adrian Munteanu

We present a fast algorithm for global rigid symmetry detection with approximation guarantees. The algorithm is guaranteed to find the best approximate symmetry of a given shape, to within a user-specified threshold, with very high…

Computational Geometry · Computer Science 2016-09-20 Simon Korman , Roee Litman , Shai Avidan , Alex Bronstein

The reduced basis method (RBM) empowers repeated and rapid evaluation of parametrized partial differential equations through an offline-online decomposition, a.k.a. a learning-execution process. A key feature of the method is a greedy…

Numerical Analysis · Mathematics 2020-09-16 Jiahua Jiang , Yanlai Chen

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…

Fluid Dynamics · Physics 2025-09-10 Taiyang Wang , Baoqing Meng , Baolin Tian , Yaomin Zhao

Recent years have witnessed the surge of learned representations that directly build upon point clouds. Though becoming increasingly expressive, most existing representations still struggle to generate ordered point sets. Inspired by…

Computer Vision and Pattern Recognition · Computer Science 2023-02-06 Jiaxin Wei , Lige Liu , Ran Cheng , Wenqing Jiang , Minghao Xu , Xinyu Jiang , Tao Sun , Soren Schwertfeger , Laurent Kneip

We have developed a new three-dimensional algorithm, based on the standard P$^3$M method, for computing deflections due to weak gravitational lensing. We compare the results of this method with those of the two-dimensional planar approach,…

Astrophysics · Physics 2009-10-31 H. M. P. Couchman , Andrew J. Barber , Peter A. Thomas

Digital holographic microscopy is a fast three-dimensional (3D) imaging tool with many applications in soft matter physics. Recent studies have shown that electromagnetic scattering solutions can be fit to digital holograms to obtain the 3D…

The reconstruction of smooth density fields from scattered data points is a procedure that has multiple applications in a variety of disciplines, including Lagrangian (particle-based) models of solute transport in fluids. In random walk…

Computational Physics · Physics 2019-09-04 Guillem Sole-Mari , Diogo Bolster , Daniel Fernàndez-Garcia , Xavier Sanchez-Vila

The density matrix renormalization group (DMRG) algorithm is a cornerstone computational method for studying quantum many-body systems, renowned for its accuracy and adaptability. Despite DMRG's broad applicability across fields such as…

Computational Physics · Physics 2026-03-24 Per Sehlstedt , Jan Brandejs , Paolo Bientinesi , Lars Karlsson

A flaw in the greedy approximation algorithm proposed by Zhang et al. for minimum connected set cover problem is corrected, and a stronger result on the approximation ratio of the modified greedy algorithm is established. The results are…

Data Structures and Algorithms · Computer Science 2015-03-19 Wei Ren , Qing Zhao

Many application areas collect unstructured trajectory data. In subtrajectory clustering, one is interested to find patterns in this data using a hybrid combination of segmentation and clustering. We analyze two variants of this problem…

Computational Geometry · Computer Science 2025-04-25 Jacobus Conradi , Anne Driemel

The densest subgraph problem has received significant attention, both in theory and in practice, due to its applications in problems such as community detection, social network analysis, and spam detection. Due to the high cost of obtaining…

Data Structures and Algorithms · Computer Science 2023-11-09 Pattara Sukprasert , Quanquan C. Liu , Laxman Dhulipala , Julian Shun

A novel multi-resolution technique called border mapping multi-resolution (BMMR) is proposed for projection-based particle methods. The BMMR aims to obtain background equivalent particle distributions in the two sides of a border between…

3D Gaussian Splatting (3DGS) represents a significant advancement in the field of efficient and high-fidelity novel view synthesis. Despite recent progress, achieving accurate geometric reconstruction under sparse-view conditions remains a…

Computer Vision and Pattern Recognition · Computer Science 2025-08-07 Zexu Huang , Min Xu , Stuart Perry

Virtual screening can accelerate drug discovery by identifying promising candidates for experimental evaluation. Machine learning is a powerful method for screening, as it can learn complex structure-property relationships from experimental…

Machine Learning · Computer Science 2021-02-22 Simon Axelrod , Rafael Gomez-Bombarelli

We propose a novel algorithm for the fitting of 3D human shape to images. Combining the accuracy and refinement capabilities of iterative gradient-based optimization techniques with the robustness of deep neural networks, we propose a…

Computer Vision and Pattern Recognition · Computer Science 2020-08-20 Jie Song , Xu Chen , Otmar Hilliges

This work studies a class of non-smooth decentralized multi-agent optimization problems where the agents aim at minimizing a sum of local strongly-convex smooth components plus a common non-smooth term. We propose a general primal-dual…

Optimization and Control · Mathematics 2020-07-13 Sulaiman A. Alghunaim , Ernest K. Ryu , Kun Yuan , Ali H. Sayed

In this work, a coarse-graining method previously proposed by the authors in a companion paper based on solving diffusion equations is applied to CFD-DEM simulations, where coarse graining is used to obtain solid volume fraction, particle…

Computational Physics · Physics 2015-01-07 Rui Sun , Heng Xiao