#7 Remove isSteiner from addNewVertex

artem-ogre · Aug 21, 2023 · a4eed27 · a4eed27
1 parent b380bf3
commit a4eed27
Show file tree

Hide file tree

Showing 2 changed files with 5 additions and 6 deletions.
diff --git a/CDT/include/Triangulation.h b/CDT/include/Triangulation.h
@@ -127,7 +127,7 @@ class CDT_EXPORT Triangulation
 public:
     typedef std::vector<V2d<T> > 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<T>& box);
-    void addNewVertex(const V2d<T>& pos, TriInd iT, bool isSteiner = false);
+    void addNewVertex(const V2d<T>& 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
@@ -1018,8 +1018,7 @@ void Triangulation<T, TNearPointLocator>::addSuperTriangle(const Box2d<T>& box)
 template <typename T, typename TNearPointLocator>
 void Triangulation<T, TNearPointLocator>::addNewVertex(
     const V2d<T>& 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<T, TNearPointLocator>::splitEncroachedEdge(
         detail::insert_unique(pieceToOriginals[half1], newOriginals);
         detail::insert_unique(pieceToOriginals[half2], newOriginals);
     }
-    addNewVertex(mid, noNeighbor, true);
+    addNewVertex(mid, noNeighbor);
     std::stack<TriInd> triStack = insertVertexOnEdge(iMid, iT, iTopo);
     tryAddVertexToLocator(iMid);
     ensureDelaunayByEdgeFlips(mid, iMid, triStack);
@@ -2352,7 +2351,7 @@ void Triangulation<T, TNearPointLocator>::refineTriangles(
         if(badTris.empty() && newVertBudget > 0)
         {
             const VertInd iVert = static_cast<VertInd>(vertices.size());
-            addNewVertex(vert, noNeighbor, true);
+            addNewVertex(vert, noNeighbor);
             insertVertex(iVert);
             TriInd start = m_vertTris[iVert];
             TriInd currTri = start;