/// <summary>
/// Cleans the tree.
/// </summary>
/// <param name="root">The root node.</param>
public static void CleanUpTree(VNode root)
{
if (root is VDataNode)
{
return;
}
VEdgeNode ve = root as VEdgeNode;
if (ve != null)
{
while (ve.Edge.VVertexB == Fortune.VVUnkown)
{
ve.Edge.AddVertex(Fortune.VVInfinite);
}
if (ve.Flipped)
{
Vector2 t = ve.Edge.LeftData;
ve.Edge.LeftData = ve.Edge.RightData;
ve.Edge.RightData = t;
}
ve.Edge.Done = true;
}
CleanUpTree(root.Left);
CleanUpTree(root.Right);
}
/// <summary>
/// Will return the new root (unchanged except in start-up).
/// </summary>
/// <param name="e">The VDataEvent.</param>
/// <param name="root">The root node.</param>
/// <param name="vg">The VoronoiGraph.</param>
/// <param name="ys">The ys.</param>
/// <param name="circleCheckList">The circle check list.</param>
/// <returns>The new root.</returns>
public static VNode ProcessDataEvent(VDataEvent e, VNode root, VoronoiGraph vg, double ys, out VDataNode[] circleCheckList)
{
if (root == null)
{
root = new VDataNode(e.DataPoint);
circleCheckList = new[] { (VDataNode)root };
return(root);
}
// 1. Find the node to be replaced
VNode c = FindDataNode(root, ys, e.DataPoint.X);
// 2. Create the subtree (ONE Edge, but two VEdgeNodes)
VoronoiEdge ve = new VoronoiEdge {
LeftData = ((VDataNode)c).DataPoint, RightData = e.DataPoint, VVertexA = Fortune.VVUnkown, VVertexB = Fortune.VVUnkown
};
vg.Edges.Add(ve);
VNode subRoot;
if (Math.Abs(ve.LeftData.Y - ve.RightData.Y) < 1e-10)
{
if (ve.LeftData.X < ve.RightData.X)
{
subRoot = new VEdgeNode(ve, false)
{
Left = new VDataNode(ve.LeftData), Right = new VDataNode(ve.RightData)
};
}
else
{
subRoot = new VEdgeNode(ve, true)
{
Left = new VDataNode(ve.RightData), Right = new VDataNode(ve.LeftData)
};
}
circleCheckList = new[] { (VDataNode)subRoot.Left, (VDataNode)subRoot.Right };
}
else
{
subRoot = new VEdgeNode(ve, false)
{
Left = new VDataNode(ve.LeftData), Right = new VEdgeNode(ve, true)
{
Left = new VDataNode(ve.RightData), Right = new VDataNode(ve.LeftData)
}
};
circleCheckList = new[] { (VDataNode)subRoot.Left, (VDataNode)subRoot.Right.Left, (VDataNode)subRoot.Right.Right };
}
// 3. Apply subtree
if (c.Parent == null)
{
return(subRoot);
}
c.Parent.Replace(c, subRoot);
return(root);
}
public static VNode ProcessCircleEvent(VCircleEvent e, VNode root, VoronoiGraph vg, out VDataNode[] circleCheckList)
{
VEdgeNode eo;
VDataNode b = e.NodeN;
VDataNode a = LeftDataNode(b);
VDataNode c = RightDataNode(b);
if (a == null || b.Parent == null || c == null || !a.DataPoint.Equals(e.NodeL.DataPoint) || !c.DataPoint.Equals(e.NodeR.DataPoint))
{
circleCheckList = new VDataNode[] { };
return(root); // Abbruch da sich der Graph verändert hat
}
VEdgeNode eu = (VEdgeNode)b.Parent;
circleCheckList = new[] { a, c };
//1. Create the new Vertex
Vector2 vNew = new Vector2(e.Center.X, e.Center.Y);
// VNew[0] = Fortune.ParabolicCut(a.DataPoint[0], a.DataPoint[1], c.DataPoint[0], c.DataPoint[1], ys);
// VNew[1] = (ys + a.DataPoint[1])/2 - 1/(2*(ys-a.DataPoint[1]))*(VNew[0]-a.DataPoint[0])*(VNew[0]-a.DataPoint[0]);
vg.Vertices.Add(vNew);
//2. Find out if a or c are in a distand part of the tree (the other is then b's sibling) and assign the new vertex
if (eu.Left == b)
{
// c is sibling
eo = EdgeToRightDataNode(a);
// replace eu by eu's Right
eu.Parent.Replace(eu, eu.Right);
}
else
{
// a is sibling
eo = EdgeToRightDataNode(b);
// replace eu by eu's Left
eu.Parent.Replace(eu, eu.Left);
}
eu.Edge.AddVertex(vNew);
// ///////////////////// uncertain
// if (eo==eu)
// return root;
// /////////////////////
eo.Edge.AddVertex(vNew);
//2. Replace eo by new Edge
VoronoiEdge ve = new VoronoiEdge();
ve.LeftData = a.DataPoint;
ve.RightData = c.DataPoint;
ve.AddVertex(vNew);
vg.Edges.Add(ve);
VEdgeNode ven = new VEdgeNode(ve, false);
ven.Left = eo.Left;
ven.Right = eo.Right;
if (eo.Parent == null)
{
return(ven);
}
eo.Parent.Replace(eo, ven);
return(root);
}
/// <summary>
/// Processes the VCircleEvent.
/// </summary>
/// <param name="e">The VCircleEvent.</param>
/// <param name="root">The root node.</param>
/// <param name="vg">The VoronoiGraph.</param>
/// <param name="circleCheckList">The circle check list.</param>
/// <returns>The resulting root.</returns>
public static VNode ProcessCircleEvent(VCircleEvent e, VNode root, VoronoiGraph vg, out VDataNode[] circleCheckList)
{
VEdgeNode eo;
VDataNode b = e.NodeN;
VDataNode a = LeftDataNode(b);
VDataNode c = RightDataNode(b);
if (a == null || b.Parent == null || c == null || !a.DataPoint.Equals(e.NodeL.DataPoint) || !c.DataPoint.Equals(e.NodeR.DataPoint))
{
circleCheckList = new VDataNode[] { };
return(root); // abbort because graph changed
}
VEdgeNode eu = (VEdgeNode)b.Parent;
circleCheckList = new[] { a, c };
// 1. Create the new Vertex
Vector2 vNew = new Vector2(e.Center.X, e.Center.Y);
vg.Vertices.Add(vNew);
// 2. Find out if a or c are in a distand part of the tree (the other is then b's sibling) and assign the new vertex
if (eu.Left == b)
{
// c is sibling
eo = EdgeToRightDataNode(a);
// replace eu by eu's Right
eu.Parent.Replace(eu, eu.Right);
}
else
{
// a is sibling
eo = EdgeToRightDataNode(b);
// replace eu by eu's Left
eu.Parent.Replace(eu, eu.Left);
}
eu.Edge.AddVertex(vNew);
eo.Edge.AddVertex(vNew);
// 2. Replace eo by new Edge
VoronoiEdge ve = new VoronoiEdge {
LeftData = a.DataPoint, RightData = c.DataPoint
};
ve.AddVertex(vNew);
vg.Edges.Add(ve);
VEdgeNode ven = new VEdgeNode(ve, false)
{
Left = eo.Left, Right = eo.Right
};
if (eo.Parent == null)
{
return(ven);
}
eo.Parent.Replace(eo, ven);
return(root);
}
/// <summary>
/// Processes the VCircleEvent.
/// </summary>
/// <param name="e">The VCircleEvent.</param>
/// <param name="root">The root node.</param>
/// <param name="vg">The VoronoiGraph.</param>
/// <param name="circleCheckList">The circle check list.</param>
/// <returns>The resulting root.</returns>
public static VNode ProcessCircleEvent(VCircleEvent e, VNode root, VoronoiGraph vg, out VDataNode[] circleCheckList)
{
VEdgeNode eo;
VDataNode b = e.NodeN;
VDataNode a = LeftDataNode(b);
VDataNode c = RightDataNode(b);
if (a == null || b.Parent == null || c == null || !a.DataPoint.Equals(e.NodeL.DataPoint) || !c.DataPoint.Equals(e.NodeR.DataPoint))
{
circleCheckList = new VDataNode[] { };
return(root); // abbort because graph changed
}
VEdgeNode eu = (VEdgeNode)b.Parent;
circleCheckList = new[] { a, c };
// 1. Create the new Vertex
Vector2 vNew = new(e.Center.X, e.Center.Y);
vg.Vertices.Add(vNew);
// 2. Find out if a or c are in a distand part of the tree (the other is then b's sibling) and assign the new vertex
if (eu.Left == b)
{
// c is sibling
eo = EdgeToRightDataNode(a);
// replace eu by eu's Right
eu.Parent.Replace(eu, eu.Right);
}
else
{
// a is sibling
eo = EdgeToRightDataNode(b);
// replace eu by eu's Left
eu.Parent.Replace(eu, eu.Left);
}
eu.Edge.AddVertex(vNew);
eo.Edge.AddVertex(vNew);
// 2. Replace eo by new Edge
VoronoiEdge ve = new() { LeftData = a.DataPoint, RightData = c.DataPoint };
ve.AddVertex(vNew);
vg.Edges.Add(ve);
VEdgeNode ven = new(ve, false) { Left = eo.Left, Right = eo.Right };
if (eo.Parent == null)
{
return(ven);
}
eo.Parent.Replace(eo, ven);
return(root);
}
/// <summary>
/// Will return the new root (unchanged except in start-up).
/// </summary>
/// <param name="e">The VDataEvent.</param>
/// <param name="root">The root node.</param>
/// <param name="vg">The VoronoiGraph.</param>
/// <param name="ys">The ys.</param>
/// <param name="circleCheckList">The circle check list.</param>
/// <returns>The new root.</returns>
public static VNode ProcessDataEvent(VDataEvent e, VNode root, VoronoiGraph vg, double ys, out VDataNode[] circleCheckList)