Williams, BenjaminOliver, TomWard, DavinHeadleand, ChrisHunter, DavidSlingsby, Aidan2024-09-092024-09-092024978-3-03868-249-3https://doi.org/10.2312/cgvc.20241218https://diglib.eg.org/handle/10.2312/cgvc20241218The current frontier of virtual forestry algorithms remain largely unoptimised and ultimately unsuitable for real-time applications. Providing an optimisation strategy for the real-time simulation of virtual forestry would find particular utility in some areas, for example, in video games. With this motivation in mind, this paper presents a novel optimisation strategy for asymmetric plant competition models. In our approach, we utilise a data-oriented methodology with spatial hashing to enable the real-time simulation of virtual forests. Our approach also provides a significant improvement in performance when contrasted with existing serial implementations. Furthermore, we find that the introduction of our optimisation strategy can be used to simulate hundreds of thousands of virtual trees, in real-time, on a typical desktop machine.Attribution 4.0 International LicenseCCS Concepts: Computing methodologies → Artificial life; Parallel algorithms; Computer graphics; Software and its engineering → Interactive games;Computing methodologies → Artificial lifeParallel algorithmsComputer graphicsSoftware and its engineering → Interactive games10.2312/cgvc.202412189 pages