TTK
Loading...
Searching...
No Matches
MergeTreeVisualization.h
Go to the documentation of this file.
1
7
8#pragma once
9
10#include <FTMTree.h>
11
12#include <stack>
13
14namespace ttk {
15
16 class MergeTreeVisualization : virtual public Debug {
17 protected:
18 // Visualization parameters
19 bool branchDecompositionPlanarLayout_ = false;
20 double branchSpacing_ = 1.;
21 bool rescaleTreesIndividually_ = false;
22 double importantPairs_ = 50.; // important pairs threshold
23 double importantPairsSpacing_ = 1.;
24 double nonImportantPairsSpacing_ = 1.;
25 double nonImportantPairsProximity_ = 0.05;
26 std::string excludeImportantPairsLower_ = "";
27 std::string excludeImportantPairsHigher_ = "";
28 std::vector<double> excludeImportantPairsLowerValues_,
29 excludeImportantPairsHigherValues_;
30
31 public:
32 MergeTreeVisualization() = default;
33 ~MergeTreeVisualization() override = default;
34
35 // ==========================================================================
36 // Getter / Setter
37 // ==========================================================================
38 // Visualization parameters
42 void setBranchSpacing(double d) {
43 branchSpacing_ = d;
44 }
48 void setImportantPairs(double d) {
49 importantPairs_ = d;
50 }
51 void setImportantPairsSpacing(double d) {
52 importantPairsSpacing_ = d;
53 }
68
69 // ==========================================================================
70 // Planar Layout
71 // ==========================================================================
72 // TODO manage multi pers pairs
73 template <class dataType>
74 void treePlanarLayoutBDImpl(
75 ftm::FTMTree_MT *tree,
76 std::vector<float> &retVec,
77 std::vector<LongSimplexId> &treeSimplexId,
78 std::vector<ftm::idNode> &ttkNotUsed(branching),
79 std::vector<std::vector<ftm::idNode>> &nodeBranching) {
80 ftm::idNode const treeRoot = tree->getRoot();
81 ftm::idNode const treeRootOrigin = tree->getNode(treeRoot)->getOrigin();
82 float const rootY = retVec[treeSimplexId[treeRoot] * 2 + 1];
83 float const rootOriginY = retVec[treeSimplexId[treeRootOrigin] * 2 + 1];
84 float const rootYmin = std::min(rootY, rootOriginY);
85 float const rootYmax = std::max(rootY, rootOriginY);
86 dataType rootPers = tree->getNodePersistence<dataType>(treeRoot);
87 std::vector<std::tuple<float, float>> allNodeSpanX(
88 tree->getNumberOfNodes());
89 std::vector<std::tuple<float, float>> allNodeImportantSpanX(
90 tree->getNumberOfNodes());
91
92 // Compute gap
93 float const nonImportantPairsGap
94 = (rootYmax - rootYmin) * 0.05 * nonImportantPairsSpacing_;
95 float const importantPairsGap
96 = std::max(nonImportantPairsGap, (float)importantPairsSpacing_);
97
98 // Some functions
99 auto compLowerPers = [&](const ftm::idNode a, const ftm::idNode b) {
100 return tree->getNodePersistence<dataType>(a)
101 < tree->getNodePersistence<dataType>(b);
102 };
103 auto compEqUpperPers = [&](const ftm::idNode a, const ftm::idNode b) {
104 return not compLowerPers(a, b);
105 };
106
107 // Go
108 std::vector<ftm::idNode> leaves;
109 tree->getLeavesFromTree(leaves);
110 std::sort(leaves.begin(), leaves.end(), compLowerPers);
111 std::queue<ftm::idNode> queue;
112 for(auto node : leaves)
113 queue.emplace(node);
114 while(!queue.empty()) {
115 ftm::idNode const node = queue.front();
116 queue.pop();
117 ftm::idNode const nodeOrigin = tree->getNode(node)->getOrigin();
118
119 const double nodePers = tree->getNodePersistence<dataType>(node);
120 retVec[treeSimplexId[nodeOrigin] * 2] = 0;
121 retVec[treeSimplexId[nodeOrigin] * 2 + 1]
122 = nodePers / rootPers * (rootYmax - rootYmin) + rootYmin;
123
124 // Positioning nodes in the branch
125 if(tree->isBranchOrigin(nodeOrigin)) {
126 float prevX = 0;
127 std::vector<ftm::idNode> nodeBranchingVector;
128 for(size_t i = 1; i < nodeBranching[nodeOrigin].size(); ++i)
129 nodeBranchingVector.push_back(nodeBranching[nodeOrigin][i]);
130 std::sort(nodeBranchingVector.begin(), nodeBranchingVector.end(),
131 compEqUpperPers);
132
133 // Iterate through each node of the branch
134 int lastIndexImportant = -1;
135 for(size_t i = 0; i < nodeBranchingVector.size(); ++i) {
136 ftm::idNode const nodeBranchingI = nodeBranchingVector[i];
137
138 // Get old node span X
139 float const oldMin = std::get<0>(allNodeSpanX[nodeBranchingI]);
140 float const oldMax = std::get<1>(allNodeSpanX[nodeBranchingI]);
141
142 // Get x spacing
143 float nodeSpacing = 0;
144 if(i > 0) {
145 if(tree->isImportantPair<dataType>(
146 nodeBranchingVector[i], importantPairs_,
147 excludeImportantPairsLowerValues_,
148 excludeImportantPairsHigherValues_)) {
149 nodeSpacing = importantPairsGap;
150 } else if(tree->isImportantPair<dataType>(
151 nodeBranchingVector[i - 1], importantPairs_,
152 excludeImportantPairsLowerValues_,
153 excludeImportantPairsHigherValues_)) {
154 nodeSpacing = nonImportantPairsProximity_;
155 // prevX =
156 } else {
157 nodeSpacing = nonImportantPairsGap;
158 }
159 } else if(not tree->isImportantPair<dataType>(
160 nodeBranchingVector[i], importantPairs_,
161 excludeImportantPairsLowerValues_,
162 excludeImportantPairsHigherValues_)
163 and tree->isImportantPair<dataType>(
164 nodeOrigin, importantPairs_,
165 excludeImportantPairsLowerValues_,
166 excludeImportantPairsHigherValues_))
167 nodeSpacing = nonImportantPairsProximity_;
168 float const newMin = prevX + nodeSpacing;
169 float const shiftX = newMin - oldMin;
170
171 // Set y coordinate according difference in persistence
172 dataType nodeBranchingIPers
173 = tree->getNodePersistence<dataType>(nodeBranchingI);
174 float const shiftY = nodeBranchingIPers * branchSpacing_;
175 float diffY = retVec[treeSimplexId[nodeBranchingI] * 2 + 1];
176 retVec[treeSimplexId[nodeBranchingI] * 2 + 1]
177 = retVec[treeSimplexId[nodeOrigin] * 2 + 1] - shiftY;
178 diffY = retVec[treeSimplexId[nodeBranchingI] * 2 + 1] - diffY;
179
180 // Shift this branch
181 std::queue<ftm::idNode> queueBranching;
182 queueBranching.emplace(nodeBranchingI);
183 while(!queueBranching.empty()) {
184 ftm::idNode const nodeBranchOrigin = queueBranching.front();
185 queueBranching.pop();
186 retVec[treeSimplexId[nodeBranchOrigin] * 2] += shiftX;
187 if(nodeBranchOrigin != nodeBranchingI)
188 retVec[treeSimplexId[nodeBranchOrigin] * 2 + 1] += diffY;
189 if(tree->isBranchOrigin(nodeBranchOrigin))
190 for(auto nodeB : nodeBranching[nodeBranchOrigin])
191 queueBranching.emplace(nodeB);
192 }
193
194 // Update node span X
195 allNodeSpanX[nodeBranchingI]
196 = std::make_tuple(oldMin + shiftX, oldMax + shiftX);
197 float const oldMinImp
198 = std::get<0>(allNodeImportantSpanX[nodeBranchingI]);
199 float const oldMaxImp
200 = std::get<1>(allNodeImportantSpanX[nodeBranchingI]);
201 allNodeImportantSpanX[nodeBranchingI]
202 = std::make_tuple(oldMinImp + shiftX, oldMaxImp + shiftX);
203
204 // Update x base for next iteration
205 prevX = std::get<1>(allNodeSpanX[nodeBranchingI]);
206 if(tree->isImportantPair<dataType>(
207 nodeBranchingVector[i], importantPairs_,
208 excludeImportantPairsLowerValues_,
209 excludeImportantPairsHigherValues_)) {
210 lastIndexImportant = i;
211 prevX = std::get<1>(allNodeImportantSpanX[nodeBranchingI]);
212 if(i < nodeBranchingVector.size() - 1
213 and not tree->isImportantPair<dataType>(
214 nodeBranchingVector[i + 1], importantPairs_,
215 excludeImportantPairsLowerValues_,
216 excludeImportantPairsHigherValues_)) {
217 float const spanMin
218 = std::get<0>(allNodeSpanX[nodeBranchingVector[0]]);
219 float const spanMax
220 = std::get<1>(allNodeImportantSpanX
221 [nodeBranchingVector[lastIndexImportant]]);
222 prevX = (spanMin + spanMax) / 2;
223 }
224 }
225 } // end for nodeBranching
226
227 // Update node span X
228 float spanMin = std::get<0>(allNodeSpanX[nodeBranchingVector[0]]);
229 if(lastIndexImportant != -1) {
230 float const spanMaxImp = std::get<1>(
231 allNodeImportantSpanX[nodeBranchingVector[lastIndexImportant]]);
232 allNodeImportantSpanX[nodeOrigin]
233 = std::make_tuple(spanMin, spanMaxImp);
234 } else {
235 allNodeImportantSpanX[nodeOrigin] = std::make_tuple(0, 0);
236 spanMin = 0;
237 }
238 float const spanMax = std::get<1>(
239 allNodeSpanX[nodeBranchingVector[nodeBranchingVector.size() - 1]]);
240 allNodeSpanX[nodeOrigin] = std::make_tuple(spanMin, spanMax);
241 } else {
242 allNodeSpanX[nodeOrigin] = std::make_tuple(0, 0);
243 allNodeImportantSpanX[nodeOrigin] = std::make_tuple(0, 0);
244 }
245
246 // Positioning of this node x coordinate
247 float const spanMin = std::get<0>(allNodeImportantSpanX[nodeOrigin]);
248 float const spanMax = std::get<1>(allNodeImportantSpanX[nodeOrigin]);
249 retVec[treeSimplexId[nodeOrigin] * 2] = (spanMin + spanMax) / 2;
250 }
251
252 // Copy coordinates of nodeOrigin
253 for(auto node : leaves)
254 queue.emplace(node);
255 while(!queue.empty()) {
256 ftm::idNode const node = queue.front();
257 queue.pop();
258 ftm::idNode const nodeOrigin = tree->getNode(node)->getOrigin();
259 retVec[treeSimplexId[node] * 2] = retVec[treeSimplexId[nodeOrigin] * 2];
260 retVec[treeSimplexId[node] * 2 + 1]
261 = retVec[treeSimplexId[nodeOrigin] * 2 + 1];
262 }
263 }
264
265 // TODO manage multi pers pairs
266 template <class dataType>
267 void treePlanarLayoutImpl(
268 ftm::FTMTree_MT *tree,
269 std::tuple<double, double, double, double, double, double> oldBounds,
270 double ttkNotUsed(refPersistence),
271 std::vector<float> &retVec) {
272 printMsg(debug::Separator::L1, debug::Priority::VERBOSE);
273 printMsg("Planar Layout", debug::Priority::VERBOSE);
274
275 // ----------------------------------------------------
276 // Init internal parameters
277 // ----------------------------------------------------
278 Timer t_init;
279 printMsg("Init internal parameters", debug::Priority::VERBOSE);
280
281 auto nPoints = tree->getRealNumberOfNodes();
282 int const outNumberOfPoints = nPoints * 2;
283 retVec.resize(outNumberOfPoints);
284
285 int cptNode = 0;
286 std::vector<LongSimplexId> treeSimplexId(tree->getNumberOfNodes());
287 std::vector<ftm::idNode> branching;
288 std::vector<int> branchingID;
289 std::vector<std::vector<ftm::idNode>> nodeBranching;
290 tree->getTreeBranching(branching, branchingID, nodeBranching);
291
292 std::stringstream ss;
293 ss << "INIT = " << t_init.getElapsedTime();
294 printMsg(ss.str(), debug::Priority::VERBOSE);
295
296 // ----------------------------------------------------
297 // Iterate through tree
298 // ----------------------------------------------------
299 Timer t_iterate;
300 printMsg("Iterate through tree", debug::Priority::VERBOSE);
301
302 std::queue<ftm::idNode> queue;
303 ftm::idNode const treeRoot = tree->getRoot();
304 ftm::idNode const treeRootOrigin = tree->getNode(treeRoot)->getOrigin();
305 queue.emplace(treeRoot);
306 while(!queue.empty()) {
307 ftm::idNode const node = queue.front();
308 queue.pop();
309
310 // Get and insert point
311 treeSimplexId[node] = cptNode;
312 ++cptNode;
313
314 // Push children to the queue
315 std::vector<ftm::idNode> children;
316 tree->getChildren(node, children);
317 for(size_t i = 0; i < children.size(); ++i) {
318 auto child = children[i];
319 queue.emplace(child);
320 }
321 }
322
323 std::stringstream ss2;
324 ss2 << "ITERATE TREE = " << t_iterate.getElapsedTime();
325 printMsg(ss2.str(), debug::Priority::VERBOSE);
326
327 // ----------------------------------------------------
328 // Prepositioning coordinates
329 // ----------------------------------------------------
330 std::queue<ftm::idNode> queue2;
331 queue2.emplace(treeRoot);
332 while(!queue2.empty()) {
333 ftm::idNode const node = queue2.front();
334 queue2.pop();
335
336 retVec[treeSimplexId[node] * 2]
337 = tree->getValue<dataType>(branching[node]);
338 retVec[treeSimplexId[node] * 2 + 1] = tree->getValue<dataType>(node);
339
340 // Push children to the queue
341 std::vector<ftm::idNode> children;
342 tree->getChildren(node, children);
343 for(auto child : children)
344 queue2.emplace(child);
345 }
346
347 // ----------------------------------------------------
348 // Rescale coordinates
349 // ----------------------------------------------------
350 Timer t_rescale;
351 printMsg("Rescale coordinates ", debug::Priority::VERBOSE);
352
353 float x_min, y_min, x_max, y_max;
354 x_min = std::numeric_limits<float>::max();
355 y_min = std::numeric_limits<float>::max();
356 x_max = std::numeric_limits<float>::lowest();
357 y_max = std::numeric_limits<float>::lowest();
358 for(int i = 0; i < outNumberOfPoints; i += 2) {
359 x_min = std::min(x_min, retVec[i]);
360 x_max = std::max(x_max, retVec[i]);
361 y_min = std::min(y_min, retVec[i + 1]);
362 y_max = std::max(y_max, retVec[i + 1]);
363 }
364 auto newBounds = std::make_tuple(x_min, x_max, y_min, y_max, 0, 0);
365
366 // TODO correctly manage diff and offset if rescaleTreesIndividually_
367 double diff = std::max((std::get<1>(oldBounds) - std::get<0>(oldBounds)),
368 (std::get<3>(oldBounds) - std::get<2>(oldBounds)));
369 double offset = std::max(std::get<0>(oldBounds), std::get<2>(oldBounds));
370 if(not rescaleTreesIndividually_) {
371 // diff *= getNodePersistence<dataType>(tree, treeRoot) /
372 // refPersistence;
373 diff = tree->getNodePersistence<dataType>(treeRoot);
374 offset = tree->getBirth<dataType>(treeRoot);
375 }
376
377 for(int i = 0; i < outNumberOfPoints; i += 2) {
378 auto divisor1
379 = std::get<1>(newBounds) - std::get<0>(newBounds); // (x_max - x_min)
380 divisor1 = (divisor1 == 0 ? 1 : divisor1);
381 auto divisor2
382 = std::get<3>(newBounds) - std::get<2>(newBounds); // (y_max - y_min)
383 divisor2 = (divisor2 == 0 ? 1 : divisor2);
384
385 // x coordinate
386 retVec[i] = (retVec[i] - std::get<0>(newBounds)) / divisor1;
387 retVec[i] = retVec[i] * diff / 2 + offset;
388
389 // y coordinate
390 retVec[i + 1] = (retVec[i + 1] - std::get<2>(newBounds)) / divisor2;
391 retVec[i + 1] = retVec[i + 1] * diff + offset;
392 }
393
394 std::stringstream ss3;
395 ss3 << "RESCALE COORD. = " << t_rescale.getElapsedTime();
396 printMsg(ss3.str(), debug::Priority::VERBOSE);
397
398 // ----------------------------------------------------
399 // Call Branch Decomposition Planar Layout if asked
400 // ----------------------------------------------------
401 if(branchDecompositionPlanarLayout_) {
402 treePlanarLayoutBDImpl<dataType>(
403 tree, retVec, treeSimplexId, branching, nodeBranching);
404 return;
405 }
406
407 // ----------------------------------------------------
408 // Move nodes given scalars
409 // ----------------------------------------------------
410 Timer t_move;
411 printMsg("Move nodes given scalars", debug::Priority::VERBOSE);
412
413 float const rootY = retVec[treeSimplexId[treeRoot] * 2 + 1];
414 float const rootOriginY = retVec[treeSimplexId[treeRootOrigin] * 2 + 1];
415 float const rootYmin = std::min(rootY, rootOriginY);
416 float const rootYmax = std::max(rootY, rootOriginY);
417 auto rootBirthDeath = tree->getBirthDeath<dataType>(treeRoot);
418 const double rootBirth = std::get<0>(rootBirthDeath);
419 const double rootDeath = std::get<1>(rootBirthDeath);
420 for(size_t i = 0; i < tree->getNumberOfNodes(); ++i) {
421 retVec[treeSimplexId[i] * 2 + 1]
422 = (tree->getValue<dataType>(i) - rootBirth) / (rootDeath - rootBirth);
423 retVec[treeSimplexId[i] * 2 + 1]
424 = retVec[treeSimplexId[i] * 2 + 1] * (rootYmax - rootYmin) + rootYmin;
425 }
426
427 std::stringstream ss4;
428 ss4 << "MOVE SCALAR = " << t_move.getElapsedTime();
429 printMsg(ss4.str(), debug::Priority::VERBOSE);
430
431 // ----------------------------------------------------
432 // Scale pairs given persistence
433 // ----------------------------------------------------
434 Timer t_scale;
435 printMsg("Scale pairs given persistence", debug::Priority::VERBOSE);
436
437 dataType rootPers = tree->getNodePersistence<dataType>(treeRoot);
438
439 std::vector<ftm::idNode> leaves;
440 tree->getLeavesFromTree(leaves);
441 auto compLowerPers = [&](const ftm::idNode a, const ftm::idNode b) {
442 return tree->getNodePersistence<dataType>(a)
443 < tree->getNodePersistence<dataType>(b);
444 };
445 std::sort(leaves.begin(), leaves.end(), compLowerPers);
446 std::stack<ftm::idNode> stack;
447 for(auto node : leaves)
448 stack.emplace(node);
449 std::vector<bool> nodeDone(tree->getNumberOfNodes(), false);
450 while(!stack.empty()) {
451 ftm::idNode const node = stack.top();
452 stack.pop();
453 nodeDone[node] = true;
454
455 if(node == treeRoot or node == treeRootOrigin
456 or tree->isNodeAlone(node))
457 continue;
458
459 dataType nodePers = tree->getNodePersistence<dataType>(node);
460 ftm::idNode const nodeOrigin = tree->getNode(node)->getOrigin();
461
462 // Manage leaf
463 if(tree->isLeaf(node)) {
464 float const nodeDiff = (retVec[treeSimplexId[node] * 2]
465 - retVec[treeSimplexId[nodeOrigin] * 2]);
466 const auto sign = nodeDiff / std::abs(nodeDiff);
467 auto inc = sign * nodePers / rootPers * (rootYmax - rootYmin) / 2;
468 retVec[treeSimplexId[node] * 2]
469 = retVec[treeSimplexId[nodeOrigin] * 2] + inc;
470
471 // Push nodes in the branch to the stack
472 ftm::idNode nodeParent = tree->getParentSafe(node);
473 ftm::idNode oldNodeParent = -1;
474 while(nodeParent != nodeOrigin) {
475 if(not nodeDone[nodeParent])
476 stack.emplace(nodeParent);
477 else
478 break;
479 oldNodeParent = nodeParent;
480 nodeParent = tree->getParentSafe(nodeParent);
481 if(oldNodeParent == nodeParent) {
482 std::stringstream ss5;
483 ss5 << "treePlanarLayoutImpl oldNodeParent == nodeParent";
484 printMsg(ss5.str(), debug::Priority::VERBOSE);
485 break;
486 }
487 }
488 }
489
490 // Manage saddle
491 if(not tree->isLeaf(node) and not tree->isRoot(node)) {
492 float const branchY
493 = retVec[treeSimplexId[tree->getNode(branching[node])->getOrigin()]
494 * 2];
495 retVec[treeSimplexId[node] * 2] = branchY;
496 }
497 }
498
499 std::stringstream ss5;
500 ss5 << "SCALE PERS. = " << t_scale.getElapsedTime();
501 printMsg(ss5.str(), debug::Priority::VERBOSE);
502
503 // ----------------------------------------------------
504 // Branches positioning and avoid edges crossing
505 // ----------------------------------------------------
506 Timer t_avoid;
507 printMsg("Avoid edges crossing", debug::Priority::VERBOSE);
508
509 bool isJT = tree->isJoinTree<dataType>();
510 auto compValue = [&](const ftm::idNode a, const ftm::idNode b) {
511 return (isJT
512 ? tree->getValue<dataType>(a) < tree->getValue<dataType>(b)
513 : tree->getValue<dataType>(a) > tree->getValue<dataType>(b));
514 };
515 std::vector<std::tuple<float, float, float, float>> allBranchBounds(
516 tree->getNumberOfNodes());
517 std::vector<std::vector<ftm::idNode>> allBranchOrigins(
518 tree->getNumberOfNodes());
519 std::vector<int> allBranchOriginsSize(tree->getNumberOfNodes());
520 std::queue<ftm::idNode> queueCrossing;
521
522 // ----- Get important and non-important pairs gap and store saddle nodes
523 // of each branch
524 int maxSize = std::numeric_limits<int>::lowest();
525 for(auto leaf : leaves)
526 queueCrossing.emplace(leaf);
527 while(!queueCrossing.empty()) {
528 ftm::idNode const node = queueCrossing.front();
529 queueCrossing.pop();
530 ftm::idNode const nodeOrigin = tree->getNode(node)->getOrigin();
531
532 // Get saddle nodes in the branch
533 std::tuple<std::vector<ftm::idNode>, std::vector<ftm::idNode>>
534 tupBranchOrigins;
535 tree->getBranchOriginsFromThisBranch(nodeOrigin, tupBranchOrigins);
536 allBranchOrigins[nodeOrigin] = std::get<0>(tupBranchOrigins);
537 std::vector<ftm::idNode> nonBranchOrigins
538 = std::get<1>(tupBranchOrigins);
539 allBranchOrigins[nodeOrigin].insert(allBranchOrigins[nodeOrigin].end(),
540 nonBranchOrigins.begin(),
541 nonBranchOrigins.end());
542 std::sort(allBranchOrigins[nodeOrigin].begin(),
543 allBranchOrigins[nodeOrigin].end(), compValue);
544 allBranchOriginsSize[nodeOrigin] = allBranchOrigins[nodeOrigin].size();
545
546 // Get sizes of sub-branches if they are non-important
547 for(size_t i = 0; i < allBranchOrigins[nodeOrigin].size(); ++i) {
548 ftm::idNode const branchNodeOrigin = allBranchOrigins[nodeOrigin][i];
549 bool const isSubBranchImportant = tree->isImportantPair<dataType>(
550 branchNodeOrigin, importantPairs_,
551 excludeImportantPairsLowerValues_,
552 excludeImportantPairsHigherValues_);
553 if(not isSubBranchImportant)
554 allBranchOriginsSize[nodeOrigin]
555 += allBranchOriginsSize[branchNodeOrigin];
556 }
557
558 if(tree->isImportantPair<dataType>(nodeOrigin, importantPairs_,
559 excludeImportantPairsLowerValues_,
560 excludeImportantPairsHigherValues_))
561 maxSize = std::max(maxSize, allBranchOriginsSize[nodeOrigin]);
562 }
563 double const nonImportantPairsGap
564 = (rootYmax - rootYmin) * 0.005 * nonImportantPairsSpacing_;
565 double importantPairsGap = (maxSize)*nonImportantPairsGap * 1.05;
566 bool const customimportantPairsSpacing_
567 = importantPairsGap < importantPairsSpacing_;
568 if(customimportantPairsSpacing_)
569 importantPairsGap = importantPairsSpacing_;
570
571 // ----- Positioning of branches and avoid conflict
572 for(auto leaf : leaves)
573 queueCrossing.emplace(leaf);
574 while(!queueCrossing.empty()) {
575 ftm::idNode const node = queueCrossing.front();
576 queueCrossing.pop();
577 ftm::idNode const nodeOrigin = tree->getNode(node)->getOrigin();
578
579 // Prepositioning of branches
580 // auto restrictedBounds = getBranchBounds(retVec, treeSimplexId,
581 // branching, tree, nodeOrigin, true);
582 auto restrictedBounds
583 = std::make_tuple(retVec[treeSimplexId[node] * 2],
584 retVec[treeSimplexId[node] * 2], 0, 0);
585 for(size_t i = 0; i < allBranchOrigins[nodeOrigin].size(); ++i) {
586 ftm::idNode const branchNodeOrigin = allBranchOrigins[nodeOrigin][i];
587 ftm::idNode const branchNode
588 = tree->getNode(branchNodeOrigin)->getOrigin();
589
590 bool const isSubBranchImportant = tree->isImportantPair<dataType>(
591 branchNodeOrigin, importantPairs_,
592 excludeImportantPairsLowerValues_,
593 excludeImportantPairsHigherValues_);
594 bool const toLeft = not isSubBranchImportant;
595
596 // float branchNodeOriginXmin =
597 // std::get<0>(allBranchBounds[branchNodeOrigin]);
598 float const branchNodeOriginXmax
599 = std::get<1>(allBranchBounds[branchNodeOrigin]);
600 float shift
601 = toLeft ? std::get<0>(restrictedBounds) - branchNodeOriginXmax :
602 // std::get<1>(restrictedBounds) - branchNodeOriginXmin;
603 std::get<1>(restrictedBounds)
604 - retVec[treeSimplexId[branchNode] * 2];
605 shift += (toLeft ? -1 : 1)
606 * (isSubBranchImportant ? importantPairsGap
607 : nonImportantPairsGap);
608 // shift += (toLeft ? -1 : 1) * nonImportantPairsGap;
609 shiftBranchBounds(retVec, treeSimplexId, branching, allBranchBounds,
610 allBranchOrigins[branchNodeOrigin], tree,
611 branchNodeOrigin, shift);
612 }
613
614 // Shift a branch if conflict with another one
615 for(size_t i = 1; i < allBranchOrigins[nodeOrigin].size(); ++i) {
616 ftm::idNode const branchNodeOrigin = allBranchOrigins[nodeOrigin][i];
617 ftm::idNode const branchNode
618 = tree->getNode(branchNodeOrigin)->getOrigin();
619 for(size_t j = 0; j < i; ++j) {
620 auto first = allBranchBounds[branchNodeOrigin];
621 ftm::idNode const previousBranchNodeOrigin
622 = allBranchOrigins[nodeOrigin][j];
623 auto second = allBranchBounds[previousBranchNodeOrigin];
624
625 bool const branchConflict = isConflictingBranchAndBound(
626 first, second, tree, previousBranchNodeOrigin, retVec,
627 treeSimplexId);
628 if(isConflictingBounds(first, second) or branchConflict) {
629
630 // Get left or right orientation given the branch
631 int const lastIndex = nodeBranching[branchNodeOrigin].size() - 1;
632 bool const isLeft
633 = (retVec
634 [treeSimplexId[nodeBranching[branchNodeOrigin][lastIndex]]
635 * 2]
636 //< retVec[treeSimplexId[nodeOrigin]*2]);
637 < retVec[treeSimplexId[node] * 2]);
638
639 // Get shift
640 float const branchNodeOriginXmax = std::get<1>(first);
641 float const previousbranchNodeOriginXmin = std::get<0>(second);
642 // float branchNodeOriginXmin = std::get<0>(first);
643 float const previousbranchNodeOriginXmax = std::get<1>(second);
644 float shift
645 = isLeft ? previousbranchNodeOriginXmin - branchNodeOriginXmax :
646 // previousbranchNodeOriginXmax - branchNodeOriginXmin;
647 previousbranchNodeOriginXmax
648 - retVec[treeSimplexId[branchNode] * 2];
649 bool const isSubBranchImportant = tree->isImportantPair<dataType>(
650 branchNodeOrigin, importantPairs_,
651 excludeImportantPairsLowerValues_,
652 excludeImportantPairsHigherValues_);
653 shift += (isLeft ? -1 : 1)
654 * (isSubBranchImportant ? importantPairsGap
655 : nonImportantPairsGap);
656 // shift += (isLeft ? -1 : 1) * nonImportantPairsGap;
657
658 // Shift bounds
659 shiftBranchBounds(retVec, treeSimplexId, branching,
660 allBranchBounds,
661 allBranchOrigins[branchNodeOrigin], tree,
662 branchNodeOrigin, shift);
663 }
664 }
665 } // end for
666
667 // TODO optimize get branch bounds by using results previously computed
668 // Get branch x and y bounds
669 allBranchBounds[nodeOrigin]
670 = getBranchBounds(retVec, treeSimplexId, branching, tree, nodeOrigin);
671 } // end while
672
673 // ----- Correction of important/non-important pairs gap
674 // TODO the gap between important pairs can be higher than the minimum gap
675 // needed to avoid conflict. The gap is computed using the maximum number
676 // of non-important pairs attached to an inmportant pairs Unfortunately
677 // the real gap can only be computed here, after the conflicts has been
678 // avoided. The maximum real gap must be calculated and propagated to all
679 // important branches and we also need to manage to avoid conflict with
680 // this new gap. Get real gap
681 double realImportantPairsGap = std::numeric_limits<double>::lowest();
682 /*if(customimportantPairsSpacing_)
683 realImportantPairsGap = importantPairsGap;
684 else{
685 for(auto leaf : leaves)
686 queueCrossing.emplace(leaf);
687 while(!queueCrossing.empty()){
688 ftm::idNode node = queueCrossing.front();
689 queueCrossing.pop();
690 ftm::idNode nodeOrigin = tree->getNode(node)->getOrigin();
691 //if(isRoot(tree, nodeOrigin)) continue; // TODO manage root gap and
692 gap for the others
693
694 bool isBranchImportant = isImportantPair<dataType>(tree, nodeOrigin,
695 importantPairs_); if(not isBranchImportant) continue;
696
697 double gap = retVec[treeSimplexId[node]*2] -
698 std::get<0>(allBranchBounds[nodeOrigin]); realImportantPairsGap =
699 std::max(gap, realImportantPairsGap);
700 }
701 realImportantPairsGap *= 1.05;
702 }*/
703 realImportantPairsGap = importantPairsGap;
704
705 // Shift given real gap
706 for(auto leaf : leaves)
707 queueCrossing.emplace(leaf);
708 while(!queueCrossing.empty()) {
709 ftm::idNode const node = queueCrossing.front();
710 queueCrossing.pop();
711 ftm::idNode const nodeOrigin = tree->getNode(node)->getOrigin();
712
713 bool const isBranchImportant = tree->isImportantPair<dataType>(
714 nodeOrigin, importantPairs_, excludeImportantPairsLowerValues_,
715 excludeImportantPairsHigherValues_);
716 if(not isBranchImportant)
717 continue;
718
719 for(size_t i = 0; i < allBranchOrigins[nodeOrigin].size(); ++i) {
720 ftm::idNode const branchNodeOrigin = allBranchOrigins[nodeOrigin][i];
721 bool const isSubBranchImportant = tree->isImportantPair<dataType>(
722 branchNodeOrigin, importantPairs_,
723 excludeImportantPairsLowerValues_,
724 excludeImportantPairsHigherValues_);
725 double shift = 0;
726 if(not isSubBranchImportant) {
727 double const gap = retVec[treeSimplexId[node] * 2]
728 - std::get<0>(allBranchBounds[nodeOrigin]);
729 shift
730 = -(realImportantPairsGap - gap) * nonImportantPairsProximity_;
731 } else {
732 shift = -(importantPairsGap
733 - realImportantPairsGap); // TODO multi shift depending on
734 // conflict
735 }
736 shiftBranchBounds(retVec, treeSimplexId, branching, allBranchBounds,
737 allBranchOrigins[branchNodeOrigin], tree,
738 branchNodeOrigin, shift);
739 }
740 }
741
742 std::stringstream ss6;
743 ss6 << "AVOID CROSSING = " << t_avoid.getElapsedTime();
744 printMsg(ss6.str(), debug::Priority::VERBOSE);
745 printMsg(debug::Separator::L2, debug::Priority::VERBOSE);
746 }
747
748 template <class dataType>
749 void treePlanarLayout(
750 ftm::FTMTree_MT *tree,
751 std::tuple<double, double, double, double, double, double> oldBounds,
752 double refPersistence,
753 std::vector<float> &res) {
754 treePlanarLayoutImpl<dataType>(tree, oldBounds, refPersistence, res);
755 }
756
757 template <class dataType>
758 void persistenceDiagramPlanarLayout(ftm::FTMTree_MT *tree,
759 std::vector<float> &res) {
760 res.resize(tree->getRealNumberOfNodes() * 2);
761 int cptNode = 0;
762 std::queue<ftm::idNode> queue;
763 ftm::idNode const treeRoot = tree->getRoot();
764 queue.emplace(treeRoot);
765 while(!queue.empty()) {
766 ftm::idNode const node = queue.front();
767 queue.pop();
768
769 // Get and insert point
770 auto birthDeath = tree->getBirthDeath<dataType>(node);
771 res[cptNode * 2] = std::get<0>(birthDeath);
772 res[cptNode * 2 + 1] = std::get<1>(birthDeath);
773 ++cptNode;
774
775 // Push children to the queue
776 std::vector<ftm::idNode> children;
777 tree->getChildren(node, children);
778 for(auto child : children)
779 queue.emplace(child);
780 }
781 }
782
783 // ==========================================================================
784 // Bounds Utils
785 // ==========================================================================
786 void printTuple(std::tuple<float, float, float, float> tup) {
787 printMsg(debug::Separator::L2, debug::Priority::VERBOSE);
788 std::stringstream ss;
789 ss << std::get<0>(tup) << " _ " << std::get<1>(tup) << " _ "
790 << std::get<2>(tup) << " _ " << std::get<3>(tup) << " _ ";
791 printMsg(ss.str(), debug::Priority::VERBOSE);
792 }
793
794 // Branchroot must be a non-leaf node
795 std::tuple<float, float, float, float>
796 getBranchBounds(std::vector<float> &retVec,
797 std::vector<LongSimplexId> &treeSimplexId,
798 std::vector<ftm::idNode> &branching,
799 ftm::FTMTree_MT *tree,
800 ftm::idNode branchRoot,
801 bool restricted = false) {
802 float x_min = std::numeric_limits<float>::max();
803 float y_min = std::numeric_limits<float>::max();
804 float x_max = std::numeric_limits<float>::lowest();
805 float y_max = std::numeric_limits<float>::lowest();
806
807 std::queue<ftm::idNode> queue;
808 queue.emplace(branchRoot);
809 while(!queue.empty()) {
810 ftm::idNode const node = queue.front();
811 queue.pop();
812
813 // Skip if we go in the branch in which is branchRoot
814 if(branching[node] != branchRoot
815 and tree->getParentSafe(node) == branchRoot and node != branchRoot)
816 continue;
817
818 // Skip if restricted
819 if(restricted and !tree->isLeaf(node) and branching[node] != branchRoot
820 and node != branchRoot)
821 continue;
822
823 y_min = std::min(y_min, retVec[treeSimplexId[node] * 2 + 1]);
824 y_max = std::max(y_max, retVec[treeSimplexId[node] * 2 + 1]);
825 if(node != branchRoot) {
826 x_min = std::min(x_min, retVec[treeSimplexId[node] * 2]);
827 x_max = std::max(x_max, retVec[treeSimplexId[node] * 2]);
828 }
829
830 std::vector<ftm::idNode> children;
831 tree->getChildren(node, children);
832 for(auto child : children)
833 queue.emplace(child);
834 }
835
836 return std::make_tuple(x_min, x_max, y_min, y_max);
837 }
838
839 bool isConflictingBoundsXOneWay(
840 std::tuple<float, float, float, float> first,
841 std::tuple<float, float, float, float> second) {
842 return (std::get<0>(first) <= std::get<0>(second) + 1e-6
843 and std::get<0>(second) <= std::get<1>(first) + 1e-6)
844 or (std::get<0>(first) <= std::get<1>(second) + 1e-6
845 and std::get<1>(second) <= std::get<1>(first) + 1e-6);
846 }
847
848 bool isConflictingBoundsX(std::tuple<float, float, float, float> first,
849 std::tuple<float, float, float, float> second) {
850 return isConflictingBoundsXOneWay(first, second)
851 or isConflictingBoundsXOneWay(second, first);
852 }
853
854 bool isConflictingBoundsYOneWay(
855 std::tuple<float, float, float, float> first,
856 std::tuple<float, float, float, float> second) {
857 return (std::get<2>(first) <= std::get<2>(second) + 1e-6
858 and std::get<2>(second) <= std::get<3>(first) + 1e-6)
859 or (std::get<2>(first) <= std::get<3>(second) + 1e-6
860 and std::get<3>(second) <= std::get<3>(first) + 1e-6);
861 }
862
863 bool isConflictingBoundsY(std::tuple<float, float, float, float> first,
864 std::tuple<float, float, float, float> second) {
865 return isConflictingBoundsYOneWay(first, second)
866 or isConflictingBoundsYOneWay(second, first);
867 }
868
869 bool isConflictingBounds(std::tuple<float, float, float, float> first,
870 std::tuple<float, float, float, float> second) {
871 return isConflictingBoundsX(first, second)
872 and isConflictingBoundsY(first, second);
873 }
874
875 bool
876 isConflictingBranchAndBound(std::tuple<float, float, float, float> first,
877 std::tuple<float, float, float, float> second,
878 ftm::FTMTree_MT *tree,
879 ftm::idNode branchNodeOrigin,
880 std::vector<float> &retVec,
881 std::vector<LongSimplexId> &treeSimplexId) {
882 float const xBranchNodeOrigin
883 = retVec[treeSimplexId[branchNodeOrigin] * 2];
884 float const xBranchNode
885 = retVec[treeSimplexId[tree->getNode(branchNodeOrigin)->getOrigin()]
886 * 2];
887 float const myMin = std::min(xBranchNode, xBranchNodeOrigin);
888 float const myMax = std::max(xBranchNode, xBranchNodeOrigin);
889 auto branchBounds = std::make_tuple(myMin, myMax, 0, 0);
890 return isConflictingBoundsX(first, branchBounds)
891 and isConflictingBoundsY(first, second);
892 }
893
894 std::tuple<float, float, float, float>
895 shiftBranchBoundsTuple(std::tuple<float, float, float, float> branchBound,
896 float realShift) {
897 return std::make_tuple(std::get<0>(branchBound) + realShift,
898 std::get<1>(branchBound) + realShift,
899 std::get<2>(branchBound),
900 std::get<3>(branchBound));
901 }
902
903 void shiftBranchBounds(
904 std::vector<float> &retVec,
905 std::vector<LongSimplexId> &treeSimplexId,
906 std::vector<ftm::idNode> &branching,
907 std::vector<std::tuple<float, float, float, float>> &allBranchBounds,
908 std::vector<ftm::idNode> &branchOrigins,
909 ftm::FTMTree_MT *tree,
910 ftm::idNode branchRoot,
911 float shift) {
912 std::queue<ftm::idNode> queue;
913 queue.emplace(branchRoot);
914 while(!queue.empty()) {
915 ftm::idNode const node = queue.front();
916 queue.pop();
917
918 if(branching[node] != branchRoot
919 and tree->getParentSafe(node) == branchRoot and node != branchRoot)
920 continue;
921
922 if(node != branchRoot)
923 retVec[treeSimplexId[node] * 2] += shift;
924
925 std::vector<ftm::idNode> children;
926 tree->getChildren(node, children);
927 for(auto child : children)
928 queue.emplace(child);
929 }
930 allBranchBounds[branchRoot]
931 = shiftBranchBoundsTuple(allBranchBounds[branchRoot], shift);
932 for(auto node : branchOrigins)
933 allBranchBounds[node]
934 = shiftBranchBoundsTuple(allBranchBounds[node], shift);
935 }
936
937 void tupleToVector(
938 std::tuple<double, double, double, double, double, double> &tup,
939 std::vector<double> &vec) {
940 vec = std::vector<double>{std::get<0>(tup), std::get<1>(tup),
941 std::get<2>(tup), std::get<3>(tup),
942 std::get<4>(tup), std::get<5>(tup)};
943 }
944
945 std::tuple<double, double, double, double, double, double>
946 vectorToTuple(std::vector<double> &vec) {
947 return std::make_tuple(vec[0], vec[1], vec[2], vec[3], vec[4], vec[5]);
948 }
949
950 std::tuple<double, double, double, double, double, double> getMaximalBounds(
951 std::vector<std::tuple<double, double, double, double, double, double>>
952 &allBounds,
953 std::vector<int> &clusteringAssignmentT,
954 int clusterID) {
955 double x_min = std::numeric_limits<double>::max();
956 double y_min = std::numeric_limits<double>::max();
957 double z_min = std::numeric_limits<double>::max();
958 double x_max = std::numeric_limits<double>::lowest();
959 double y_max = std::numeric_limits<double>::lowest();
960 double z_max = std::numeric_limits<double>::lowest();
961 for(size_t i = 0; i < allBounds.size(); ++i)
962 if(clusteringAssignmentT[i] == clusterID) {
963 x_min = std::min(x_min, std::get<0>(allBounds[i]));
964 x_max = std::max(x_max, std::get<1>(allBounds[i]));
965 y_min = std::min(y_min, std::get<2>(allBounds[i]));
966 y_max = std::max(y_max, std::get<3>(allBounds[i]));
967 z_min = std::min(z_min, std::get<4>(allBounds[i]));
968 z_max = std::max(z_max, std::get<5>(allBounds[i]));
969 }
970 return std::make_tuple(x_min, x_max, y_min, y_max, z_min, z_max);
971 }
972
973 // ==========================================================================
974 // Utils
975 // ==========================================================================
976 void parseExcludeImportantPairsString(std::string &excludeString,
977 std::vector<double> &excludeVector) {
978 excludeVector.clear();
979 if(excludeString.empty())
980 return;
981 std::string s{excludeString};
982 std::string const delimiter = ",";
983
984 size_t pos = 0;
985 std::string token;
986 while((pos = s.find(delimiter)) != std::string::npos) {
987 token = s.substr(0, pos);
988 excludeVector.emplace_back(std::stod(token));
989 s.erase(0, pos + delimiter.length());
990 }
991 excludeVector.emplace_back(std::stod(s));
992 }
993 };
994
995} // namespace ttk
ttkNotUsed
#define ttkNotUsed(x)
Mark function/method parameters that are not used in the function body at all.
Definition BaseClass.h:47
ttk::Debug
Minimalist debugging class.
Definition Debug.h:88
ttk::MergeTreeVisualization::isConflictingBoundsY
bool isConflictingBoundsY(std::tuple< float, float, float, float > first, std::tuple< float, float, float, float > second)
Definition MergeTreeVisualization.h:863
ttk::MergeTreeVisualization::tupleToVector
void tupleToVector(std::tuple< double, double, double, double, double, double > &tup, std::vector< double > &vec)
Definition MergeTreeVisualization.h:937
ttk::MergeTreeVisualization::shiftBranchBoundsTuple
std::tuple< float, float, float, float > shiftBranchBoundsTuple(std::tuple< float, float, float, float > branchBound, float realShift)
Definition MergeTreeVisualization.h:895
ttk::MergeTreeVisualization::treePlanarLayoutBDImpl
void treePlanarLayoutBDImpl(ftm::FTMTree_MT *tree, std::vector< float > &retVec, std::vector< LongSimplexId > &treeSimplexId, std::vector< ftm::idNode > &ttkNotUsed(branching), std::vector< std::vector< ftm::idNode > > &nodeBranching)
Definition MergeTreeVisualization.h:74
ttk::MergeTreeVisualization::shiftBranchBounds
void shiftBranchBounds(std::vector< float > &retVec, std::vector< LongSimplexId > &treeSimplexId, std::vector< ftm::idNode > &branching, std::vector< std::tuple< float, float, float, float > > &allBranchBounds, std::vector< ftm::idNode > &branchOrigins, ftm::FTMTree_MT *tree, ftm::idNode branchRoot, float shift)
Definition MergeTreeVisualization.h:903
ttk::MergeTreeVisualization::printTuple
void printTuple(std::tuple< float, float, float, float > tup)
Definition MergeTreeVisualization.h:786
ttk::MergeTreeVisualization::getBranchBounds
std::tuple< float, float, float, float > getBranchBounds(std::vector< float > &retVec, std::vector< LongSimplexId > &treeSimplexId, std::vector< ftm::idNode > &branching, ftm::FTMTree_MT *tree, ftm::idNode branchRoot, bool restricted=false)
Definition MergeTreeVisualization.h:796
ttk::MergeTreeVisualization::isConflictingBranchAndBound
bool isConflictingBranchAndBound(std::tuple< float, float, float, float > first, std::tuple< float, float, float, float > second, ftm::FTMTree_MT *tree, ftm::idNode branchNodeOrigin, std::vector< float > &retVec, std::vector< LongSimplexId > &treeSimplexId)
Definition MergeTreeVisualization.h:876
ttk::MergeTreeVisualization::setExcludeImportantPairsLower
void setExcludeImportantPairsLower(std::string &d)
Definition MergeTreeVisualization.h:64
ttk::MergeTreeVisualization::isConflictingBounds
bool isConflictingBounds(std::tuple< float, float, float, float > first, std::tuple< float, float, float, float > second)
Definition MergeTreeVisualization.h:869
ttk::MergeTreeVisualization::excludeImportantPairsLowerValues_
std::vector< double > excludeImportantPairsLowerValues_
Definition MergeTreeVisualization.h:28
ttk::MergeTreeVisualization::treePlanarLayoutImpl
void treePlanarLayoutImpl(ftm::FTMTree_MT *tree, std::tuple< double, double, double, double, double, double > oldBounds, double ttkNotUsed(refPersistence), std::vector< float > &retVec)
Definition MergeTreeVisualization.h:267
ttk::MergeTreeVisualization::vectorToTuple
std::tuple< double, double, double, double, double, double > vectorToTuple(std::vector< double > &vec)
Definition MergeTreeVisualization.h:946
ttk::MergeTreeVisualization::setExcludeImportantPairsHigher
void setExcludeImportantPairsHigher(std::string &d)
Definition MergeTreeVisualization.h:60
ttk::MergeTreeVisualization::persistenceDiagramPlanarLayout
void persistenceDiagramPlanarLayout(ftm::FTMTree_MT *tree, std::vector< float > &res)
Definition MergeTreeVisualization.h:758
ttk::MergeTreeVisualization::excludeImportantPairsHigherValues_
std::vector< double > excludeImportantPairsHigherValues_
Definition MergeTreeVisualization.h:29
ttk::MergeTreeVisualization::isConflictingBoundsYOneWay
bool isConflictingBoundsYOneWay(std::tuple< float, float, float, float > first, std::tuple< float, float, float, float > second)
Definition MergeTreeVisualization.h:854
ttk::MergeTreeVisualization::isConflictingBoundsXOneWay
bool isConflictingBoundsXOneWay(std::tuple< float, float, float, float > first, std::tuple< float, float, float, float > second)
Definition MergeTreeVisualization.h:839
ttk::MergeTreeVisualization::parseExcludeImportantPairsString
void parseExcludeImportantPairsString(std::string &excludeString, std::vector< double > &excludeVector)
Definition MergeTreeVisualization.h:976
ttk::MergeTreeVisualization::getMaximalBounds
std::tuple< double, double, double, double, double, double > getMaximalBounds(std::vector< std::tuple< double, double, double, double, double, double > > &allBounds, std::vector< int > &clusteringAssignmentT, int clusterID)
Definition MergeTreeVisualization.h:950
ttk::MergeTreeVisualization::isConflictingBoundsX
bool isConflictingBoundsX(std::tuple< float, float, float, float > first, std::tuple< float, float, float, float > second)
Definition MergeTreeVisualization.h:848
ttk::MergeTreeVisualization::treePlanarLayout
void treePlanarLayout(ftm::FTMTree_MT *tree, std::tuple< double, double, double, double, double, double > oldBounds, double refPersistence, std::vector< float > &res)
Definition MergeTreeVisualization.h:749
ttk::MergeTreeVisualization::~MergeTreeVisualization
~MergeTreeVisualization() override=default
ttk::Timer::getElapsedTime
double getElapsedTime()
Definition Timer.h:15
ttk::ftm::FTMTree_MT
Definition FTMTree_MT.h:83
ttk::ftm::FTMTree_MT::getValue
const scalarType & getValue(SimplexId nodeId) const
Definition FTMTree_MT.h:339
ttk::ftm::FTMTree_MT::getNodePersistence
dataType getNodePersistence(idNode nodeId)
Definition FTMTreeUtils_Template.h:213
ttk::ftm::FTMTree_MT::getNumberOfNodes
idNode getNumberOfNodes() const
Definition FTMTree_MT.h:389
ttk::ftm::FTMTree_MT::getBirthDeath
std::tuple< dataType, dataType > getBirthDeath(idNode nodeId)
Definition FTMTreeUtils_Template.h:171
ttk::ftm::FTMTree_MT::getTreeBranching
void getTreeBranching(std::vector< idNode > &branching, std::vector< int > &branchingID, std::vector< std::vector< idNode > > &nodeBranching)
Definition FTMTreeUtils.cpp:166
ttk::ftm::FTMTree_MT::isRoot
bool isRoot(idNode nodeId)
Definition FTMTreeUtils.cpp:22
ttk::ftm::FTMTree_MT::getParentSafe
idNode getParentSafe(idNode nodeId)
Definition FTMTreeUtils.cpp:104
ttk::ftm::FTMTree_MT::getRoot
idNode getRoot()
Definition FTMTreeUtils.cpp:97
ttk::ftm::FTMTree_MT::isImportantPair
bool isImportantPair(idNode nodeId, double threshold, std::vector< double > &excludeLower, std::vector< double > &excludeHigher)
Definition FTMTreeUtils_Template.h:38
ttk::ftm::FTMTree_MT::getChildren
void getChildren(idNode nodeId, std::vector< idNode > &res)
Definition FTMTreeUtils.cpp:114
ttk::ftm::FTMTree_MT::isJoinTree
bool isJoinTree()
Definition FTMTreeUtils_Template.h:19
ttk::ftm::FTMTree_MT::isLeaf
bool isLeaf(idNode nodeId)
Definition FTMTreeUtils.cpp:26
ttk::ftm::FTMTree_MT::getRealNumberOfNodes
int getRealNumberOfNodes()
Definition FTMTreeUtils.cpp:145
ttk::ftm::FTMTree_MT::isNodeAlone
bool isNodeAlone(idNode nodeId)
Definition FTMTreeUtils.cpp:30
ttk::ftm::FTMTree_MT::isBranchOrigin
bool isBranchOrigin(idNode nodeId)
Definition FTMTreeUtils.cpp:39
ttk::ftm::FTMTree_MT::getBranchOriginsFromThisBranch
void getBranchOriginsFromThisBranch(idNode node, std::tuple< std::vector< idNode >, std::vector< idNode > > &res)
Definition FTMTreeUtils.cpp:149
ttk::ftm::FTMTree_MT::getLeavesFromTree
void getLeavesFromTree(std::vector< idNode > &res)
Definition FTMTreeUtils.cpp:124
ttk::ftm::FTMTree_MT::getNode
Node * getNode(idNode nodeId)
Definition FTMTree_MT.h:393
ttk::ftm::FTMTree_MT::getBirth
dataType getBirth(idNode nodeId)
Definition FTMTreeUtils_Template.h:208
ttk::ftm::Node::getOrigin
SimplexId getOrigin() const
Definition FTMNode.h:64
ttk::ftm::idNode
unsigned int idNode
Node index in vect_nodes_.
Definition FTMDataTypes.h:39
ttk
The Topology ToolKit.
Definition AbstractTriangulation.h:51
end
T end(std::pair< T, T > &p)
Definition ripserpy.cpp:483
begin
T begin(std::pair< T, T > &p)
Definition ripserpy.cpp:479
printMsg
printMsg(debug::output::BOLD+" | | | | | . \\ | | (__| | / __/| |_| / __/|__ _|"+debug::output::ENDCOLOR, debug::Priority::PERFORMANCE, debug::LineMode::NEW, stream)
Generated on Thu Sep 26 2024 06:50:18 for TTK by doxygen 1.9.8