Skip to content

Commit

Permalink
Remove outdated comments
Browse files Browse the repository at this point in the history
  • Loading branch information
huxingyi committed Dec 21, 2022
1 parent f30490f commit 7fada8f
Showing 1 changed file with 0 additions and 72 deletions.
72 changes: 0 additions & 72 deletions dust3d/mesh/section_remesher.cc
Original file line number Diff line number Diff line change
Expand Up @@ -201,78 +201,6 @@ void SectionRemesher::remesh()
for (size_t i = 0; i < ring.size(); ++i)
ring[i] = i;
remeshRing(ring, m_ringUs);
/*
int nonConvexVertex = -1;
if (isConvex(m_vertices) || -1 == (nonConvexVertex = findNonConvexVertex(m_vertices))) {
remeshConvex(m_vertices, m_ringUs);
return;
}
int pairVertex = findPairVertex(m_vertices, nonConvexVertex);
if (-1 == pairVertex) {
remeshConvex(m_vertices, m_ringUs);
return;
}
auto nextVertex = [&](int index) {
return (index + 1) % m_vertices.size();
};
auto previousVertex = [&](int index) {
return (index + m_vertices.size() - 1) % m_vertices.size();
};
struct CutLine {
int nearVertex;
int farVertex;
};
std::vector<CutLine> cutLines;
for (int i = nonConvexVertex, j = pairVertex;;
i = previousVertex(i), j = nextVertex(j)) {
cutLines.push_back(CutLine { i, j });
if (i == j || i == nextVertex(j))
break;
}
std::reverse(cutLines.begin(), cutLines.end());
for (int i = nextVertex(nonConvexVertex), j = previousVertex(pairVertex);;
i = nextVertex(i), j = previousVertex(j)) {
cutLines.push_back(CutLine { i, j });
if (i == j || i == previousVertex(j))
break;
}
if (cutLines.size() < 2) {
remeshConvex(m_vertices, m_ringUs);
return;
}
dust3dDebug << "cutLines: (m_vertices:" << m_vertices.size() << ")";
for (size_t i = 0; i < cutLines.size(); ++i) {
dust3dDebug << "line[" << i << "]:" << cutLines[i].nearVertex << (cutLines[i].nearVertex == nonConvexVertex ? "(nonConv)" : "") << cutLines[i].farVertex << (cutLines[i].farVertex == pairVertex ? "(pair)" : "");
}
for (size_t j = 1; j < cutLines.size(); ++j) {
size_t i = j - 1;
if (cutLines[i].nearVertex == cutLines[i].farVertex) {
if (cutLines[i].nearVertex == cutLines[j].nearVertex || cutLines[i].farVertex == cutLines[j].farVertex)
continue;
dust3dDebug << "A" << cutLines[i].nearVertex << cutLines[j].nearVertex << cutLines[j].farVertex;
m_generatedFaces.emplace_back(std::vector<size_t> { cutLines[i].nearVertex, cutLines[j].nearVertex, cutLines[j].farVertex });
m_generatedFaceUvs.emplace_back(std::vector<Vector2> { Vector2(), Vector2(), Vector2() });
} else if (cutLines[j].nearVertex == cutLines[j].farVertex) {
if (cutLines[i].nearVertex == cutLines[j].nearVertex || cutLines[i].farVertex == cutLines[j].farVertex)
continue;
dust3dDebug << "B" << cutLines[i].nearVertex << cutLines[j].nearVertex << cutLines[i].farVertex;
m_generatedFaces.emplace_back(std::vector<size_t> { cutLines[i].nearVertex, cutLines[j].nearVertex, cutLines[i].farVertex });
m_generatedFaceUvs.emplace_back(std::vector<Vector2> { Vector2(), Vector2(), Vector2() });
} else {
dust3dDebug << "C" << cutLines[i].nearVertex << cutLines[j].nearVertex << cutLines[j].farVertex << cutLines[i].farVertex;
m_generatedFaces.emplace_back(std::vector<size_t> { cutLines[i].nearVertex, cutLines[j].nearVertex, cutLines[j].farVertex, cutLines[i].farVertex });
m_generatedFaceUvs.emplace_back(std::vector<Vector2> { Vector2(), Vector2(), Vector2(), Vector2() });
}
}
*/
}

}

0 comments on commit 7fada8f

Please sign in to comment.