plotboilerplate.js

Class: VoronoiCell

VoronoiCell(triangles, sharedVertex)

new VoronoiCell(triangles, sharedVertex)

The constructor.
Parameters:
Name Type Description
triangles Array:.<Triangle:> The passed triangle array must contain an ordered sequence of adjacent triangles.
sharedVertex Vertex This is the 'center' of the voronoi cell; all triangles must share that vertex.
Source:

Methods

isOpen() → {boolean}

Check if the first and the last triangle in the path are NOT connected.
Source:
Returns:
Type
boolean

isOpen() → {boolean}

Check if the first and the last triangle in the path are NOT connected.
Source:
Returns:
Type
boolean

toPathArray() → {Array:.<Vertex:>}

Convert the voronoi cell path data to an array. [vertex0, vertex1, vertex2, ... ]
Source:
Returns:
Type
Array:.<Vertex:>

toPathArray() → {Array:.<Vertex:>}

Convert the voronoi cell path data to an array. [vertex0, vertex1, vertex2, ... ]
Source:
Returns:
Type
Array:.<Vertex:>

toPathSVGString() → {string}

Convert the voronoi cell path data to an SVG polygon data string. "x0,y0 x1,y1 x2,y2 ..."
Source:
Returns:
Type
string

toPathSVGString() → {string}

Convert the voronoi cell path data to an SVG polygon data string. "x0,y0 x1,y1 x2,y2 ..."
Source:
Returns:
Type
string

toPolygon() → {Polygon}

Convert this Voronoi cell to a path polygon, consisting of all Voronoi cell corner points. Note that open Voronoi cell cannot properly converted to Polygons as they are considered infinite. 'Open' Voronoi edges will be cut off at their innermose vertices.
Source:
Returns:
Type
Polygon

toPolygon() → {Polygon}

Convert this Voronoi cell to a path polygon, consisting of all Voronoi cell corner points. Note that open Voronoi cell cannot properly converted to Polygons as they are considered infinite. 'Open' Voronoi edges will be cut off at their innermose vertices.
Source:
Returns:
Type
Polygon

VoronoiCell(circle, radiusPoint, pb)

new VoronoiCell(circle, radiusPoint, pb)

The constructor.
Parameters:
Name Type Description
circle Circle The circle to handle.
radiusPoint Vertex A point to define the radius (distance from center).
pb PlotBoilerplate The PlotBoilerplate which contains the circle and point.
Source:

Methods

isOpen() → {boolean}

Check if the first and the last triangle in the path are NOT connected.
Source:
Returns:
Type
boolean

isOpen() → {boolean}

Check if the first and the last triangle in the path are NOT connected.
Source:
Returns:
Type
boolean

toPathArray() → {Array:.<Vertex:>}

Convert the voronoi cell path data to an array. [vertex0, vertex1, vertex2, ... ]
Source:
Returns:
Type
Array:.<Vertex:>

toPathArray() → {Array:.<Vertex:>}

Convert the voronoi cell path data to an array. [vertex0, vertex1, vertex2, ... ]
Source:
Returns:
Type
Array:.<Vertex:>

toPathSVGString() → {string}

Convert the voronoi cell path data to an SVG polygon data string. "x0,y0 x1,y1 x2,y2 ..."
Source:
Returns:
Type
string

toPathSVGString() → {string}

Convert the voronoi cell path data to an SVG polygon data string. "x0,y0 x1,y1 x2,y2 ..."
Source:
Returns:
Type
string

toPolygon() → {Polygon}

Convert this Voronoi cell to a path polygon, consisting of all Voronoi cell corner points. Note that open Voronoi cell cannot properly converted to Polygons as they are considered infinite. 'Open' Voronoi edges will be cut off at their innermose vertices.
Source:
Returns:
Type
Polygon

toPolygon() → {Polygon}

Convert this Voronoi cell to a path polygon, consisting of all Voronoi cell corner points. Note that open Voronoi cell cannot properly converted to Polygons as they are considered infinite. 'Open' Voronoi edges will be cut off at their innermose vertices.
Source:
Returns:
Type
Polygon

VoronoiCell(triangles, sharedVertex)

new VoronoiCell(triangles, sharedVertex)

The constructor.
Parameters:
Name Type Description
triangles Array:.<Triangle:> The passed triangle array must contain an ordered sequence of adjacent triangles.
sharedVertex Vertex This is the 'center' of the voronoi cell; all triangles must share that vertex.
Source:

Methods

isOpen() → {boolean}

Check if the first and the last triangle in the path are NOT connected.
Source:
Returns:
Type
boolean

isOpen() → {boolean}

Check if the first and the last triangle in the path are NOT connected.
Source:
Returns:
Type
boolean

toPathArray() → {Array:.<Vertex:>}

Convert the voronoi cell path data to an array. [vertex0, vertex1, vertex2, ... ]
Source:
Returns:
Type
Array:.<Vertex:>

toPathArray() → {Array:.<Vertex:>}

Convert the voronoi cell path data to an array. [vertex0, vertex1, vertex2, ... ]
Source:
Returns:
Type
Array:.<Vertex:>

toPathSVGString() → {string}

Convert the voronoi cell path data to an SVG polygon data string. "x0,y0 x1,y1 x2,y2 ..."
Source:
Returns:
Type
string

toPathSVGString() → {string}

Convert the voronoi cell path data to an SVG polygon data string. "x0,y0 x1,y1 x2,y2 ..."
Source:
Returns:
Type
string

toPolygon() → {Polygon}

Convert this Voronoi cell to a path polygon, consisting of all Voronoi cell corner points. Note that open Voronoi cell cannot properly converted to Polygons as they are considered infinite. 'Open' Voronoi edges will be cut off at their innermose vertices.
Source:
Returns:
Type
Polygon

toPolygon() → {Polygon}

Convert this Voronoi cell to a path polygon, consisting of all Voronoi cell corner points. Note that open Voronoi cell cannot properly converted to Polygons as they are considered infinite. 'Open' Voronoi edges will be cut off at their innermose vertices.
Source:
Returns:
Type
Polygon