Voronoi Diagrams Based Function Identification
نویسندگان
چکیده
Evolutionary algorithms have been applied to function identification problems with great success. This paper presents an approach in which the individuals represent a partition of the input space in Voronoi regions together with a set of local functions associated to each one of these regions. In this way, the solution corresponds to a combination of local functions over a spatial structure topologically represented by a Voronoi diagram. Experiments show that the evolutionary algorithm can successfully evolve both the partition of the input space and the parameters of the local functions in simple problems.
منابع مشابه
Voronoi Diagrams for Polygon-Offset Distance Functions
In this paper we develop the concept of a polygon-ooset distance function and show how to compute the respective nearest-and furthest-site Voronoi diagrams of point sites in the plane. We provide optimal deterministic O(n(log n + log m) + m)-time algorithms, where n is the number of points and m is the complexity of the underlying polygon, for computing compact representations of both diagrams.
متن کاملHierarchical Data Representations Based on Planar Voronoi Diagrams
Multiresolution representation of high-dimensional scattered data is a fundamental problem in scientific visualization. This paper introduces a data hierarchy of Voronoi diagrams as a versatile solution. Given an arbitrary set of points in the plane, our goal is the construction of an approximation hierarchy using the Voronoi diagram as the essential building block. We have implemented two Voro...
متن کاملVoronoi Diagrams for Convex Polygon-Offset Distance Functions
In this paper we develop the concept of a convex polygon-offset distance function. Using offset as a notion of distance, we show how to compute the corresponding nearestand furthest-site Voronoi diagrams of point sites in the plane. We provide nearoptimal deterministic O(n(log n + log m) + m)-time algorithms, where n is the number of points and m is the complexity of the underlying polygon, for...
متن کاملRandomized construction diagrams * incremental of abstract Voronoi Rolf
Abstract Voronoi diagrams were introduced by R. Klein (1988) as an axiomatic basis of Voronoi diagrams. We show how to construct abstract Voronoi diagrams in time O(n log n) by a randomized algorithm, which is based on Clarkson and Shor’s randomized incremental construction technique (1989). The new algorithm has the following advantages over previous algorithms: l It can handle a much wider cl...
متن کاملAbstract Voronoi diagrams revisited
Voronoi Diagrams Revisited Rolf Klein∗ Elmar Langetepe∗ Zahra Nilforoushan† Abstract Abstract Voronoi diagrams [21] were designed as a unifying concept that should include as many concrete types of diagrams as possible. To ensure that abstract Voronoi diagrams, built from given sets of bisecting curves, are finite graphs, it was required that any two bisecting curves intersect only finitely oft...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003