# EdgeAlgebra::DelaunayTriangulation Class Reference

Triangulates a given array of unordered sites using a delaunay triangulation algorithm. The algorithm used is the one described by Guibas and Stolfi in the paper named "Primitives for the Manipulation of General Subdivisions and the Computation of Voronoi Diagrams". More...

`#include <DelaunayTriangulation.h>`

List of all members.

## Public Member Functions
| DelaunayTriangulation (const std::vector< Site * > &sites)
| ~DelaunayTriangulation (void)
| Destructor.
QuadEdge * | GetLeftHalve (void) const
| Gets the left halve of the triangulation.
QuadEdge * | GetRightHalve (void) const
| Gets the right halve of the triangulation.

## Detailed Description

Triangulates a given array of unordered sites using a delaunay triangulation algorithm. The algorithm used is the one described by Guibas and Stolfi in the paper named "Primitives for the Manipulation of General Subdivisions and the Computation of Voronoi Diagrams".

## Constructor & Destructor Documentation

DelaunayTriangulation::DelaunayTriangulation | ( | const std::vector< Site * > & | sites | ) |

Constructor

Parameters:

  | sites | the array of sites to be triangulated

## Member Function Documentation

QuadEdge * DelaunayTriangulation::GetLeftHalve | ( | void |  | ) | const

Gets the left halve of the triangulation.

Returns:
  left halve of the triangulation

QuadEdge * DelaunayTriangulation::GetRightHalve | ( | void |  | ) | const

Gets the right halve of the triangulation.

Returns:
  right halve of the triangulation

The documentation for this class was generated from the following files:

- src/source/DelaunayTriangulation.h
- src/source/DelaunayTriangulation.cpp