Geometric properties of the monotonic Lagrangian grid algorithm for near neighbor calculations (Q1094808)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Geometric properties of the monotonic Lagrangian grid algorithm for near neighbor calculations |
scientific article; zbMATH DE number 4026641
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Geometric properties of the monotonic Lagrangian grid algorithm for near neighbor calculations |
scientific article; zbMATH DE number 4026641 |
Statements
Geometric properties of the monotonic Lagrangian grid algorithm for near neighbor calculations (English)
0 references
1987
0 references
A new algorithm, monotonic Lagrangian grid, is used for indexing the geometric positions and other dynamical attributes of moving nodes in computer memory. Applied to the random motion of point nodes, this is relatively powerful in handling calculations of near neighbour interactions, pertinent to areas like astrophysics, molecular dynamics, particle, vortex, and object tracking data bases and fluid mechanics.
0 references
monotonic Lagrangian grid
0 references
geometric positions
0 references
moving nodes
0 references
near neighbour interactions
0 references
astrophysics
0 references
molecular dynamics
0 references
particle
0 references
vortex
0 references
data bases
0 references
