Implementation of a new hierarchical neighbour search algorithm
Registered by
Dion Weatherley
The current verlet list/linked cell neighbour search algorithm is inefficient for simulations with a broad range of particle sizes e.g. simulations where the maximum particle radius is >20 times the minimum particle radius. A possible solution for these cases would be a hierarchical neighbour search algorithm where the size of the search grid depends on local particle sizes and/or particle density.
Blueprint information
- Status:
- Not started
- Approver:
- Dion Weatherley
- Priority:
- Low
- Drafter:
- Dion Weatherley
- Direction:
- Approved
- Assignee:
- None
- Definition:
- Discussion
- Series goal:
- None
- Implementation:
-
Deferred
- Milestone target:
- None
- Started by
- Completed by
Related branches
Related bugs
Sprints
Whiteboard
(?)
