diff --git a/CDT/include/Triangulation.h b/CDT/include/Triangulation.h index d9131c6..267afff 100644 --- a/CDT/include/Triangulation.h +++ b/CDT/include/Triangulation.h @@ -127,7 +127,7 @@ class CDT_EXPORT Triangulation public: typedef std::vector > V2dVec; ///< Vertices vector V2dVec vertices; ///< triangulation's vertices - TriangleVec triangles; ///< triangulation's triangles + TriangleVec triangles; ///< triangulation's triangles EdgeUSet fixedEdges; ///< triangulation's constraints (fixed edges) /** Stores count of overlapping boundaries for a fixed edge. If no entry is @@ -388,7 +388,7 @@ class CDT_EXPORT Triangulation private: /*____ Detail __*/ void addSuperTriangle(const Box2d& box); - void addNewVertex(const V2d& pos, TriInd iT, bool isSteiner = false); + void addNewVertex(const V2d& pos, TriInd iT); void insertVertex(VertInd iVert); void insertVertex(VertInd iVert, VertInd walkStart); void ensureDelaunayByEdgeFlips( diff --git a/CDT/include/Triangulation.hpp b/CDT/include/Triangulation.hpp index aa6dde5..4855dcb 100644 --- a/CDT/include/Triangulation.hpp +++ b/CDT/include/Triangulation.hpp @@ -1018,8 +1018,7 @@ void Triangulation::addSuperTriangle(const Box2d& box) template void Triangulation::addNewVertex( const V2d& pos, - const TriInd iT, - const bool isSteiner) + const TriInd iT) { vertices.push_back(pos); m_vertTris.push_back(iT); @@ -1482,7 +1481,7 @@ VertInd Triangulation::splitEncroachedEdge( detail::insert_unique(pieceToOriginals[half1], newOriginals); detail::insert_unique(pieceToOriginals[half2], newOriginals); } - addNewVertex(mid, noNeighbor, true); + addNewVertex(mid, noNeighbor); std::stack triStack = insertVertexOnEdge(iMid, iT, iTopo); tryAddVertexToLocator(iMid); ensureDelaunayByEdgeFlips(mid, iMid, triStack); @@ -2352,7 +2351,7 @@ void Triangulation::refineTriangles( if(badTris.empty() && newVertBudget > 0) { const VertInd iVert = static_cast(vertices.size()); - addNewVertex(vert, noNeighbor, true); + addNewVertex(vert, noNeighbor); insertVertex(iVert); TriInd start = m_vertTris[iVert]; TriInd currTri = start;