Class AdvancingFront
- Assembly
- Alis.dll
The advancing front class
internal class AdvancingFront
Inheritance
Inherited Members
Constructors
AdvancingFront(AdvancingFrontNode, AdvancingFrontNode)
Initializes a new instance of the Alis.Core.Physic.Common.Decomposition.CDT.Delaunay.Sweep.AdvancingFront class
public AdvancingFront(AdvancingFrontNode head, AdvancingFrontNode tail)
Parameters
head
AdvancingFrontNode-
The head
tail
AdvancingFrontNode-
The tail
Fields
Head
The head
public AdvancingFrontNode Head
Field Value
Search
The search
protected AdvancingFrontNode Search
Field Value
Tail
The tail
public AdvancingFrontNode Tail
Field Value
Methods
AddNode(AdvancingFrontNode)
Adds the node using the specified node
public void AddNode(AdvancingFrontNode node)
Parameters
node
AdvancingFrontNode-
The node
FindSearchNode(double)
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
private AdvancingFrontNode FindSearchNode(double x)
Parameters
x
double
Returns
LocateNode(TriangulationPoint)
We use a balancing tree to locate a node smaller or equal to given key value
public AdvancingFrontNode LocateNode(TriangulationPoint point)
Parameters
point
TriangulationPoint
Returns
LocateNode(double)
Locates the node using the specified x
private AdvancingFrontNode LocateNode(double x)
Parameters
x
double-
The
Returns
- AdvancingFrontNode
-
The advancing front node
LocatePoint(TriangulationPoint)
This implementation will use simple node traversal algorithm to find a point on the front
public AdvancingFrontNode LocatePoint(TriangulationPoint point)
Parameters
point
TriangulationPoint
Returns
RemoveNode(AdvancingFrontNode)
Removes the node using the specified node
public void RemoveNode(AdvancingFrontNode node)
Parameters
node
AdvancingFrontNode-
The node
ToString()
Returns the string
public override string ToString()
Returns
- string
-
The string