Add to ORKGAbstract. Extending results of Hershberger and Suri for the Euclidean plane, we show that ball hulls and ball intersections of sets of n points in normed planes can be constructed in O(n log n) time. In addition, we confirm that the 2-center problem with constrained circles for arbitrary normed planes can be solved in O(n2) time. Some ideas about the geometric structure of the ball hull in a normed plane are also presented.
We give fast randomized and deterministic parallel meth-ods for constructing convex hulls in IRd, fo...
Let P be a set of n points in R³. The 2-center problem for P is to find two congruent balls of minim...
Given a set S of n points in the plane, the disjoint two-rectangle covering problem is to find a pai...
Extending results of Hershberger and Suri for the Euclidean plane, we show that ball hulls and ball ...
Ampliar los resultados de Hershberger y Suri para el plano euclidiano, nos demuestra que los cascos ...
Ampliar los resultados de Hershberger y Suri para el plano euclidiano, nos demuestra que los cascos ...
The notions of ball hull and ball intersection of nite sets, important in Banach space theory, are e...
The notions of ball hull and ball intersection of nite sets, important in Banach space theory, are e...
This work refers to ball-intersections bodies as well as covering, packing, and kissing problems rel...
We investigate the algorithmic complexity of several geometric problems of the following type: given...
Let P be a set of n points in ?^d in general position. A median hyperplane (roughly) splits the poin...
We study the parameterized complexity of the k-center problem on an given n-point set P in Rd, with ...
Improving on a recent breakthrough of Sharir, we show how to find two circular disks of minimum radi...
AbstractWe show that the convex hull of a set of discs can be determined in Θ(n log n) time. The alg...
Let P be a set of n points in the plane and O be a set of k, 2 ≤ k ≤ n, different orientations in th...
We give fast randomized and deterministic parallel meth-ods for constructing convex hulls in IRd, fo...
Let P be a set of n points in R³. The 2-center problem for P is to find two congruent balls of minim...
Given a set S of n points in the plane, the disjoint two-rectangle covering problem is to find a pai...
Extending results of Hershberger and Suri for the Euclidean plane, we show that ball hulls and ball ...
Ampliar los resultados de Hershberger y Suri para el plano euclidiano, nos demuestra que los cascos ...
Ampliar los resultados de Hershberger y Suri para el plano euclidiano, nos demuestra que los cascos ...
The notions of ball hull and ball intersection of nite sets, important in Banach space theory, are e...
The notions of ball hull and ball intersection of nite sets, important in Banach space theory, are e...
This work refers to ball-intersections bodies as well as covering, packing, and kissing problems rel...
We investigate the algorithmic complexity of several geometric problems of the following type: given...
Let P be a set of n points in ?^d in general position. A median hyperplane (roughly) splits the poin...
We study the parameterized complexity of the k-center problem on an given n-point set P in Rd, with ...
Improving on a recent breakthrough of Sharir, we show how to find two circular disks of minimum radi...
AbstractWe show that the convex hull of a set of discs can be determined in Θ(n log n) time. The alg...
Let P be a set of n points in the plane and O be a set of k, 2 ≤ k ≤ n, different orientations in th...
We give fast randomized and deterministic parallel meth-ods for constructing convex hulls in IRd, fo...
Let P be a set of n points in R³. The 2-center problem for P is to find two congruent balls of minim...
Given a set S of n points in the plane, the disjoint two-rectangle covering problem is to find a pai...