Class Delaunay

Classdesc

A Delaunay pointset triangulation implementation. Inspired by http://www.travellermap.com/tmp/delaunay.htm

License: Public Domain Original C++ code by Joshua Bell

Requires

Triangle

Requires

Line

Requires

Vertex

Index

Constructors

Properties

Methods

AddVertex Triangulate createBoundingTriangle mkUniqueEdges triangulate

Constructors

constructor

new Delaunay(pointList): Delaunay
Parameters
- pointList: Vertex[]
Returns Delaunay
- Defined in src/ts/utils/algorithms/delaunay.ts:34

Properties

`Private` pointList

pointList: Vertex[]

Methods

AddVertex

AddVertex(vertex, triangles): void
Parameters
- vertex: Vertex
- triangles: Triangle[]
Returns void
- Defined in src/ts/utils/algorithms/delaunay.ts:128

Triangulate

Triangulate(vertices): Triangle[]
Parameters
- vertices: Vertex[]
Returns Triangle[]
- Defined in src/ts/utils/algorithms/delaunay.ts:67

createBoundingTriangle

createBoundingTriangle(vertices): Triangle
Parameters
- vertices: Vertex[]
Returns Triangle
- Defined in src/ts/utils/algorithms/delaunay.ts:101

mkUniqueEdges

mkUniqueEdges(edges): Line[]
Parameters
- edges: Line[]
Returns Line[]
- Defined in src/ts/utils/algorithms/delaunay.ts:156

triangulate

triangulate(): Triangle[]
Returns Triangle[]
- Defined in src/ts/utils/algorithms/delaunay.ts:38

Generated using TypeDoc