Add to ORKGLet S be a set of n points in R d. The \roundness " of S can be measured by computing the width! (S) of the thinnest spherical shell (or annulus i
Two new algorithms are described for the following problems: given a set of N points in the plane d...
Given points in convex position in three dimensions, we want to find an approximating convex surface...
AbstractIn this paper we give solutions to several constrained polygon annulus placement problems fo...
We study the problem of determining whether a manufactured disc of certain radius r is within tolera...
In this paper we study the problem of computing the smallest-width annulus for a convex polytope in ...
We study the problem of computing a minimum-width annulus with outliers. Specifically, given a set o...
Given n points in a d dimensional Euclidean space, the Minimum Enclosing Ball (MEB) problem is to fi...
An algorithm is presented for computing the minimum covering sphere for a set of n points in d-dimen...
Given a set of points P = {p 1 , p 2 ,..., p n } in three dimensions, the width of P, W(P), is...
Given a set of points S = fp 1; : : : ; p n g in Euclidean d-dimensional space, we address the probl...
Let $S$ be a set of points in the plane. The width (resp.\ roundness) of $S$ is defined as the minim...
In this paper we give solutions to several constrained polygon annulus placement problems for offset...
We consider the problem of computing the outer-radii of point sets. In this problem, we are given in...
AbstractIn tolerancing, the Out-Of-Roundness factor determines the relative circularity of planar sh...
A V-shape is an infinite polygonal region bounded by two pairs of parallel rays emanating from two v...
Two new algorithms are described for the following problems: given a set of N points in the plane d...
Given points in convex position in three dimensions, we want to find an approximating convex surface...
AbstractIn this paper we give solutions to several constrained polygon annulus placement problems fo...
We study the problem of determining whether a manufactured disc of certain radius r is within tolera...
In this paper we study the problem of computing the smallest-width annulus for a convex polytope in ...
We study the problem of computing a minimum-width annulus with outliers. Specifically, given a set o...
Given n points in a d dimensional Euclidean space, the Minimum Enclosing Ball (MEB) problem is to fi...
An algorithm is presented for computing the minimum covering sphere for a set of n points in d-dimen...
Given a set of points P = {p 1 , p 2 ,..., p n } in three dimensions, the width of P, W(P), is...
Given a set of points S = fp 1; : : : ; p n g in Euclidean d-dimensional space, we address the probl...
Let $S$ be a set of points in the plane. The width (resp.\ roundness) of $S$ is defined as the minim...
In this paper we give solutions to several constrained polygon annulus placement problems for offset...
We consider the problem of computing the outer-radii of point sets. In this problem, we are given in...
AbstractIn tolerancing, the Out-Of-Roundness factor determines the relative circularity of planar sh...
A V-shape is an infinite polygonal region bounded by two pairs of parallel rays emanating from two v...
Two new algorithms are described for the following problems: given a set of N points in the plane d...
Given points in convex position in three dimensions, we want to find an approximating convex surface...
AbstractIn this paper we give solutions to several constrained polygon annulus placement problems fo...