Property | Type | Description | |
---|---|---|---|
Head | |||
Tail |
Property | Type | Description | |
---|---|---|---|
Search |
Method | Description | |
---|---|---|
AddNode ( |
||
AdvancingFront ( |
||
LocateNode ( TriangulationPoint point ) : |
We use a balancing tree to locate a node smaller or equal to given key value
|
|
LocatePoint ( TriangulationPoint point ) : |
This implementation will use simple node traversal algorithm to find a point on the front
|
|
RemoveNode ( |
||
ToString ( ) : string |
Method | Description | |
---|---|---|
FindSearchNode ( double x ) : |
MM: This seems to be used by LocateNode to guess a position in the implicit linked list of AdvancingFrontNodes near x Removed an overload that depended on this being exact
|
|
LocateNode ( double x ) : |
public AddNode ( |
||
node | ||
return | void |
public AdvancingFront ( |
||
head | ||
tail | ||
return | System |
public LocateNode ( TriangulationPoint point ) : |
||
point | TriangulationPoint | |
return |
public LocatePoint ( TriangulationPoint point ) : |
||
point | TriangulationPoint | |
return |
public RemoveNode ( |
||
node | ||
return | void |
public AdvancingFrontNode,FarseerPhysics.Common.Decomposition.CDT.Delaunay.Sweep Head | ||
return |
protected AdvancingFrontNode,FarseerPhysics.Common.Decomposition.CDT.Delaunay.Sweep Search | ||
return |