mitkUnstructuredGridClusteringFilter.h File Reference

#include <MitkAlgorithmsExtExports.h>
#include <mitkCommon.h>
#include <mitkUnstructuredGrid.h>
#include <mitkUnstructuredGridToUnstructuredGridFilter.h>
#include <vtkIdList.h>
#include <vtkPoints.h>
#include <vtkSmartPointer.h>

Go to the source code of this file.

Classes
class	mitk::UnstructuredGridClusteringFilter
	This filter uses the DBSCAN algorithm for clustering an mitk::UnstructuredGrid. "MinPts" defines the number of neighbours which are required to be a kernel point if a point is in range of a kernel point but hasn't enough neighbours this point is added to the cluster but is a density reachable point and the cluster ends at this point. "eps" is the range in which the neighbours are searched. If "Meshing" is set the clusteres UnstructuredGrid is meshed and visible in 2D renderwindows. More...

Namespaces
	mitk
	Find image slices visible on a given plane.