FINDING CURVES'S CONVERGENCE USING DELAUNAY SEARCH

Data Convergence is a common problem in many fields. There are several ways to solve this problem. In this paper, we present an new way using a distance optimization approach called Delaunay Search. This approach finds the point which yields the shortest distance to different groups of data in the network of data. The new approach is compared to two other methods and guarantees to find the solution at a promising run time.