Add to ORKGTo seek the smallest circle containing all the points of a given point set is an interesting problem in both practice and theory. In this paper, an algorithm of finding a smallest circle containing all the given points in a given point set is presented. The time complexity of the algorithm is O(|lg(d/R)|n), where R is the radius of the smallest circle and d is the smallest distance from the points of the set that are not on the circle to the circle.link_to_subscribed_fulltex
Let be a set of n colored imprecise points, where each point is colored by one of k colors. Each imp...
We present a new algorithm for labeling points with circles of equal size. Our algorithm tries to ma...
Let be a set of n colored imprecise points, where each point is colored by one of k colors. Each imp...
For a set P of n points in the plane and an integer k ≤ n, consider the problem of finding the small...
We consider the century-old problem of finding the minimum spanning circle (MSC) of N points in the ...
We present a simple iterative algorithm for computing the smallest enclosing circle and the farthest...
This paper proposed an intelligent algorithm, which can build the shortest path of the intersecting ...
AbstractWe present an efficient algorithm for solving the “smallest k-enclosing circle” (kSC) proble...
Given two sets of points ℝ and double-struck B in the plane, we address the problem of finding a set...
Let S be a set of n points in the plane and let CH(S) represent the convex hull of S. The Largest Em...
Given a set of circles C = {c₁, ..., cn}on the Euclidean plane with centers {(a₁, b₁), ..., (an, bn)...
Abstract—Given two sets of points R and B in the plane, we address the problem of finding a set of c...
The algorithm presented has been rigorously tested for various sets of data points obtained both fro...
In this paper we deal with the following problem: Given a set B consisting of n points, not all on a...
10.1023/A:1022977709811Computational Optimization and Applications251-3283-292CPPP
Let be a set of n colored imprecise points, where each point is colored by one of k colors. Each imp...
We present a new algorithm for labeling points with circles of equal size. Our algorithm tries to ma...
Let be a set of n colored imprecise points, where each point is colored by one of k colors. Each imp...
For a set P of n points in the plane and an integer k ≤ n, consider the problem of finding the small...
We consider the century-old problem of finding the minimum spanning circle (MSC) of N points in the ...
We present a simple iterative algorithm for computing the smallest enclosing circle and the farthest...
This paper proposed an intelligent algorithm, which can build the shortest path of the intersecting ...
AbstractWe present an efficient algorithm for solving the “smallest k-enclosing circle” (kSC) proble...
Given two sets of points ℝ and double-struck B in the plane, we address the problem of finding a set...
Let S be a set of n points in the plane and let CH(S) represent the convex hull of S. The Largest Em...
Given a set of circles C = {c₁, ..., cn}on the Euclidean plane with centers {(a₁, b₁), ..., (an, bn)...
Abstract—Given two sets of points R and B in the plane, we address the problem of finding a set of c...
The algorithm presented has been rigorously tested for various sets of data points obtained both fro...
In this paper we deal with the following problem: Given a set B consisting of n points, not all on a...
10.1023/A:1022977709811Computational Optimization and Applications251-3283-292CPPP
Let be a set of n colored imprecise points, where each point is colored by one of k colors. Each imp...
We present a new algorithm for labeling points with circles of equal size. Our algorithm tries to ma...
Let be a set of n colored imprecise points, where each point is colored by one of k colors. Each imp...