ActiViz .NET  5.8.0
Public Member Functions | Static Public Member Functions | Public Attributes | Static Public Attributes | Protected Member Functions | Private Member Functions | Static Private Member Functions
Kitware.VTK.vtkGraphHierarchicalBundleEdges Class Reference

vtkGraphHierarchicalBundleEdges - layout graph arcs in bundles More...

Inheritance diagram for Kitware.VTK.vtkGraphHierarchicalBundleEdges:
[legend]
Collaboration diagram for Kitware.VTK.vtkGraphHierarchicalBundleEdges:
[legend]

List of all members.

Public Member Functions

 vtkGraphHierarchicalBundleEdges (IntPtr rawCppThis, bool callDisposalMethod, bool strong)
 Automatically generated constructor - called from generated code. DO NOT call directly.
 vtkGraphHierarchicalBundleEdges ()
 Undocumented Block.
virtual void DirectMappingOff ()
 If on, uses direct mapping from tree to graph vertices. If off, both the graph and tree must contain PedigreeId arrays which are used to match graph and tree vertices. Default is off.
virtual void DirectMappingOn ()
 If on, uses direct mapping from tree to graph vertices. If off, both the graph and tree must contain PedigreeId arrays which are used to match graph and tree vertices. Default is off.
virtual int FillInputPortInformation (int port, vtkInformation info)
 Set the input type of the algorithm to vtkGraph.
virtual double GetBundlingStrength ()
 The level of arc bundling in the graph. A strength of 0 creates straight lines, while a strength of 1 forces arcs to pass directly through hierarchy node points. The default value is 0.8.
virtual double GetBundlingStrengthMaxValue ()
 The level of arc bundling in the graph. A strength of 0 creates straight lines, while a strength of 1 forces arcs to pass directly through hierarchy node points. The default value is 0.8.
virtual double GetBundlingStrengthMinValue ()
 The level of arc bundling in the graph. A strength of 0 creates straight lines, while a strength of 1 forces arcs to pass directly through hierarchy node points. The default value is 0.8.
virtual bool GetDirectMapping ()
 If on, uses direct mapping from tree to graph vertices. If off, both the graph and tree must contain PedigreeId arrays which are used to match graph and tree vertices. Default is off.
override int IsA (string type)
 Undocumented Block.
new vtkGraphHierarchicalBundleEdges NewInstance ()
 Undocumented Block.
virtual void SetBundlingStrength (double _arg)
 The level of arc bundling in the graph. A strength of 0 creates straight lines, while a strength of 1 forces arcs to pass directly through hierarchy node points. The default value is 0.8.
virtual void SetDirectMapping (bool _arg)
 If on, uses direct mapping from tree to graph vertices. If off, both the graph and tree must contain PedigreeId arrays which are used to match graph and tree vertices. Default is off.

Static Public Member Functions

static new
vtkGraphHierarchicalBundleEdges 
New ()
 Undocumented Block.
static new int IsTypeOf (string type)
 Undocumented Block.
static new
vtkGraphHierarchicalBundleEdges 
SafeDownCast (vtkObjectBase o)
 Undocumented Block.

Public Attributes

new const string MRFullTypeName = "Kitware.VTK.vtkGraphHierarchicalBundleEdges"
 Automatically generated type registration mechanics.

Static Public Attributes

static new readonly string MRClassNameKey = "31vtkGraphHierarchicalBundleEdges"
 Automatically generated type registration mechanics.

Protected Member Functions

override void Dispose (bool disposing)
 Automatically generated protected Dispose method - called from public Dispose or the C# destructor. DO NOT call directly.

Private Member Functions

