InfoVis.Tree.adjacencyPair Class Reference

List of all members.

Public Member Functions

 adjacencyPair ()
void buildDisplayList (Boolean varyingAlpha, Boolean colorDir)
void drawDisplayList ()
Boolean intersectWithLine (GiWEngine.Math.Vector3 m_StartPoint, GiWEngine.Math.Vector3 m_End)

Public Attributes

TreeNode start
TreeNode end
List< TreeNodemControlPoints
TreeNode lca
List< GiWEngine.Math.Vector3 > mFlattenedControlPoints
List< GiWEngine.Math.Vector3 > mCurvePoints
Boolean mSelected

Static Public Attributes

static int mostControlPoints

Private Member Functions

List< int > computeBinomialCoefficients (int numControlPoints)
GiWEngine.Math.Vector3 computeBezierPoint (float u, int numControlPoints, List< GiWEngine.Math.Vector3 > ctlrPts, List< int > coefficients)

Private Attributes

int curveList
float[] controlPoints

Detailed Description

Class representing an adjacency Pair Provides the necessary functions to remove LCA, compute Bezier Splines


Constructor & Destructor Documentation

InfoVis.Tree.adjacencyPair.adjacencyPair (  ) 

CTR of adjacencyPair


Member Function Documentation

List<int> InfoVis.Tree.adjacencyPair.computeBinomialCoefficients ( int  numControlPoints  )  [private]

computes the BinomialCoefficients for a given number of Control Points

Parameters:
numControlPoints number of controlPoints
Returns:
List<int> the BinomialCoefficients

GiWEngine.Math.Vector3 InfoVis.Tree.adjacencyPair.computeBezierPoint ( float  u,
int  numControlPoints,
List< GiWEngine.Math.Vector3 >  ctlrPts,
List< int >  coefficients 
) [private]

Computes a BezierPoint for a given u

Parameters:
u interval on Curve
numControlpoints number of controlPoints
ctlrPtr List<Vector3> controlPoints
coefficients BinomialCoefficients
Returns:
Vector3 BezierPoint

void InfoVis.Tree.adjacencyPair.buildDisplayList ( Boolean  varyingAlpha,
Boolean  colorDir 
)

builds DisplayList

Parameters:
varyingAlpha if curvelength changes alpha
colorDir if direction is color coded

void InfoVis.Tree.adjacencyPair.drawDisplayList (  ) 

draws the current curve

Boolean InfoVis.Tree.adjacencyPair.intersectWithLine ( GiWEngine.Math.Vector3  m_StartPoint,
GiWEngine.Math.Vector3  m_End 
)

Intersects a given Line with the current Curve

Parameters:
m_StartPoint starting Point of line
m_End end Point of Line
Returns:
if intersect


Member Data Documentation

TreeNode InfoVis.Tree.adjacencyPair.start

Start Node of AP

TreeNode InfoVis.Tree.adjacencyPair.end

End Node of AP

List<TreeNode> InfoVis.Tree.adjacencyPair.mControlPoints

Original ControlPoints of path

TreeNode InfoVis.Tree.adjacencyPair.lca

LCA

List<GiWEngine.Math.Vector3> InfoVis.Tree.adjacencyPair.mFlattenedControlPoints

Flattened ControlPoints of path

int InfoVis.Tree.adjacencyPair.curveList [private]

Index in CurveList

float [] InfoVis.Tree.adjacencyPair.controlPoints [private]

Positions of the ControlPoints of path

int InfoVis.Tree.adjacencyPair.mostControlPoints [static]

number of max Control Points in all Paths

List<GiWEngine.Math.Vector3> InfoVis.Tree.adjacencyPair.mCurvePoints

Points of Curve

Boolean InfoVis.Tree.adjacencyPair.mSelected

If Curve is selected


The documentation for this class was generated from the following file:
Generated on Mon Jun 25 19:53:40 2007 for InfoVis Hierarchical Edge Boundles by  doxygen 1.5.2