Class VoronoiCell

constructor

• new VoronoiCell(triangles, sharedVertex): VoronoiCell

• The constructor.

  Parameters

  • triangles: 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.

  Returns VoronoiCell

  Name

  VoronoiCell

sharedVertex

triangles

isOpen

• isOpen(): boolean

• Check if the first and the last triangle in the path are NOT connected.

  Returns boolean

  Method

  isOpen

  Instance

  Memberof

  VoronoiCell

toPathArray

• toPathArray(): Vertex[]

• Convert the voronoi cell path data to an array.

  [vertex0, vertex1, vertex2, ... ]

  Returns Vertex[]

  Method

  toPathArray

  Instance

  Memberof

  VoronoiCell

toPathSVGString

• toPathSVGString(): string

• Convert the voronoi cell path data to an SVG polygon data string.

  "x0,y0 x1,y1 x2,y2 ..."

  Returns string

  Method

  toPathSVGString

  Instance

  Memberof

  VoronoiCell

toPolygon

• 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.

  Returns Polygon

  Method

  toPolygon

  Instance

  Memberof

  VoronoiCell