منابع مشابه
Neighbour Lists Again
In a recent article, Thompson 1] described the use of neighbour lists in simulations, giving a detailed account of the implementation and the resulting economies. This note deals with a simple variant on the method, and discusses the choice of neighbour list technique, if any, to be used in various circumstances. The idea was originally introduced in the classic paper of Verlet 2] on the simula...
متن کاملOn neighbour-distinguishing colourings from lists
Let G be a finite simple graph, let C be a set of colours (in this paper we shall always suppose C ⊆ N) and let f : E(G) → C be an edge colouring of G. The colour set of a vertex v ∈ V (G) with respect to f is the set Sf (v) of colours of edges incident to v. The colouring f is neighbour-distinguishing if it distinguishes any two adjacent vertices by their colour sets, i.e., Sf (u) 6= Sf (v) wh...
متن کاملConstrained neighbor lists for SPH-based fluid simulations
In this paper we present a new approach to create neighbor lists with strict memory bounds for incompressible Smoothed Particle Hydrodynamics (SPH) simulations. Our proposed approach is based on a novel efficient predictive-corrective algorithm that locally adjusts particle support radii in order to yield neighborhoods of a user-defined maximum size. Due to the improved estimation of the initia...
متن کاملCompressed Neighbour Discovery using Sparse Kerdock Matrices
We study the network-wide neighbour discovery problem in wireless networks in which each node in a network must discovery the network interface addresses (NIAs) of its neighbour. We work within the rapid on-off division duplex framework proposed by Guo and Zhang in [5] in which all nodes are assigned different on-off signatures which allow them listen to the transmissions of neighbouring nodes ...
متن کاملApproximate Nearest-Neighbour Search with Inverted Signature Slice Lists
In this paper we present an original approach for finding approximate nearest neighbours in collections of locality-sensitive hashes. The paper demonstrates that this approach makes high-performance nearest-neighbour searching feasible on Web-scale collections and commodity hardware with minimal degradation in search quality.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Graphics Forum
سال: 2019
ISSN: 0167-7055,1467-8659
DOI: 10.1111/cgf.13890