static internal IntPtr vtkGraphHierarchicalBundleEdges_New (ref uint mteStatus, ref uint mteIndex, ref uint rawRefCount)
static internal void vtkGraphHierarchicalBundleEdges_DirectMappingOff_01 (HandleRef pThis)
static internal void vtkGraphHierarchicalBundleEdges_DirectMappingOn_02 (HandleRef pThis)
static internal int vtkGraphHierarchicalBundleEdges_FillInputPortInformation_03 (HandleRef pThis, int port, HandleRef info)
static internal double vtkGraphHierarchicalBundleEdges_GetBundlingStrength_04 (HandleRef pThis)
static internal double vtkGraphHierarchicalBundleEdges_GetBundlingStrengthMaxValue_05 (HandleRef pThis)
static internal double vtkGraphHierarchicalBundleEdges_GetBundlingStrengthMinValue_06 (HandleRef pThis)
static internal byte vtkGraphHierarchicalBundleEdges_GetDirectMapping_07 (HandleRef pThis)
static internal int vtkGraphHierarchicalBundleEdges_IsA_08 (HandleRef pThis, string type)
static internal int vtkGraphHierarchicalBundleEdges_IsTypeOf_09 (string type)
static internal IntPtr vtkGraphHierarchicalBundleEdges_NewInstance_11 (HandleRef pThis, ref uint mteStatus, ref uint mteIndex, ref uint rawRefCount)
static internal IntPtr vtkGraphHierarchicalBundleEdges_SafeDownCast_12 (HandleRef o, ref uint mteStatus, ref uint mteIndex, ref uint rawRefCount)
static internal void vtkGraphHierarchicalBundleEdges_SetBundlingStrength_13 (HandleRef pThis, double _arg)
static internal void vtkGraphHierarchicalBundleEdges_SetDirectMapping_14 (HandleRef pThis, byte _arg)

Static Private Member Functions

static vtkGraphHierarchicalBundleEdges ()
 Automatically generated type registration mechanics.

Detailed Description

vtkGraphHierarchicalBundleEdges - layout graph arcs in bundles

Description This algorithm creates a vtkPolyData from a vtkGraph. As opposed to vtkGraphToPolyData, which converts each arc into a straight line, each arc is converted to a polyline, following a tree structure. The filter requires both a vtkGraph and vtkTree as input. The tree vertices must be a superset of the graph vertices. A common example is when the graph vertices correspond to the leaves of the tree, but the internal vertices of the tree represent groupings of graph vertices. The algorithm matches the vertices using the array "PedigreeId". The user may alternately set the DirectMapping flag to indicate that the two structures must have directly corresponding offsets (i.e. node i in the graph must correspond to node i in the tree).

The vtkGraph defines the topology of the output vtkPolyData (i.e. the connections between nodes) while the vtkTree defines the geometry (i.e. the location of nodes and arc routes). Thus, the tree must have been assigned vertex locations, but the graph does not need locations, in fact they will be ignored. The edges approximately follow the path from the source to target nodes in the tree. A bundling parameter controls how closely the edges are bundled together along the tree structure.

You may follow this algorithm with vtkSplineFilter in order to make nicely curved edges.


Constructor & Destructor Documentation

Automatically generated type registration mechanics.

Kitware.VTK.vtkGraphHierarchicalBundleEdges.vtkGraphHierarchicalBundleEdges ( IntPtr  rawCppThis,
bool  callDisposalMethod,
bool  strong 
)

Automatically generated constructor - called from generated code. DO NOT call directly.

Undocumented Block.


Member Function Documentation

If on, uses direct mapping from tree to graph vertices. If off, both the graph and tree must contain PedigreeId arrays which are used to match graph and tree vertices. Default is off.

If on, uses direct mapping from tree to graph vertices. If off, both the graph and tree must contain PedigreeId arrays which are used to match graph and tree vertices. Default is off.

override void Kitware.VTK.vtkGraphHierarchicalBundleEdges.Dispose ( bool  disposing) [protected]

Automatically generated protected Dispose method - called from public Dispose or the C# destructor. DO NOT call directly.

Reimplemented from Kitware.VTK.vtkGraphAlgorithm.

Set the input type of the algorithm to vtkGraph.

The level of arc bundling in the graph. A strength of 0 creates straight lines, while a strength of 1 forces arcs to pass directly through hierarchy node points. The default value is 0.8.

The level of arc bundling in the graph. A strength of 0 creates straight lines, while a strength of 1 forces arcs to pass directly through hierarchy node points. The default value is 0.8.

