public class SkeletonResult extends Object
The meaning of its members should become clear when looking at AnalyzeSkeleton_'s source code.
Constructor and Description |
---|
SkeletonResult(int numOfTrees) |
Modifier and Type | Method and Description |
---|---|
int[] |
calculateNumberOfVoxels()
Calculates and saves the sum of voxels for every tree as the sum of end
points, junction voxels and "normal" voxels.
|
double[] |
getAverageBranchLength() |
int[] |
getBranches() |
int[] |
getEndPoints() |
Graph[] |
getGraph() |
int[] |
getJunctions() |
int[] |
getJunctionVoxels() |
ArrayList<Point> |
getListOfEndPoints() |
ArrayList<Point> |
getListOfJunctionVoxels() |
ArrayList<Point> |
getListOfSlabVoxels() |
ArrayList<Point> |
getListOfStartingSlabVoxels() |
double[] |
getMaximumBranchLength() |
int[] |
getNumberOfVoxels() |
int |
getNumOfTrees() |
int[] |
getQuadruples() |
ArrayList<Double> |
getShortestPathList() |
int[] |
getSlabs() |
double[][] |
getSpStartPosition() |
int[] |
getTriples() |
void |
setAverageBranchLength(double[] averageBranchLength) |
void |
setBranches(int[] numberOfBranches) |
void |
setEndPoints(int[] numberOfEndPoints) |
void |
setGraph(Graph[] graph) |
void |
setJunctions(int[] numberOfJunctions) |
void |
setJunctionVoxels(int[] numberOfJunctionVoxels) |
void |
setListOfEndPoints(ArrayList<Point> listOfEndPoints) |
void |
setListOfJunctionVoxels(ArrayList<Point> listOfJunctionVoxels) |
void |
setListOfSlabVoxels(ArrayList<Point> listOfSlabVoxels) |
void |
setListOfStartingSlabVoxels(ArrayList<Point> listOfStartingSlabVoxels) |
void |
setMaximumBranchLength(double[] maximumBranchLength) |
void |
setNumberOfVoxels(int[] numberOfVoxels) |
void |
setNumOfTrees(int numOfTrees) |
void |
setQuadruples(int[] numberOfQuadruplePoints) |
void |
setShortestPathList(ArrayList<Double> shortestPathList) |
void |
setSlabs(int[] numberOfSlabs) |
void |
setSpStartPosition(double[][] spStartPosition) |
void |
setTriples(int[] numberOfTriplePoints) |
public void setNumOfTrees(int numOfTrees)
public void setBranches(int[] numberOfBranches)
public void setJunctions(int[] numberOfJunctions)
public void setEndPoints(int[] numberOfEndPoints)
public void setJunctionVoxels(int[] numberOfJunctionVoxels)
public void setSlabs(int[] numberOfSlabs)
public void setNumberOfVoxels(int[] numberOfVoxels)
public void setTriples(int[] numberOfTriplePoints)
public void setQuadruples(int[] numberOfQuadruplePoints)
public void setAverageBranchLength(double[] averageBranchLength)
public void setMaximumBranchLength(double[] maximumBranchLength)
public void setListOfStartingSlabVoxels(ArrayList<Point> listOfStartingSlabVoxels)
public void setSpStartPosition(double[][] spStartPosition)
public void setGraph(Graph[] graph)
public int getNumOfTrees()
public int[] getBranches()
public int[] getJunctions()
public int[] getEndPoints()
public int[] getJunctionVoxels()
public int[] getSlabs()
public int[] getTriples()
public int[] getQuadruples()
public double[] getAverageBranchLength()
public double[] getMaximumBranchLength()
public int[] getNumberOfVoxels()
public double[][] getSpStartPosition()
public Graph[] getGraph()
public int[] calculateNumberOfVoxels()
numberOfEndPoints, numberOfJunctionVoxels and numberOfSlabs must exit and have at least numOfTrees fields each.
Copyright © 2015–2021 Fiji. All rights reserved.