Frequently Asked Questions
| Line 19: | Line 19: | ||
-To find most of the accidental 'bridges' try using a combination of filters such as : | -To find most of the accidental 'bridges' try using a combination of filters such as : | ||
-> 0 <= Is Leaf <= 0 | -> 0 <= Is Leaf <= 0 | ||
| − | -> | + | -> min <= # of Bits <= 3 or 4 |
| − | -> | + | -> min <= Trace Density <= 1 |
-To find the majority of false traces try using: | -To find the majority of false traces try using: | ||
-> 1 <= Is Leaf <= 0 | -> 1 <= Is Leaf <= 0 | ||
| − | -> 6 <= D to Parent <= | + | -> 6 <= D to Parent <= max |
| − | -> | + | -> min <= # of Bits <= 10 |
Where X is the default number for that property. | Where X is the default number for that property. | ||
Revision as of 16:52, 3 June 2010
Contents |
Q: How do I set roots?
A: When you open up a trace in the trace editor, there will be a label which says Unsolved Branches: #. In order to make this # zero, right click on the beginning point of one or more branches. Once your roots are selected click the 'Set Root' button at the top of the screen. If the number of unsolved branches does not go to zero, try repeating this process on a few more branches.
Q: There are unsolved branches, but I do not know where they are. How do I find them?
A: To make it easier, try selecting trees with roots you have previously set. To do this, right click part of the tree and click the 'Select Tree' button at the top of the screen. Now a large area is selected and the remaining unselected branches are more likely to belong to a tree where the roots have not yet been set.
Q: There are 0 unsolved branches, but nothing is connected. How do I fix this?
A: What may have happened is that the 'clear' button, or 'c' may have been pressed, accidentally deleting all branch points. To fix this, restart the program and set the roots.
Q: How do I handle many similar errors at once?
A: Use the filters available in the Features Table to find similar errors. Once the filter selects the areas with the desired properties, it is possible to handle all of these at one time by breaking, splitting or deleting the errors as you see fit.
-To find most of the accidental 'bridges' try using a combination of filters such as :
-> 0 <= Is Leaf <= 0
-> min <= # of Bits <= 3 or 4
-> min <= Trace Density <= 1
-To find the majority of false traces try using:
-> 1 <= Is Leaf <= 0
-> 6 <= D to Parent <= max
-> min <= # of Bits <= 10
Where X is the default number for that property.
