Using the k-d Tree Data Structure to Accelerate Monte Carlo Simulations.
Sign Up to like & getrecommendations! Published in 2017 at "Journal of chemical theory and computation"
DOI: 10.1021/acs.jctc.6b01222
Abstract: The k-d tree data structure is implemented in a Monte Carlo (MC) molecular simulation program to accelerate the range search for particles or interaction sites within the cutoff distance when Lennard-Jones and Coulomb interactions are… read more here.
Keywords: tree data; npt ensemble; data structure; monte carlo ... See more keywords
Efficient Local Refinement near Parametric Boundaries Using kd-Tree Data Structure and Algebraic Level Sets
Sign Up to like & getrecommendations! Published in 2022 at "Algorithms"
DOI: 10.3390/a15070245
Abstract: In analysis of problems with parametric spline boundaries that are immersed or inserted into an underlying domain, the discretization on the underlying domain usually does not conform to the inserted boundaries. While the fixed underlying… read more here.
Keywords: tree data; refinement; local refinement; refinement near ... See more keywords