Renamed getEdges and getVertices to computeEdges and computeVertices
This commit is contained in:
parent
6c16d8d48e
commit
ec7160e637
|
@ -115,7 +115,7 @@ void TopologyEnumerator::computeValidPatterns(const std::vector<size_t> &reduced
|
|||
patternGeometryAllEdges,
|
||||
allPossibleEdges);
|
||||
PatternGeometry patternAllValidEdges;
|
||||
patternAllValidEdges.add(patternGeometryAllEdges.getVertices(), validEdges);
|
||||
patternAllValidEdges.add(patternGeometryAllEdges.computeVertices(), validEdges);
|
||||
if (debugIsOn) {
|
||||
// Export all valid edges in a ply
|
||||
patternAllValidEdges.save(
|
||||
|
@ -138,12 +138,12 @@ void TopologyEnumerator::computeValidPatterns(const std::vector<size_t> &reduced
|
|||
const size_t ei1 = *setIt;
|
||||
vcg::tri::Allocator<PatternGeometry>::AddEdge(
|
||||
intersectingEdgePair,
|
||||
patternGeometryAllEdges.getVertices()[validEdges[ei0][0]],
|
||||
patternGeometryAllEdges.getVertices()[validEdges[ei0][1]]);
|
||||
patternGeometryAllEdges.computeVertices()[validEdges[ei0][0]],
|
||||
patternGeometryAllEdges.computeVertices()[validEdges[ei0][1]]);
|
||||
vcg::tri::Allocator<PatternGeometry>::AddEdge(
|
||||
intersectingEdgePair,
|
||||
patternGeometryAllEdges.getVertices()[validEdges[ei1][0]],
|
||||
patternGeometryAllEdges.getVertices()[validEdges[ei1][1]]);
|
||||
patternGeometryAllEdges.computeVertices()[validEdges[ei1][0]],
|
||||
patternGeometryAllEdges.computeVertices()[validEdges[ei1][1]]);
|
||||
intersectingEdgePair.save(std::filesystem::path(intersectingEdgesPath)
|
||||
.append(std::to_string(mapIt->first) + "_"
|
||||
+ std::to_string(*setIt) + ".ply")
|
||||
|
@ -192,7 +192,7 @@ void TopologyEnumerator::computeValidPatterns(const std::vector<size_t> &reduced
|
|||
computeValidPatterns(numberOfNodesPerSlot,
|
||||
numberOfEdges,
|
||||
perEdgeResultPath,
|
||||
patternGeometryAllEdges.getVertices(),
|
||||
patternGeometryAllEdges.computeVertices(),
|
||||
intersectingEdges,
|
||||
validEdges,
|
||||
interfaceNodes);
|
||||
|
@ -213,7 +213,7 @@ void TopologyEnumerator::computeValidPatterns(const std::vector<size_t> &reduced
|
|||
computeValidPatterns(numberOfNodesPerSlot,
|
||||
numberOfDesiredEdges,
|
||||
perEdgeResultPath,
|
||||
patternGeometryAllEdges.getVertices(),
|
||||
patternGeometryAllEdges.computeVertices(),
|
||||
intersectingEdges,
|
||||
validEdges,
|
||||
interfaceNodes);
|
||||
|
|
Loading…
Reference in New Issue