Skip to content

Commit

Permalink
#7 Remove isSteiner from addNewVertex
Browse files Browse the repository at this point in the history
  • Loading branch information
artem-ogre committed Oct 6, 2023
1 parent 6a552f3 commit 02a99ef
Show file tree
Hide file tree
Showing 2 changed files with 5 additions and 6 deletions.
4 changes: 2 additions & 2 deletions CDT/include/Triangulation.h
Original file line number Diff line number Diff line change
Expand Up @@ -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
Expand Down Expand Up @@ -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(
Expand Down
7 changes: 3 additions & 4 deletions CDT/include/Triangulation.hpp
Original file line number Diff line number Diff line change
Expand Up @@ -985,8 +985,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);
Expand Down Expand Up @@ -1449,7 +1448,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);
Expand Down Expand Up @@ -2330,7 +2329,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;
Expand Down

0 comments on commit 02a99ef

Please sign in to comment.