A dynamic data structure is given that maintains the minimal distance of a set of n points in k-dimensional space in O((log n)^{k+2}) amortized time per update. The size of data structure is bounded by O(n(log n)^{k}). Distances are measured in an arbitrary Minkowski L_{t}-metric, where 1\leq t\leq\infty. This is the first dynamic data structure that maintains the minimal distance in polylogarithmic time, when arbitrary updates are performed
We describe a new data structure for dynamic nearest neighbor queries in the plane with respect to a...
We maintain the minimum spanning tree of a point set in the plane, subject to point insertions and d...
We give a data structure that allows arbitrary insertions and deletions on a planar point set P and ...
A dynamic data structure is given that maintains the minimal distance in a set of $n$ points in $k$-...
Consider a set of n points in d-dimensional space. It is shown that the ordered sequence of O(n^{2/3...
We present simple fully dynamic and kinetic data structures, which are variants of a dynamic 2-dimen...
Let $S$ be a set of $n$ points in $\IR^{D}$. It is shown that a range tree can be used to find an $L...
. Let S be a set of n points in IR D . It is shown that a range tree can be used to find an L1-neare...
The discrete Fréchet distance is a measure of similarity between point sequences which permits to a...
AbstractThis paper presents a kinetic data structure (KDS) for maintenance of the Euclidean minimum ...
Dynamic Time Warping (DTW) and Geometric Edit Distance (GED) are basic similarity measures between c...
Our aim is to develop dynamic data structures that support k-nearest neighbors (k-NN) queries for a ...
Measuring the similarity or distance between sets of points in a metric space is an important proble...
We give an algorithm that maintains an approximation of the width of a set of $n$ points in the plan...
A dynamic geometric data stream is a sequence of m ADD/REMOVE operations of points from a discrete g...
We describe a new data structure for dynamic nearest neighbor queries in the plane with respect to a...
We maintain the minimum spanning tree of a point set in the plane, subject to point insertions and d...
We give a data structure that allows arbitrary insertions and deletions on a planar point set P and ...
A dynamic data structure is given that maintains the minimal distance in a set of $n$ points in $k$-...
Consider a set of n points in d-dimensional space. It is shown that the ordered sequence of O(n^{2/3...
We present simple fully dynamic and kinetic data structures, which are variants of a dynamic 2-dimen...
Let $S$ be a set of $n$ points in $\IR^{D}$. It is shown that a range tree can be used to find an $L...
. Let S be a set of n points in IR D . It is shown that a range tree can be used to find an L1-neare...
The discrete Fréchet distance is a measure of similarity between point sequences which permits to a...
AbstractThis paper presents a kinetic data structure (KDS) for maintenance of the Euclidean minimum ...
Dynamic Time Warping (DTW) and Geometric Edit Distance (GED) are basic similarity measures between c...
Our aim is to develop dynamic data structures that support k-nearest neighbors (k-NN) queries for a ...
Measuring the similarity or distance between sets of points in a metric space is an important proble...
We give an algorithm that maintains an approximation of the width of a set of $n$ points in the plan...
A dynamic geometric data stream is a sequence of m ADD/REMOVE operations of points from a discrete g...
We describe a new data structure for dynamic nearest neighbor queries in the plane with respect to a...
We maintain the minimum spanning tree of a point set in the plane, subject to point insertions and d...
We give a data structure that allows arbitrary insertions and deletions on a planar point set P and ...
DOI
Add to ORKG