You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardExpand all lines: README.md
+2-2Lines changed: 2 additions & 2 deletions
Display the source diff
Display the rich diff
Original file line number
Diff line number
Diff line change
@@ -1,8 +1,8 @@
1
1
# fastDLA
2
2
3
-
This repository provides a program for simulating off-grid diffusion limited aggregation (DLA)due to [Peter Meakin](https://link.aps.org/doi/10.1103/PhysRevA.27.1495).
3
+
This repository provides a program for simulating off-grid diffusion limited aggregation (DLA). A model of aggregation due to [Peter Meakin](https://link.aps.org/doi/10.1103/PhysRevA.27.1495). It implements an algorithm due to [Peter Ossadnik](https://www.sciencedirect.com/science/article/abs/pii/037843719190224Z).
4
4
5
-
The code runs in O(n polylog(n)) time (within a polylog(n) factor of optimal) and is explained and analysed in a forthcoming paper. The header file alone can be included in a C++ project or the cpp file can be compiled to generate clusters and save them to file.
5
+
The main body of the code runs in O(n polylog(n)) time (within a polylog(n) factor of optimal) and is explained and analysed in a forthcoming paper. Whilst the initial memory allocation and zeroing requires O(n^1.18) time and space, in practice this is not the main time cost. The header file alone can be included in a C++ project or the cpp file can be compiled to generate clusters and save them to file.
0 commit comments