\hypertarget{class_edge_algebra_1_1_delaunay_triangulation}{
\section{EdgeAlgebra::DelaunayTriangulation Class Reference}
\label{class_edge_algebra_1_1_delaunay_triangulation}\index{EdgeAlgebra::DelaunayTriangulation@{EdgeAlgebra::DelaunayTriangulation}}
}
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 \char`\"{}Primitives for the Manipulation of General Subdivisions and the Computation of Voronoi Diagrams\char`\"{}.  


{\tt \#include $<$DelaunayTriangulation.h$>$}

\subsection*{Public Member Functions}
\begin{CompactItemize}
\item 
\hyperlink{class_edge_algebra_1_1_delaunay_triangulation_f8ddf3e0e54c1821e71f35a7d2fffba2}{DelaunayTriangulation} (const std::vector$<$ Site $\ast$ $>$ \&sites)
\item 
\hypertarget{class_edge_algebra_1_1_delaunay_triangulation_ab1619efe0c3f1f7efa1a41347459c86}{
\hyperlink{class_edge_algebra_1_1_delaunay_triangulation_ab1619efe0c3f1f7efa1a41347459c86}{$\sim$DelaunayTriangulation} (void)}
\label{class_edge_algebra_1_1_delaunay_triangulation_ab1619efe0c3f1f7efa1a41347459c86}

\begin{CompactList}\small\item\em Destructor. \item\end{CompactList}\item 
QuadEdge $\ast$ \hyperlink{class_edge_algebra_1_1_delaunay_triangulation_4015bab75f553947696e26da61192dbe}{GetLeftHalve} (void) const 
\begin{CompactList}\small\item\em Gets the left halve of the triangulation. \item\end{CompactList}\item 
QuadEdge $\ast$ \hyperlink{class_edge_algebra_1_1_delaunay_triangulation_27b7d32eacc57b7a9d90c97e44d058a6}{GetRightHalve} (void) const 
\begin{CompactList}\small\item\em Gets the right halve of the triangulation. \item\end{CompactList}\end{CompactItemize}


\subsection{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 \char`\"{}Primitives for the Manipulation of General Subdivisions and the Computation of Voronoi Diagrams\char`\"{}. 

\subsection{Constructor \& Destructor Documentation}
\hypertarget{class_edge_algebra_1_1_delaunay_triangulation_f8ddf3e0e54c1821e71f35a7d2fffba2}{
\index{EdgeAlgebra::DelaunayTriangulation@{EdgeAlgebra::DelaunayTriangulation}!DelaunayTriangulation@{DelaunayTriangulation}}
\index{DelaunayTriangulation@{DelaunayTriangulation}!EdgeAlgebra::DelaunayTriangulation@{EdgeAlgebra::DelaunayTriangulation}}
\subsubsection[{DelaunayTriangulation}]{\setlength{\rightskip}{0pt plus 5cm}DelaunayTriangulation::DelaunayTriangulation (const std::vector$<$ Site $\ast$ $>$ \& {\em sites})}}
\label{class_edge_algebra_1_1_delaunay_triangulation_f8ddf3e0e54c1821e71f35a7d2fffba2}


Constructor \begin{Desc}
\item[Parameters:]
\begin{description}
\item[{\em sites}]the array of sites to be triangulated \end{description}
\end{Desc}


\subsection{Member Function Documentation}
\hypertarget{class_edge_algebra_1_1_delaunay_triangulation_4015bab75f553947696e26da61192dbe}{
\index{EdgeAlgebra::DelaunayTriangulation@{EdgeAlgebra::DelaunayTriangulation}!GetLeftHalve@{GetLeftHalve}}
\index{GetLeftHalve@{GetLeftHalve}!EdgeAlgebra::DelaunayTriangulation@{EdgeAlgebra::DelaunayTriangulation}}
\subsubsection[{GetLeftHalve}]{\setlength{\rightskip}{0pt plus 5cm}QuadEdge $\ast$ DelaunayTriangulation::GetLeftHalve (void) const}}
\label{class_edge_algebra_1_1_delaunay_triangulation_4015bab75f553947696e26da61192dbe}


Gets the left halve of the triangulation. 

\begin{Desc}
\item[Returns:]left halve of the triangulation \end{Desc}
\hypertarget{class_edge_algebra_1_1_delaunay_triangulation_27b7d32eacc57b7a9d90c97e44d058a6}{
\index{EdgeAlgebra::DelaunayTriangulation@{EdgeAlgebra::DelaunayTriangulation}!GetRightHalve@{GetRightHalve}}
\index{GetRightHalve@{GetRightHalve}!EdgeAlgebra::DelaunayTriangulation@{EdgeAlgebra::DelaunayTriangulation}}
\subsubsection[{GetRightHalve}]{\setlength{\rightskip}{0pt plus 5cm}QuadEdge $\ast$ DelaunayTriangulation::GetRightHalve (void) const}}
\label{class_edge_algebra_1_1_delaunay_triangulation_27b7d32eacc57b7a9d90c97e44d058a6}


Gets the right halve of the triangulation. 

\begin{Desc}
\item[Returns:]right halve of the triangulation \end{Desc}


The documentation for this class was generated from the following files:\begin{CompactItemize}
\item 
src/source/\hyperlink{_delaunay_triangulation_8h}{DelaunayTriangulation.h}\item 
src/source/\hyperlink{_delaunay_triangulation_8cpp}{DelaunayTriangulation.cpp}\end{CompactItemize}
