ITK
5.2.0
Insight Toolkit
|
#include <itkFastMarchingImageFilter.h>
Classes | |
class | AxisNodeType |
Public Types | |
using | ConstPointer = SmartPointer< const Self > |
using | IndexType = Index< Self::SetDimension > |
using | LabelEnum = FastMarchingImageFilterEnums::Label |
using | LabelImagePointer = typename LabelImageType::Pointer |
using | LabelImageType = Image< LabelEnum, Self::SetDimension > |
using | LevelSetImageType = typename LevelSetType::LevelSetImageType |
using | LevelSetPointer = typename LevelSetType::LevelSetPointer |
using | LevelSetType = LevelSetTypeDefault< TLevelSet > |
using | NodeContainer = typename LevelSetType::NodeContainer |
using | NodeContainerPointer = typename LevelSetType::NodeContainerPointer |
using | NodeIndexType = typename NodeType::IndexType |
using | NodeType = typename LevelSetType::NodeType |
using | OutputDirectionType = typename LevelSetImageType::DirectionType |
using | OutputPointType = typename LevelSetImageType::PointType |
using | OutputRegionType = typename LevelSetImageType::RegionType |
using | OutputSizeType = typename LevelSetImageType::SizeType |
using | OutputSpacingType = typename LevelSetImageType::SpacingType |
using | PixelType = typename LevelSetType::PixelType |
using | Pointer = SmartPointer< Self > |
using | Self = FastMarchingImageFilter |
using | SpeedImageConstPointer = typename SpeedImageType::ConstPointer |
using | SpeedImagePointer = typename SpeedImageType::Pointer |
using | SpeedImageType = TSpeedImage |
using | Superclass = ImageToImageFilter< TSpeedImage, TLevelSet > |
Public Types inherited from itk::ImageToImageFilter< TSpeedImage, TLevelSet > | |
using | ConstPointer = SmartPointer< const Self > |
using | InputImageConstPointer = typename InputImageType::ConstPointer |
using | InputImagePixelType = typename InputImageType::PixelType |
using | InputImagePointer = typename InputImageType::Pointer |
using | InputImageRegionType = typename InputImageType::RegionType |
using | InputImageType = TSpeedImage |
using | OutputImagePixelType = typename Superclass::OutputImagePixelType |
using | OutputImageRegionType = typename Superclass::OutputImageRegionType |
using | Pointer = SmartPointer< Self > |
using | Self = ImageToImageFilter |
using | Superclass = ImageSource< TLevelSet > |
Public Types inherited from itk::ImageSource< TLevelSet > | |
using | ConstPointer = SmartPointer< const Self > |
using | DataObjectIdentifierType = Superclass::DataObjectIdentifierType |
using | DataObjectPointer = DataObject::Pointer |
using | DataObjectPointerArraySizeType = Superclass::DataObjectPointerArraySizeType |
using | OutputImagePixelType = typename OutputImageType::PixelType |
using | OutputImagePointer = typename OutputImageType::Pointer |
using | OutputImageRegionType = typename OutputImageType::RegionType |
using | OutputImageType = TLevelSet |
using | Pointer = SmartPointer< Self > |
using | Self = ImageSource |
using | Superclass = ProcessObject |
Public Types inherited from itk::ProcessObject | |
using | ConstPointer = SmartPointer< const Self > |
using | DataObjectIdentifierType = DataObject::DataObjectIdentifierType |
using | DataObjectPointer = DataObject::Pointer |
using | DataObjectPointerArray = std::vector< DataObjectPointer > |
using | DataObjectPointerArraySizeType = DataObjectPointerArray::size_type |
using | MultiThreaderType = MultiThreaderBase |
using | NameArray = std::vector< DataObjectIdentifierType > |
using | Pointer = SmartPointer< Self > |
using | Self = ProcessObject |
using | Superclass = Object |
Public Types inherited from itk::Object | |
using | ConstPointer = SmartPointer< const Self > |
using | Pointer = SmartPointer< Self > |
using | Self = Object |
using | Superclass = LightObject |
Public Types inherited from itk::LightObject | |
using | ConstPointer = SmartPointer< const Self > |
using | Pointer = SmartPointer< Self > |
using | Self = LightObject |
Static Public Member Functions | |
static Pointer | New () |
Static Public Member Functions inherited from itk::ImageToImageFilter< TSpeedImage, TLevelSet > | |
static void | SetGlobalDefaultDirectionTolerance (double) |
static double | GetGlobalDefaultDirectionTolerance () |
static void | SetGlobalDefaultCoordinateTolerance (double) |
static double | GetGlobalDefaultCoordinateTolerance () |
Static Public Member Functions inherited from itk::Object | |
static bool | GetGlobalWarningDisplay () |
static void | GlobalWarningDisplayOff () |
static void | GlobalWarningDisplayOn () |
static Pointer | New () |
static void | SetGlobalWarningDisplay (bool val) |
Static Public Member Functions inherited from itk::LightObject | |
static void | BreakOnError () |
static Pointer | New () |
Solve an Eikonal equation using Fast Marching.
Fast marching solves an Eikonal equation where the speed is always non-negative and depends on the position only. Starting from an initial position on the front, fast marching systematically moves the front forward one grid point at a time.
Updates are performed using an entropy satisfy scheme where only "upwind" neighborhoods are used. This implementation of Fast Marching uses a std::priority_queue to locate the next proper grid position to update.
Fast Marching sweeps through N grid points in (N log N) steps to obtain the arrival time value as the front propagates through the grid.
Implementation of this class is based on Chapter 8 of "Level Set Methods and Fast Marching Methods", J.A. Sethian, Cambridge Press, Second edition, 1999.
This class is templated over the level set image type and the speed image type. The initial front is specified by two containers: one containing the known points and one containing the trial points. Alive points are those that are already part of the object, and trial points are considered for inclusion. In order for the filter to evolve, at least some trial points must be specified. These can for instance be specified as the layer of pixels around the alive points.
The speed function can be specified as a speed image or a speed constant. The speed image is set using the method SetInput(). If the speed image is nullptr, a constant speed function is used and is specified using method the SetSpeedConstant().
If the speed function is constant and of value one, fast marching results in an approximate distance function from the initial alive points. FastMarchingImageFilter is used in the ReinitializeLevelSetImageFilter object to create a signed distance function from the zero level set.
The algorithm can be terminated early by setting an appropriate stopping value. The algorithm terminates when the current arrival time being processed is greater than the stopping value.
There are two ways to specify the output image information ( LargestPossibleRegion, Spacing, Origin): (a) it is copied directly from the input speed image or (b) it is specified by the user. Default values are used if the user does not specify all the information.
The output information is computed as follows. If the speed image is nullptr or if the OverrideOutputInformation is set to true, the output information is set from user specified parameters. These parameters can be specified using methods SetOutputRegion(), SetOutputSpacing(), SetOutputDirection(), and SetOutputOrigin(). Else if the speed image is not nullptr, the output information is copied from the input speed image.
For an alternative implementation, see itk::FastMarchingImageFilter.
Possible Improvements: In the current implementation, std::priority_queue only allows taking nodes out from the front and putting nodes in from the back. To update a value already on the heap, a new node is added to the heap. The defunct old node is left on the heap. When it is removed from the top, it will be recognized as invalid and not used. Future implementations can implement the heap in a different way allowing the values to be updated. This will generally require some sift-up and sift-down functions and an image of back-pointers going from the image to heap in order to locate the node which is to be updated.
Definition at line 136 of file itkFastMarchingImageFilter.h.
using itk::FastMarchingImageFilter< TLevelSet, TSpeedImage >::ConstPointer = SmartPointer<const Self> |
Definition at line 145 of file itkFastMarchingImageFilter.h.
|
private |
Trial points are stored in a min-heap. This allow efficient access to the trial point with minimum value which is the next grid point the algorithm processes.
Definition at line 465 of file itkFastMarchingImageFilter.h.
|
private |
Trial points are stored in a min-heap. This allow efficient access to the trial point with minimum value which is the next grid point the algorithm processes.
Definition at line 467 of file itkFastMarchingImageFilter.h.
using itk::FastMarchingImageFilter< TLevelSet, TSpeedImage >::IndexType = Index<Self::SetDimension> |
Index type alias support
Definition at line 205 of file itkFastMarchingImageFilter.h.
using itk::FastMarchingImageFilter< TLevelSet, TSpeedImage >::LabelEnum = FastMarchingImageFilterEnums::Label |
Definition at line 207 of file itkFastMarchingImageFilter.h.
using itk::FastMarchingImageFilter< TLevelSet, TSpeedImage >::LabelImagePointer = typename LabelImageType::Pointer |
LabelImagePointer type alias support
Definition at line 221 of file itkFastMarchingImageFilter.h.
using itk::FastMarchingImageFilter< TLevelSet, TSpeedImage >::LabelImageType = Image<LabelEnum, Self::SetDimension> |
LabelImage type alias support
Definition at line 218 of file itkFastMarchingImageFilter.h.
using itk::FastMarchingImageFilter< TLevelSet, TSpeedImage >::LevelSetImageType = typename LevelSetType::LevelSetImageType |
Definition at line 155 of file itkFastMarchingImageFilter.h.
|
protected |
Trial points are stored in a min-heap. This allow efficient access to the trial point with minimum value which is the next grid point the algorithm processes.
Definition at line 432 of file itkFastMarchingImageFilter.h.
using itk::FastMarchingImageFilter< TLevelSet, TSpeedImage >::LevelSetPointer = typename LevelSetType::LevelSetPointer |
Definition at line 156 of file itkFastMarchingImageFilter.h.
using itk::FastMarchingImageFilter< TLevelSet, TSpeedImage >::LevelSetType = LevelSetTypeDefault<TLevelSet> |
Typedef support of level set method types.
Definition at line 154 of file itkFastMarchingImageFilter.h.
|
private |
Trial points are stored in a min-heap. This allow efficient access to the trial point with minimum value which is the next grid point the algorithm processes.
Definition at line 466 of file itkFastMarchingImageFilter.h.
using itk::FastMarchingImageFilter< TLevelSet, TSpeedImage >::NodeContainer = typename LevelSetType::NodeContainer |
Definition at line 160 of file itkFastMarchingImageFilter.h.
using itk::FastMarchingImageFilter< TLevelSet, TSpeedImage >::NodeContainerPointer = typename LevelSetType::NodeContainerPointer |
Definition at line 161 of file itkFastMarchingImageFilter.h.
using itk::FastMarchingImageFilter< TLevelSet, TSpeedImage >::NodeIndexType = typename NodeType::IndexType |
Definition at line 159 of file itkFastMarchingImageFilter.h.
using itk::FastMarchingImageFilter< TLevelSet, TSpeedImage >::NodeType = typename LevelSetType::NodeType |
Definition at line 158 of file itkFastMarchingImageFilter.h.
using itk::FastMarchingImageFilter< TLevelSet, TSpeedImage >::OutputDirectionType = typename LevelSetImageType::DirectionType |
Definition at line 165 of file itkFastMarchingImageFilter.h.
using itk::FastMarchingImageFilter< TLevelSet, TSpeedImage >::OutputPointType = typename LevelSetImageType::PointType |
Definition at line 166 of file itkFastMarchingImageFilter.h.
using itk::FastMarchingImageFilter< TLevelSet, TSpeedImage >::OutputRegionType = typename LevelSetImageType::RegionType |
Definition at line 163 of file itkFastMarchingImageFilter.h.
using itk::FastMarchingImageFilter< TLevelSet, TSpeedImage >::OutputSizeType = typename LevelSetImageType::SizeType |
Definition at line 162 of file itkFastMarchingImageFilter.h.
using itk::FastMarchingImageFilter< TLevelSet, TSpeedImage >::OutputSpacingType = typename LevelSetImageType::SpacingType |
Definition at line 164 of file itkFastMarchingImageFilter.h.
using itk::FastMarchingImageFilter< TLevelSet, TSpeedImage >::PixelType = typename LevelSetType::PixelType |
Definition at line 157 of file itkFastMarchingImageFilter.h.
using itk::FastMarchingImageFilter< TLevelSet, TSpeedImage >::Pointer = SmartPointer<Self> |
Definition at line 144 of file itkFastMarchingImageFilter.h.
using itk::FastMarchingImageFilter< TLevelSet, TSpeedImage >::Self = FastMarchingImageFilter |
Standard class typdedefs.
Definition at line 142 of file itkFastMarchingImageFilter.h.
using itk::FastMarchingImageFilter< TLevelSet, TSpeedImage >::SpeedImageConstPointer = typename SpeedImageType::ConstPointer |
Definition at line 198 of file itkFastMarchingImageFilter.h.
using itk::FastMarchingImageFilter< TLevelSet, TSpeedImage >::SpeedImagePointer = typename SpeedImageType::Pointer |
SpeedImagePointer type alias support
Definition at line 197 of file itkFastMarchingImageFilter.h.
using itk::FastMarchingImageFilter< TLevelSet, TSpeedImage >::SpeedImageType = TSpeedImage |
SpeedImage type alias support
Definition at line 194 of file itkFastMarchingImageFilter.h.
using itk::FastMarchingImageFilter< TLevelSet, TSpeedImage >::Superclass = ImageToImageFilter<TSpeedImage, TLevelSet> |
Definition at line 143 of file itkFastMarchingImageFilter.h.
|
protected |
Trial points are stored in a min-heap. This allow efficient access to the trial point with minimum value which is the next grid point the algorithm processes.
|
overrideprotecteddefault |
Trial points are stored in a min-heap. This allow efficient access to the trial point with minimum value which is the next grid point the algorithm processes.
|
virtual |
Trial points are stored in a min-heap. This allow efficient access to the trial point with minimum value which is the next grid point the algorithm processes.
|
virtual |
Trial points are stored in a min-heap. This allow efficient access to the trial point with minimum value which is the next grid point the algorithm processes.
|
virtual |
Create an object from an instance, potentially deferring to a factory. This method allows you to create an instance of an object that is exactly the same type as the referring object. This is useful in cases where an object has been cast back to a base class.
Reimplemented from itk::Object.
Reimplemented in itk::FastMarchingUpwindGradientImageFilter< TLevelSet, TSpeedImage >.
|
overrideprotectedvirtual |
Trial points are stored in a min-heap. This allow efficient access to the trial point with minimum value which is the next grid point the algorithm processes.
Reimplemented from itk::ProcessObject.
|
overrideprotectedvirtual |
Trial points are stored in a min-heap. This allow efficient access to the trial point with minimum value which is the next grid point the algorithm processes.
Reimplemented from itk::ProcessObject.
Reimplemented in itk::FastMarchingUpwindGradientImageFilter< TLevelSet, TSpeedImage >.
|
overrideprotectedvirtual |
Generate the output image meta information.
Reimplemented from itk::ProcessObject.
|
inline |
Get the container of Alive Points representing the initial front.
Definition at line 275 of file itkFastMarchingImageFilter.h.
|
virtual |
Get thConste Collect Points flag.
|
inline |
Get the point type label image.
Definition at line 299 of file itkFastMarchingImageFilter.h.
|
protectedvirtual |
Get Large Value. This value is used to represent the concept of infinity for the time assigned to pixels that have not been visited. This value is set by default to half the max() of the pixel type used to represent the time-crossing map.
|
protectedvirtual |
Trial points are stored in a min-heap. This allow efficient access to the trial point with minimum value which is the next grid point the algorithm processes.
|
virtual |
Run-time type information (and related methods).
Reimplemented from itk::ImageToImageFilter< TSpeedImage, TLevelSet >.
Reimplemented in itk::FastMarchingUpwindGradientImageFilter< TLevelSet, TSpeedImage >, and itk::FastMarchingExtensionImageFilter< TLevelSet, TAuxValue, VAuxDimension, TSpeedImage >.
|
inlineprotected |
Trial points are stored in a min-heap. This allow efficient access to the trial point with minimum value which is the next grid point the algorithm processes.
Definition at line 410 of file itkFastMarchingImageFilter.h.
|
virtual |
Trial points are stored in a min-heap. This allow efficient access to the trial point with minimum value which is the next grid point the algorithm processes.
|
virtual |
Trial points are stored in a min-heap. This allow efficient access to the trial point with minimum value which is the next grid point the algorithm processes.
|
virtual |
Trial points are stored in a min-heap. This allow efficient access to the trial point with minimum value which is the next grid point the algorithm processes.
|
virtual |
Trial points are stored in a min-heap. This allow efficient access to the trial point with minimum value which is the next grid point the algorithm processes.
|
inlinevirtual |
Trial points are stored in a min-heap. This allow efficient access to the trial point with minimum value which is the next grid point the algorithm processes.
Definition at line 368 of file itkFastMarchingImageFilter.h.
|
virtual |
Trial points are stored in a min-heap. This allow efficient access to the trial point with minimum value which is the next grid point the algorithm processes.
|
virtual |
Trial points are stored in a min-heap. This allow efficient access to the trial point with minimum value which is the next grid point the algorithm processes.
|
inline |
Get the container of Processed Points. If the CollectPoints flag is set, the algorithm collects a container of all processed nodes. This is useful for defining creating Narrowbands for level set algorithms that supports narrow banding.
Definition at line 351 of file itkFastMarchingImageFilter.h.
|
virtual |
Get the Speed Constant.
|
protectedvirtual |
Trial points are stored in a min-heap. This allow efficient access to the trial point with minimum value which is the next grid point the algorithm processes.
|
virtual |
Get the Fast Marching algorithm Stopping Value.
|
inline |
Get the container of Trial Points representing the initial front.
Definition at line 292 of file itkFastMarchingImageFilter.h.
|
protectedvirtual |
Trial points are stored in a min-heap. This allow efficient access to the trial point with minimum value which is the next grid point the algorithm processes.
Reimplemented in itk::FastMarchingUpwindGradientImageFilter< TLevelSet, TSpeedImage >.
|
static |
Method for creation through the object factory.
|
virtual |
Trial points are stored in a min-heap. This allow efficient access to the trial point with minimum value which is the next grid point the algorithm processes.
|
virtual |
Trial points are stored in a min-heap. This allow efficient access to the trial point with minimum value which is the next grid point the algorithm processes.
|
overrideprotectedvirtual |
Trial points are stored in a min-heap. This allow efficient access to the trial point with minimum value which is the next grid point the algorithm processes.
Reimplemented from itk::ProcessObject.
Reimplemented in itk::FastMarchingUpwindGradientImageFilter< TLevelSet, TSpeedImage >.
|
inline |
Set the container of Alive Points representing the initial front. Alive points are represented as a VectorContainer of LevelSetNodes.
Definition at line 266 of file itkFastMarchingImageFilter.h.
|
inline |
|
virtual |
Set the Collect Points flag. Instrument the algorithm to collect a container of all nodes which it has visited. Useful for creating Narrowbands for level set algorithms that supports narrow banding.
|
virtual |
|
virtual |
Trial points are stored in a min-heap. This allow efficient access to the trial point with minimum value which is the next grid point the algorithm processes.
|
virtual |
Trial points are stored in a min-heap. This allow efficient access to the trial point with minimum value which is the next grid point the algorithm processes.
|
virtual |
Trial points are stored in a min-heap. This allow efficient access to the trial point with minimum value which is the next grid point the algorithm processes.
|
inlinevirtual |
The output largest possible, spacing and origin is computed as follows. If the speed image is nullptr or if the OverrideOutputInformation is true, the output information is set from user specified parameters. These parameters can be specified using methods SetOutputRegion(), SetOutputSpacing(), SetOutputDirection(), and SetOutputOrigin(). Else if the speed image is not nullptr, the output information is copied from the input speed image.
Definition at line 363 of file itkFastMarchingImageFilter.h.
|
virtual |
Trial points are stored in a min-heap. This allow efficient access to the trial point with minimum value which is the next grid point the algorithm processes.
|
inline |
Set the container of points that are not meant to be evaluated.
Definition at line 256 of file itkFastMarchingImageFilter.h.
|
virtual |
Trial points are stored in a min-heap. This allow efficient access to the trial point with minimum value which is the next grid point the algorithm processes.
|
inline |
Set the Speed Constant. If the Speed Image is nullptr, the SpeedConstant value is used for the whole level set. By default, the SpeedConstant is set to 1.0.
Definition at line 308 of file itkFastMarchingImageFilter.h.
|
virtual |
Set the Fast Marching algorithm Stopping Value. The Fast Marching algorithm is terminated when the value of the smallest trial point is greater than the stopping value.
|
inline |
Set the container of Trial Points representing the initial front. Trial points are represented as a VectorContainer of LevelSetNodes.
Definition at line 283 of file itkFastMarchingImageFilter.h.
|
protectedvirtual |
Trial points are stored in a min-heap. This allow efficient access to the trial point with minimum value which is the next grid point the algorithm processes.
Reimplemented in itk::FastMarchingUpwindGradientImageFilter< TLevelSet, TSpeedImage >.
|
protectedvirtual |
Trial points are stored in a min-heap. This allow efficient access to the trial point with minimum value which is the next grid point the algorithm processes.
|
private |
Trial points are stored in a min-heap. This allow efficient access to the trial point with minimum value which is the next grid point the algorithm processes.
Definition at line 437 of file itkFastMarchingImageFilter.h.
|
protected |
Trial points are stored in a min-heap. This allow efficient access to the trial point with minimum value which is the next grid point the algorithm processes.
Definition at line 429 of file itkFastMarchingImageFilter.h.
|
private |
Trial points are stored in a min-heap. This allow efficient access to the trial point with minimum value which is the next grid point the algorithm processes.
Definition at line 450 of file itkFastMarchingImageFilter.h.
|
private |
Trial points are stored in a min-heap. This allow efficient access to the trial point with minimum value which is the next grid point the algorithm processes.
Definition at line 447 of file itkFastMarchingImageFilter.h.
|
private |
Trial points are stored in a min-heap. This allow efficient access to the trial point with minimum value which is the next grid point the algorithm processes.
Definition at line 444 of file itkFastMarchingImageFilter.h.
|
private |
Trial points are stored in a min-heap. This allow efficient access to the trial point with minimum value which is the next grid point the algorithm processes.
Definition at line 459 of file itkFastMarchingImageFilter.h.
|
protected |
Trial points are stored in a min-heap. This allow efficient access to the trial point with minimum value which is the next grid point the algorithm processes.
Definition at line 434 of file itkFastMarchingImageFilter.h.
|
private |
Trial points are stored in a min-heap. This allow efficient access to the trial point with minimum value which is the next grid point the algorithm processes.
Definition at line 460 of file itkFastMarchingImageFilter.h.
|
private |
Trial points are stored in a min-heap. This allow efficient access to the trial point with minimum value which is the next grid point the algorithm processes.
Definition at line 471 of file itkFastMarchingImageFilter.h.
|
private |
Trial points are stored in a min-heap. This allow efficient access to the trial point with minimum value which is the next grid point the algorithm processes.
Definition at line 456 of file itkFastMarchingImageFilter.h.
|
private |
Trial points are stored in a min-heap. This allow efficient access to the trial point with minimum value which is the next grid point the algorithm processes.
Definition at line 454 of file itkFastMarchingImageFilter.h.
|
private |
Trial points are stored in a min-heap. This allow efficient access to the trial point with minimum value which is the next grid point the algorithm processes.
Definition at line 453 of file itkFastMarchingImageFilter.h.
|
private |
Trial points are stored in a min-heap. This allow efficient access to the trial point with minimum value which is the next grid point the algorithm processes.
Definition at line 455 of file itkFastMarchingImageFilter.h.
|
private |
Trial points are stored in a min-heap. This allow efficient access to the trial point with minimum value which is the next grid point the algorithm processes.
Definition at line 442 of file itkFastMarchingImageFilter.h.
|
private |
Trial points are stored in a min-heap. This allow efficient access to the trial point with minimum value which is the next grid point the algorithm processes.
Definition at line 457 of file itkFastMarchingImageFilter.h.
|
private |
Trial points are stored in a min-heap. This allow efficient access to the trial point with minimum value which is the next grid point the algorithm processes.
Definition at line 451 of file itkFastMarchingImageFilter.h.
|
private |
Trial points are stored in a min-heap. This allow efficient access to the trial point with minimum value which is the next grid point the algorithm processes.
Definition at line 446 of file itkFastMarchingImageFilter.h.
|
protected |
Trial points are stored in a min-heap. This allow efficient access to the trial point with minimum value which is the next grid point the algorithm processes.
Definition at line 433 of file itkFastMarchingImageFilter.h.
|
private |
Trial points are stored in a min-heap. This allow efficient access to the trial point with minimum value which is the next grid point the algorithm processes.
Definition at line 448 of file itkFastMarchingImageFilter.h.
|
private |
Trial points are stored in a min-heap. This allow efficient access to the trial point with minimum value which is the next grid point the algorithm processes.
Definition at line 469 of file itkFastMarchingImageFilter.h.
|
private |
Trial points are stored in a min-heap. This allow efficient access to the trial point with minimum value which is the next grid point the algorithm processes.
Definition at line 441 of file itkFastMarchingImageFilter.h.
|
staticconstexpr |
Dimension of the level set and the speed image.
Definition at line 201 of file itkFastMarchingImageFilter.h.
|
staticconstexpr |
Definition at line 202 of file itkFastMarchingImageFilter.h.