Efficient Method to find Nearest Neighbours in Flocking Behaviours

Fuente: Zenodo
Saved in:
Bibliographic Details
Main Author: SIPIJ
Format: Recurso digital
Published: Zenodo 2025
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866902025825943552
author SIPIJ
author_facet SIPIJ
contents <p>Flocking is a behaviour in which objects move or work together as a group. This behaviour is very common<br>in nature think of a flock of flying geese or a school of fish in the sea. Flocking behaviours have been<br>simulated in different areas such as computer animation, graphics and games. However, the simulation of<br>the flocking behaviours of large number of objects in real time is computationally intensive task. This<br>intensity is due to the n-squared complexity of the nearest neighbour (NN) algorithm used to separate<br>objects, where n is the number of objects. This paper proposes an efficient NN method based on the partial<br>distance approach to enhance the performance of the flocking algorithm and its application to flocking<br>behaviour. The proposed method was implemented and the experimental results showed that the proposed<br>method outperformed conventional NN methods when applied to flocking fish.</p>
format Recurso digital
id zenodo_https___doi_org_10_5281_zenodo_16845474
institution Zenodo
language
publishDate 2025
publisher Zenodo
record_format zenodo
spellingShingle Efficient Method to find Nearest Neighbours in Flocking Behaviours
SIPIJ
<p>Flocking is a behaviour in which objects move or work together as a group. This behaviour is very common<br>in nature think of a flock of flying geese or a school of fish in the sea. Flocking behaviours have been<br>simulated in different areas such as computer animation, graphics and games. However, the simulation of<br>the flocking behaviours of large number of objects in real time is computationally intensive task. This<br>intensity is due to the n-squared complexity of the nearest neighbour (NN) algorithm used to separate<br>objects, where n is the number of objects. This paper proposes an efficient NN method based on the partial<br>distance approach to enhance the performance of the flocking algorithm and its application to flocking<br>behaviour. The proposed method was implemented and the experimental results showed that the proposed<br>method outperformed conventional NN methods when applied to flocking fish.</p>
title Efficient Method to find Nearest Neighbours in Flocking Behaviours
url https://doi.org/10.5281/zenodo.16845474