From 2b7f0aa2dde7d06367ee3139491d5d042cc268e3 Mon Sep 17 00:00:00 2001 From: Sylvain Joube Date: Thu, 11 Apr 2024 15:47:04 +0200 Subject: [PATCH] ROOT doc: update graph names + minor fix --- doc/root/README.md | 6 +++--- ...lucation_finding.png => duplication_finding.png} | Bin ...edy-solver.png => duplication_greedy-solver.png} | Bin 3 files changed, 3 insertions(+), 3 deletions(-) rename doc/root/images/{duplucation_finding.png => duplication_finding.png} (100%) rename doc/root/images/{duplucation_greedy-solver.png => duplication_greedy-solver.png} (100%) diff --git a/doc/root/README.md b/doc/root/README.md index 9f1c1c1b84..4c23f4cb47 100644 --- a/doc/root/README.md +++ b/doc/root/README.md @@ -10,7 +10,7 @@ Compiling ROOT and traccc with the same compiler (e.g. clang++) can avoid link e
-Once ROOT and traccc are built, don't forget to source the ROOT script once before running traccc: `source "/bin/thisroot.sh"`. +Once `ROOT` and `traccc` are built, don't forget to source the `ROOT` script once before running traccc: `source "/bin/thisroot.sh"`.
@@ -78,11 +78,11 @@ The native `TBwoser` should look like this. You can open `.root` files and displ The `Number of duplicated track candidates` plots represents the number of `track duplicates` as a function of a given variable (example: `phi`). It varies between zero (no shared hits between tracks) and the number of `duplicated tracks` for a given value (example: of `phi`). -![](images/duplucation_finding.png) +![](images/duplication_finding.png) There are often many duplicated tracks at the end of the finding algorithm. The last algorithm in the chain is an ambiguity solver which attempts to decrease the number of duplicates while keeping as much valid tracks as possible. Here the `greedy solver` removed all the duplicates. It is an implementation of the greedy ambiguity resolution algorithm from ACTS adapted to `traccc`. -![](images/duplucation_greedy-solver.png) +![](images/duplication_greedy-solver.png) The `Tracking Efficiency` plots represents the number of `tracks matching the trajectory of a truth particle`, as a function of a given variable. It ranges from zero (no valid track found for a given value) to one (all the tracks were found for a given value). diff --git a/doc/root/images/duplucation_finding.png b/doc/root/images/duplication_finding.png similarity index 100% rename from doc/root/images/duplucation_finding.png rename to doc/root/images/duplication_finding.png diff --git a/doc/root/images/duplucation_greedy-solver.png b/doc/root/images/duplication_greedy-solver.png similarity index 100% rename from doc/root/images/duplucation_greedy-solver.png rename to doc/root/images/duplication_greedy-solver.png