voronoi

An <code>voronoi</code> object is created with <code>voronoi.mosaic
</code>

spatial

A constrained two-dimensional Delaunay triangulation package
providing both triangulation and generation of voronoi mosaics of
irregular spaced data.
Please note that most of the functions are now also covered in package
interp, which is a re-implementation from scratch under a free license
based on a different triangulation algorithm.

Fortran code by R J Renka R functions by Albrecht Gebhardt  With contributions from Stephen Eglen stephenancedacuk

tripack

Triangulation of Irregularly Spaced Data

Albrecht Gebhardt

R. J. Renka

Stephen Eglen

Sergej Zuyev

Denis White

voronoi function

Author

<dl> <dt>x,y</dt>
<dd>x and y coordinates of nodes of the voronoi mosaic. Each node is a
 circumcircle center of some triangle from the Delaunay triangulation.</dd> <dt>node</dt>
<dd>logical vector, indicating real nodes of the voronoi
 mosaic. These nodes are the centers of circumcircles of triangles with 
 positive area of the delaunay triangulation.
If <code>node[i]</code>=<code>FALSE</code>, (<code>c[i]</code>,<code>x[i]</code>) belongs to a 
 triangle with area 0.</dd><dt>n1,n2,n3</dt>
<dd>indices of neighbour nodes. Negative indices indicate
 dummy points as neighbours.</dd><dt>tri</dt>
<dd>triangulation object, see <code>tri</code>.</dd><dt>area</dt>
<dd>area of triangle i. <code>area[i]</code>=-1 indicates a removed
 triangle with area 0 at the border of the triangulation.</dd><dt>ratio</dt>
<dd>aspect ratio (inscribed radius/circumradius) of triangle
 i.</dd><dt>radius</dt>
<dd>circumradius of triangle i.</dd><dt>dummy.x,dummy.y</dt>
<dd>x and y coordinates of dummy points. They are
 used for plotting of unbounded tiles.</dd></dl>

Arguments

Voronoi object — voronoi

<dl>

 <dt>x,y</dt>
<dd>x and y coordinates of nodes of the voronoi mosaic. Each node is a
 circumcircle center of some triangle from the Delaunay triangulation.</dd>

 <dt>node</dt>
<dd>logical vector, indicating real nodes of the voronoi
 mosaic. These nodes are the centers of circumcircles of triangles with 
 positive area of the delaunay triangulation.
If <code>node[i]</code>=<code>FALSE</code>, (<code>c[i]</code>,<code>x[i]</code>) belongs to a 
 triangle with area 0.</dd>

<dt>n1,n2,n3</dt>
<dd>indices of neighbour nodes. Negative indices indicate
 dummy points as neighbours.</dd>

<dt>tri</dt>
<dd>triangulation object, see <code>tri</code>.</dd>

<dt>area</dt>
<dd>area of triangle i. <code>area[i]</code>=-1 indicates a removed
 triangle with area 0 at the border of the triangulation.</dd>

<dt>ratio</dt>
<dd>aspect ratio (inscribed radius/circumradius) of triangle
 i.</dd>

<dt>radius</dt>
<dd>circumradius of triangle i.</dd>

<dt>dummy.x,dummy.y</dt>
<dd>x and y coordinates of dummy points. They are
 used for plotting of unbounded tiles.</dd>

</dl>

voronoi: Voronoi object

Description

Author

Arguments

See Also