Add to ORKGA dynamic data structure is given that maintains the minimal distance in a set of $n$ points in $k$-dimensiona
Our aim is to develop dynamic data structures that support k-nearest neighbors (k-NN) queries for a ...
We maintain the minimum spanning tree of a point set in the plane, subject to point insertions and d...
International audienceGiven a set P of n points and a constant k, we are interested in computing the...
A dynamic data structure is given that maintains the minimal distance in a set of $n$ points in $k$-...
A dynamic data structure is given that maintains the minimal distance of a set of n points in k-dime...
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...
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 ...
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...
In this paper, we present a kinetic data structure for calculating the minimum spanning circle of a ...
Measuring the similarity or distance between sets of points in a metric space is an important proble...
Let S be a set of n moving points in the plane. We give new ecient and compact kinetic data structur...
International audienceGiven a set P of n points and a constant k, we are interested in computing the...
Our aim is to develop dynamic data structures that support k-nearest neighbors (k-NN) queries for a ...
We maintain the minimum spanning tree of a point set in the plane, subject to point insertions and d...
International audienceGiven a set P of n points and a constant k, we are interested in computing the...
A dynamic data structure is given that maintains the minimal distance in a set of $n$ points in $k$-...
A dynamic data structure is given that maintains the minimal distance of a set of n points in k-dime...
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...
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 ...
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...
In this paper, we present a kinetic data structure for calculating the minimum spanning circle of a ...
Measuring the similarity or distance between sets of points in a metric space is an important proble...
Let S be a set of n moving points in the plane. We give new ecient and compact kinetic data structur...
International audienceGiven a set P of n points and a constant k, we are interested in computing the...
Our aim is to develop dynamic data structures that support k-nearest neighbors (k-NN) queries for a ...
We maintain the minimum spanning tree of a point set in the plane, subject to point insertions and d...
International audienceGiven a set P of n points and a constant k, we are interested in computing the...