RadiusSum dialog.
Table of Contents
| Name | Direction | Type | Default | Description |
|---|---|---|---|---|
| InputWorkspace | Input | MatrixWorkspace | Mandatory | An input workspace. |
| OutputWorkspace | Output | MatrixWorkspace | Mandatory | An output workspace. |
| Centre | Input | dbl list | 0,0,0 | Coordinate of the centre of the ring |
| MinRadius | Input | number | 0 | Length of the inner ring. Default=0 |
| MaxRadius | Input | number | Optional | Length of the outer ring. Default=ImageSize. |
| NumBins | Input | number | 100 | Number of slice bins for the output. Default=100 |
| NormalizeByRadius | Input | boolean | False | Divide the sum of each ring by the radius powered by Normalization Order |
| NormalizationOrder | Input | number | 1 | If 2, the normalization will be divided by the quadratic value of the ring for each radius. |
RadiusSum sums the counts in rings against radius.
Below, there is an example of the execution of the RadiusSum to a Workspace2D where the position of the pixels are not associated to detector positions, but it is derived from the Axes.
The image below shows a visual interpretation for the inputs of the algorithm
The Algorithm create NumBins rings around the Centre point each
one with 
for
.
The algorithm applies a rudimentary calculation to define the bin for each that each pixel or detector in the Workspace2D, but taking its center point. If the center point belongs to one bin, it is considered that the whole pixel belongs to the bin. The picture below, shows what does this means. An ideal solution for RadiusSum is the left image, while the right image is what is current implemented.
Although the images were applied to an image Workspace2D, the image below shows that it is possible to apply this algorithm to Workspaces attached to instruments.
Categories: AlgorithmIndex | Transforms\Grouping
C++ source: RadiusSum.cpp (last modified: 2019-07-17)
C++ header: RadiusSum.h (last modified: 2019-01-11)