Add to ORKGAbstract. We define the notion of a well-separated pair decomposition of points in d-dimensional space. We then develop efficient sequential and parallel algorithms for computing such a decomposition. We apply the resulting decomposition to the efficient computation of k-nearest neighbors and n-body potential fields
We present an external memory algorithm to compute a well-separated pair decomposition (WSPD) of a g...
ABSTRACT The well-separated pair decomposition (WSPD) is a fundamental structure in computational ge...
Abstract Given a point set in a fixed dimension, we note that a well-separated pair decomposition ca...
Abstract. We define the notion of a well-separated pair decomposition of points in d-dimensional spa...
We present a general technique for dynamizing certain problems posed on point sets in Euclidean spac...
Content from this work may be used under the terms of the Creative Commons Attribution 3.0 licence. ...
One of the most challenging problems in computational geometry is closest pair of points given n poi...
This dissertation develops and studies fast algorithms for solving closest point problems. Algorithm...
Given a set S of n points in IR D , D 2. Each point p 2 S is assigned a color c(p) chosen from a ...
We propose to build a concurrent processor based on an 4 by 4 by 4 array of microprocessors. These a...
We introduce a new class of parallel algorithms for the exact computation of systems with pairwise m...
International audienceWe propose a new method for accelerating the computation of a concurrency rela...
In this note we describe deterministic parallel algorithms for planar point location and for buildin...
We present an ecient and provably good partitioning and load balancing algorithm for parallel adapti...
This paper describes several parallel algorithms that solve geometric problems. The algorithms are b...
We present an external memory algorithm to compute a well-separated pair decomposition (WSPD) of a g...
ABSTRACT The well-separated pair decomposition (WSPD) is a fundamental structure in computational ge...
Abstract Given a point set in a fixed dimension, we note that a well-separated pair decomposition ca...
Abstract. We define the notion of a well-separated pair decomposition of points in d-dimensional spa...
We present a general technique for dynamizing certain problems posed on point sets in Euclidean spac...
Content from this work may be used under the terms of the Creative Commons Attribution 3.0 licence. ...
One of the most challenging problems in computational geometry is closest pair of points given n poi...
This dissertation develops and studies fast algorithms for solving closest point problems. Algorithm...
Given a set S of n points in IR D , D 2. Each point p 2 S is assigned a color c(p) chosen from a ...
We propose to build a concurrent processor based on an 4 by 4 by 4 array of microprocessors. These a...
We introduce a new class of parallel algorithms for the exact computation of systems with pairwise m...
International audienceWe propose a new method for accelerating the computation of a concurrency rela...
In this note we describe deterministic parallel algorithms for planar point location and for buildin...
We present an ecient and provably good partitioning and load balancing algorithm for parallel adapti...
This paper describes several parallel algorithms that solve geometric problems. The algorithms are b...
We present an external memory algorithm to compute a well-separated pair decomposition (WSPD) of a g...
ABSTRACT The well-separated pair decomposition (WSPD) is a fundamental structure in computational ge...
Abstract Given a point set in a fixed dimension, we note that a well-separated pair decomposition ca...