2017
DOI: 10.1002/cav.1775
|View full text |Cite
|
Sign up to set email alerts
|

A comparative study of k‐nearest neighbour techniques in crowd simulation

Abstract: The k-nearest neighbour (kNN) problem appears in many different fields of computer science, such as computer animation and robotics. In crowd simulation, kNN queries are typically used by a collision-avoidance method to prevent unnecessary computations. Many different methods for finding these neighbours exist, but it is unclear which will work best in crowd simulations, an application which is characterised by low dimensionality and frequent change of the data points. We therefore compare several data structu… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
10
0

Year Published

2019
2019
2022
2022

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 20 publications
(11 citation statements)
references
References 14 publications
(11 reference statements)
1
10
0
Order By: Relevance
“…The model outputs were regridded to a common grid of 1.4 × 1.4 • resolutions using the nearest neighbor interpolation technique. The nearest neighbor interpolation allowed better classification of similar close points by weighted average using data triangulation [43]. The land surfaces, particularly hilly terrains, were better interpolated due to sub-regionalization of grid points by the nearest cell center of an input grid [44].…”
Section: Methodsmentioning
confidence: 99%
“…The model outputs were regridded to a common grid of 1.4 × 1.4 • resolutions using the nearest neighbor interpolation technique. The nearest neighbor interpolation allowed better classification of similar close points by weighted average using data triangulation [43]. The land surfaces, particularly hilly terrains, were better interpolated due to sub-regionalization of grid points by the nearest cell center of an input grid [44].…”
Section: Methodsmentioning
confidence: 99%
“…There are many machine learning algorithms which are used in image recognition, and the most popular ones in machine learning mainly include multi-layer perceptron (MLP) (Mirjalili 2015), random forests (Biau et al 2009), K nearest neighbour (KNN) (Vermeulen et al 2017), Naive Bayes (NB) (Amor et al 2004) and C4.5 decision tree (Quinlan 1996). Also, the above machine learning algorithms have been used popularly in handwritten digits recognition tasks.…”
Section: Review Of Machine Learning Methodsmentioning
confidence: 99%
“…We use grid‐based spatial partitioning, a method that in most, but the densest of scenarios significantly speeds up the process of searching for neighbours . More precisely, we place a regular grid over the living area and keep track of the agents located in each cell.…”
Section: Methodsmentioning
confidence: 99%
“…To alleviate the issues that arise from the computational complexity and increase processing speed, several approaches have been suggested. Some researchers reduced the computational workload by decreasing the update frequency (an increase in reaction time) of each individual, others focused on the optimization or change of the perception and interaction system, but as individual‐based models are very suitable for parallel execution, many researchers adapted techniques from highly parallel processing . The latter is most commonly achieved via general‐purpose computing on graphics processing units (GPGPU).…”
Section: Introductionmentioning
confidence: 99%