Density approximation for moving groups
This paper presents theoretical results concerning the study of the shape of a moving group. More precisely, by combining several approximation techniques, the research addresses main issues that could be the starting point of any algorithm aimed to study how the density peaks of a moving group change over time. The mathematical problem consists of a set \(P\) of \(n\) moving points in \(\mathbb R^2\); the points follow piecewise linear motion and are contained in a bounding box \(D = [0, D]\times[0, D]\) with size parameter \(D\). The aim is to monitor the density of \(P\) over time, where the density is measured using the kernel density estimation (KDE). A specific type of coreset used to estimate the density, namely the \(\varepsilon\)-approximation, is then used. Finally, a kinetic data structure (KDS) that efficiently tracks persistent local maxima of a KDE on a set of linearly moving points \(P\) is defined.
This page was built for publication: Density approximation for moving groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6994347)
