See: Description
Class  Description 

SoChamferDistanceMapProcessing2d 
SoChamferDistanceMapProcessing2d engine
The SoChamferDistanceMapProcessing2d engine computes the chamfer distance transformation. 
SoChamferDistanceMapProcessing3d 
SoChamferDistanceMapProcessing3d engine
The SoChamferDistanceMapProcessing3d engine computes a 3D chamfer distance transformation. 
SoChessboardDistanceMapProcessing 
SoChessboardDistanceMapProcessing engine
The SoChessboardDistanceMapProcessing engine computes the chessboard distance transformation. 
SoClosestBoundaryPointsProcessing2d 
SoClosestBoundaryPointsProcessing2d engine
The SoClosestBoundaryPointsProcessing2d engine computes the chamfer distance map on object boundary and the closest point. 
SoClosestBoundaryPointsProcessing3d 
SoClosestBoundaryPointsProcessing3d engine
The SoClosestBoundaryPointsProcessing3d engine computes the chamfer distance map on object boundary and the closest point. 
SoEuclideanDistanceMapProcessing3d 
SoEuclideanDistanceMapProcessing3d image filter
This algorithm computes a 3D distance map for a 3D object. 
SoGeodesicDistanceMapProcessing 
SoGeodesicDistanceMapProcessing engine
The SoGeodesicDistanceMapProcessing engine computes the Chamfer distance using a mask of forbidden areas. 
SoGeodesicPropagationProcessing2d 
SoGeodesicPropagationProcessing2d engine
For an introduction to geodesy, see section Geodesy Principle. 
SoLocalThicknessMapProcessing3d 
SoLocalThicknessMapProcessing3d engine
This algorithm computes an inside 3D euclidean map of a 3D object. 
SoTimeMapProcessing 
SoTimeMapProcessing engine
The SoTimeMapProcessing engine computes the shortest travel time between one point of the output image and the binary mask. 
Enum  Description 

SoEuclideanDistanceMapProcessing3d.BorderConditions 
This enumeration defines the border condition.

SoEuclideanDistanceMapProcessing3d.MappingModes 
This enumeration defines all regions in which the distance map is computed.

SoLocalThicknessMapProcessing3d.PrecisionModes 
Geodesy is by definition the science of measuring the shape of the earth. When applied to image processing it is the science of measuring the exact shape of objects included in an image. The geodesic distance is defined as follows:
If two points and belong to then is the shortest distance between the two points with the condition that the entire path between the points is included in the particle . If one of the points is outside then . If the points belong to 2 disjointed components, then
This geodesic distance is actually a distance for any set without any hole. A geodesic disk, , is then defined, as shown in figure below.
The geodesic notion implies that each particle is fully independent of its neighbours in the image. Moreover, one may introduce the geodesic erosion and dilation. The geodesic dilation is equivalent to a reconstruction in the continuous space. One can show that a discrete geodesic dilation of size is actually dilations of size 1, each dilation being followed by an intersection with the set . In this case, the underlying discrete distance is defined by the elementary discrete disk (a square or hexagon depending on the grid). The propagation function is then defined as:
It corresponds to the geodesic distance between point and the furthest point of .
Generated on September 3, 2019, Copyright © Thermo Fisher Scientific. All rights reserved. http://www.openinventor.com