The level of arc bundling in the graph. A strength of 0 creates straight lines, while a strength of 1 forces arcs to pass directly through hierarchy node points. The default value is 0.8.

If on, uses direct mapping from tree to graph vertices. If off, both the graph and tree must contain PedigreeId arrays which are used to match graph and tree vertices. Default is off.

override int Kitware.VTK.vtkGraphHierarchicalBundleEdges.IsA ( string  type) [virtual]

Undocumented Block.

Reimplemented from Kitware.VTK.vtkGraphAlgorithm.

static new int Kitware.VTK.vtkGraphHierarchicalBundleEdges.IsTypeOf ( string  type) [static]

Undocumented Block.

Reimplemented from Kitware.VTK.vtkGraphAlgorithm.

Undocumented Block.

Reimplemented from Kitware.VTK.vtkGraphAlgorithm.

Undocumented Block.

Reimplemented from Kitware.VTK.vtkGraphAlgorithm.

Undocumented Block.

Reimplemented from Kitware.VTK.vtkGraphAlgorithm.

Here is the call graph for this function:

virtual void Kitware.VTK.vtkGraphHierarchicalBundleEdges.SetBundlingStrength ( double  _arg) [virtual]

The level of arc bundling in the graph. A strength of 0 creates straight lines, while a strength of 1 forces arcs to pass directly through hierarchy node points. The default value is 0.8.

virtual void Kitware.VTK.vtkGraphHierarchicalBundleEdges.SetDirectMapping ( bool  _arg) [virtual]

If on, uses direct mapping from tree to graph vertices. If off, both the graph and tree must contain PedigreeId arrays which are used to match graph and tree vertices. Default is off.

static internal int Kitware.VTK.vtkGraphHierarchicalBundleEdges.vtkGraphHierarchicalBundleEdges_FillInputPortInformation_03 ( HandleRef  pThis,
int  port,
HandleRef  info 
) [private]
static internal int Kitware.VTK.vtkGraphHierarchicalBundleEdges.vtkGraphHierarchicalBundleEdges_IsA_08 ( HandleRef  pThis,
string  type 
) [private]
static internal IntPtr Kitware.VTK.vtkGraphHierarchicalBundleEdges.vtkGraphHierarchicalBundleEdges_New ( ref uint  mteStatus,
ref uint  mteIndex,
ref uint  rawRefCount 
) [private]
static internal IntPtr Kitware.VTK.vtkGraphHierarchicalBundleEdges.vtkGraphHierarchicalBundleEdges_NewInstance_11 ( HandleRef  pThis,
ref uint  mteStatus,
ref uint  mteIndex,
ref uint  rawRefCount 
) [private]
static internal IntPtr Kitware.VTK.vtkGraphHierarchicalBundleEdges.vtkGraphHierarchicalBundleEdges_SafeDownCast_12 ( HandleRef  o,
ref uint  mteStatus,
ref uint  mteIndex,
ref uint  rawRefCount 
) [private]
static internal void Kitware.VTK.vtkGraphHierarchicalBundleEdges.vtkGraphHierarchicalBundleEdges_SetBundlingStrength_13 ( HandleRef  pThis,
double  _arg 
) [private]
static internal void Kitware.VTK.vtkGraphHierarchicalBundleEdges.vtkGraphHierarchicalBundleEdges_SetDirectMapping_14 ( HandleRef  pThis,
byte  _arg 
) [private]

Member Data Documentation

new readonly string Kitware.VTK.vtkGraphHierarchicalBundleEdges.MRClassNameKey = "31vtkGraphHierarchicalBundleEdges" [static]

Automatically generated type registration mechanics.

Reimplemented from Kitware.VTK.vtkGraphAlgorithm.

new const string Kitware.VTK.vtkGraphHierarchicalBundleEdges.MRFullTypeName = "Kitware.VTK.vtkGraphHierarchicalBundleEdges"

Automatically generated type registration mechanics.

Reimplemented from Kitware.VTK.vtkGraphAlgorithm.


The documentation for this class was generated from the following file: