Voronoi mosaic
This function creates a Voronoi mosaic out of a given set of arbitraryly located points in the plane. Each cell of a voronoi mosaic is associated with a data point and contains all points (x,y) closest to this data point.
voronoi.mosaic(x, y = NULL, duplicate = "error")
x |
vector containing x coordinates of the data. If
|
y |
vector containing y coordinates of the data. Can be omitted if
|
duplicate |
flag indicating how to handle duplicate elements. Possible values are:
|
The function creates first a Delaunay triangulation (if not already given), extracts the circumcircle centers of these triangles, and then connects these points according to the neighbourhood relations between the triangles.
An object of class voronoi.
This function is meant as a replacement for
voronoi.mosaic from package tripack.
Please note that the underlying triangulation uses a
different algorithm, see tri.mesh. Contrary to
tri.mesh this should not affect the result for non
unique triangulations e.g. on regular grids as the voronoi mosaic in
this case will still be unique.
The arguments are backward compatible, even the returned object should be
compatible with functions from package tripack.
Albrecht Gebhardt <albrecht.gebhardt@aau.at>, Roger Bivand <roger.bivand@nhh.no>
G. Voronoi, Nouvelles applications des parametres continus a la theorie des formes quadratiques. Deuxieme memoire. Recherches sur les parallelloedres primitifs, Journal fuer die reine und angewandte Mathematik, 1908, vol 134, p. 198-287
data(franke) fd <- franke$ds3 vr <- voronoi.mosaic(fd$x, fd$y) summary(vr)
Please choose more modern alternatives, such as Google Chrome or Mozilla Firefox.