src/cdtGen.cpp
/*! \fn CDTGenerator::correspondingVerticesInLCC(Delaunay::Cell_handle c1, size_t neighborID, DegenerateVertexSet &vertexSet)
 *  \brief Determines Dart handles to vertices involved in given degeneracy set.
 *  \param [in] c1 Handle to first cell.
 *  \param [in] neighborID Index of neighbor in c1.
 *  \param [out] vertexSet Vector of dart handles to vertices of LCC.
 */
\fn CDTGenerator::correspondingVerticesInLCC(Delaunay::Cell_handle c1, size_t neighborID, DegenerateVertexSet &vertexSet)
\brief Determines Dart handles to vertices involved in given degeneracy set.
\param [in] c1 Handle to first cell.
\param [in] neighborID Index of neighbor in c1.
\param [out] vertexSet Vector of dart handles to vertices of LCC.
\ fn CDTGenerator :: correspondingVerticesInLCC ( Delaunay :: Cell_handle c1 size_t neighborID DegenerateVertexSet &vertexSet ) \ brief Determines Dart handles to vertices involved in given degeneracy set . \ param [ in ] c1 Handle to first cell . \ param [ in ] neighborID Index of neighbor in c1 . \ param [ out ] vertexSet Vector of dart handles to vertices of LCC .
void CDTGenerator::correspondingVerticesInLCC(Delaunay::Cell_handle c1, size_t neighborID, DegenerateVertexSet &vertexSet)
{
	Delaunay::Cell_handle c2 = c1->neighbor(neighborID);
	size_t k = 0;
	for (size_t n = 0; n < 4; n++)
	{
		for (LCC::One_dart_per_cell_range<0>::iterator pHandle = plc.one_dart_per_cell<0>().begin(), pHandleEnd = plc.one_dart_per_cell<0>().end(); pHandle != pHandleEnd; pHandle++)
		{
			if (plc.point(pHandle) == c1->vertex(n)->point())
				vertexSet.vertHandles[k++] = pHandle;
			else
				continue;
		}
	}
	size_t neighborVertexIndex = DT.mirror_index(c1, neighborID);
	for (LCC::One_dart_per_cell_range<0>::iterator pHandle = plc.one_dart_per_cell<0>().begin(), pHandleEnd = plc.one_dart_per_cell<0>().end(); pHandle != pHandleEnd; pHandle++)
			if (plc.point(pHandle) == c2->vertex(neighborVertexIndex)->point())
				vertexSet.vertHandles[k++] = pHandle;
			else
				continue;
}
void CDTGenerator :: correspondingVerticesInLCC ( Delaunay :: Cell_handle c1 , size_t neighborID , DegenerateVertexSet & vertexSet ) { Delaunay :: Cell_handle c2 = c1 -> neighbor ( neighborID ) ; size_t k = 0 ; for ( size_t n = 0 ; n < 4 ; n ++ ) { for ( LCC :: One_dart_per_cell_range < 0 > :: iterator pHandle = plc . one_dart_per_cell < 0 > ( ) . begin ( ) , pHandleEnd = plc . one_dart_per_cell < 0 > ( ) . end ( ) ; pHandle != pHandleEnd ; pHandle ++ ) { if ( plc . point ( pHandle ) == c1 -> vertex ( n ) -> point ( ) ) vertexSet . vertHandles [ k ++ ] = pHandle ; else continue ; } } size_t neighborVertexIndex = DT . mirror_index ( c1 , neighborID ) ; for ( LCC :: One_dart_per_cell_range < 0 > :: iterator pHandle = plc . one_dart_per_cell < 0 > ( ) . begin ( ) , pHandleEnd = plc . one_dart_per_cell < 0 > ( ) . end ( ) ; pHandle != pHandleEnd ; pHandle ++ ) if ( plc . point ( pHandle ) == c2 -> vertex ( neighborVertexIndex ) -> point ( ) ) vertexSet . vertHandles [ k ++ ] = pHandle ; else continue ; }
\fn CDTGenerator::correspondingVerticesInLCC(Delaunay::Cell_handle c1, size_t neighborID, DegenerateVertexSet &vertexSet)
  \brief Determines Dart handles to vertices involved in given degeneracy set.
\ fn CDTGenerator :: correspondingVerticesInLCC ( Delaunay :: Cell_handle c1 size_t neighborID DegenerateVertexSet &vertexSet ) \ brief Determines Dart handles to vertices involved in given degeneracy set .
// search for every vertex in cells inside plc  // add the vertex from c2 as well