We consider a problem of finding a point in the intersection of n balls in the Euclidean space E^m. For the case m=2 we suggest two algorithms of the complexity O(n^2 logn) and O(n^3 ) operations, respectively. For the general case we suggest an exact polynomial recursive algorithm which uses the orthogonal transformation of the space E^m
Abstract. In this article, we study the intersection (or union) of the convex hull of N confocal par...
Three classes of geometric intersection searching problems are considered, i.e., problems in which a...
In geometric pattern matching, we are given two sets of points P and Q in d dimensions, and the prob...
We investigate the algorithmic complexity of several geometric problems of the following type: given...
The problem of determining the points of intersection of n spheres in IRn has many applications. Exa...
AbstractWe describe an algorithm for computing the intersection of n balls of equal radius in R3 whi...
Orientadores: Carlile Campos Lavor, Jose Mario MartinezDissertação (mestrado profissional) - Univers...
We investigate a divide-and-conquer technique in multidimensional space which decomposes a geometric...
The problem of determining the points of intersection of n spheres in R n has many applicatio...
The problem of determining the points of intersection of n spheres in R n has many applicatio...
The problem of determining the points of intersection of n spheres in R n has many applicatio...
The problem of determining the points of intersection of n spheres in R n has many applicatio...
Extending results of Hershberger and Suri for the Euclidean plane, we show that ball hulls and ball ...
Abstract. Extending results of Hershberger and Suri for the Euclidean plane, we show that ball hulls...
Neste trabalho, abordamos o problema da determinação de pontos de intersecção de n esferas no Rn. Es...
Abstract. In this article, we study the intersection (or union) of the convex hull of N confocal par...
Three classes of geometric intersection searching problems are considered, i.e., problems in which a...
In geometric pattern matching, we are given two sets of points P and Q in d dimensions, and the prob...
We investigate the algorithmic complexity of several geometric problems of the following type: given...
The problem of determining the points of intersection of n spheres in IRn has many applications. Exa...
AbstractWe describe an algorithm for computing the intersection of n balls of equal radius in R3 whi...
Orientadores: Carlile Campos Lavor, Jose Mario MartinezDissertação (mestrado profissional) - Univers...
We investigate a divide-and-conquer technique in multidimensional space which decomposes a geometric...
The problem of determining the points of intersection of n spheres in R n has many applicatio...
The problem of determining the points of intersection of n spheres in R n has many applicatio...
The problem of determining the points of intersection of n spheres in R n has many applicatio...
The problem of determining the points of intersection of n spheres in R n has many applicatio...
Extending results of Hershberger and Suri for the Euclidean plane, we show that ball hulls and ball ...
Abstract. Extending results of Hershberger and Suri for the Euclidean plane, we show that ball hulls...
Neste trabalho, abordamos o problema da determinação de pontos de intersecção de n esferas no Rn. Es...
Abstract. In this article, we study the intersection (or union) of the convex hull of N confocal par...
Three classes of geometric intersection searching problems are considered, i.e., problems in which a...
In geometric pattern matching, we are given two sets of points P and Q in d dimensions, and the prob...
DOI
Add to ORKG