/// <summary>
/// Will return the new root (unchanged except in start-up)
/// </summary>
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[0]);
//2. Create the subtree (ONE Edge, but two VEdgeNodes)
var 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[1] - ve.RightData[1]) < 1e-10)
{
if (ve.LeftData[0] < ve.RightData[0])
{
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, double ys, out VDataNode[] circleCheckList)
{
VEdgeNode eo;
var b = e.NodeN;
var a = LeftDataNode(b);
var c = RightDataNode(b);
if (a == null || b.Parent == null || c == null || a.DataPoint != e.NodeL.DataPoint || c.DataPoint != e.NodeR.DataPoint)
{
circleCheckList = new VDataNode[] { };
return(root); // Abbruch da sich der Graph verändert hat
}
var eu = (VEdgeNode)b.Parent;
circleCheckList = new[] { a, c };
//1. Create the new Vertex
var vNew = new Vector(e.Center[0], e.Center[1]);
// 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.Vertizes.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;
// /////////////////////
//complete & cleanup eo
eo.Edge.AddVertex(vNew);
//while(eo.Edge.VVertexB == Fortune.VVUnkown)
//{
// eo.Flipped = !eo.Flipped;
// eo.Edge.AddVertex(Fortune.VVInfinite);
//}
//if(eo.Flipped)
//{
// Vector T = eo.Edge.LeftData;
// eo.Edge.LeftData = eo.Edge.RightData;
// eo.Edge.RightData = T;
//}
//2. Replace eo by new Edge
var ve = new VoronoiEdge {
LeftData = a.DataPoint,
RightData = c.DataPoint
};
ve.AddVertex(vNew);
vg.Edges.Add(ve);
var 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>
/// Will return the new root (unchanged except in start-up)
/// </summary>
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[] {(VDataNode)Root};
return Root;
}
//1. Find the node to be replaced
VNode C = VNode.FindDataNode(Root, ys, e.DataPoint.X);
//2. Create the subtree (ONE Edge, but two VEdgeNodes)
VoronoiEdge VE = new VoronoiEdge();
VE.LeftData = ((VDataNode)C).DataPoint;
VE.RightData = e.DataPoint;
VE.VVertexA = Fortune.VVUnkown;
VE.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);
SubRoot.Left = new VDataNode(VE.LeftData);
SubRoot.Right = new VDataNode(VE.RightData);
}
else
{
SubRoot = new VEdgeNode(VE,true);
SubRoot.Left = new VDataNode(VE.RightData);
SubRoot.Right = new VDataNode(VE.LeftData);
}
CircleCheckList = new VDataNode[] {(VDataNode)SubRoot.Left,(VDataNode)SubRoot.Right};
}
else
{
SubRoot = new VEdgeNode(VE,false);
SubRoot.Left = new VDataNode(VE.LeftData);
SubRoot.Right = new VEdgeNode(VE,true);
SubRoot.Right.Left = new VDataNode(VE.RightData);
SubRoot.Right.Right = new VDataNode(VE.LeftData);
CircleCheckList = new VDataNode[] {(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 VDataNode RightDataNode(VDataNode Current)
{
VNode C = Current;
//1. Up
do
{
if(C.Parent==null)
return null;
if(C.Parent.Right == C)
{
C = C.Parent;
continue;
}
else
{
C = C.Parent;
break;
}
}while(true);
//2. One Right
C = C.Right;
//3. Down
while(C.Left!=null)
C = C.Left;
return (VDataNode)C; // Cast statt 'as' damit eine Exception kommt
}
public static VEdgeNode EdgeToRightDataNode(VDataNode Current)
{
VNode C = Current;
//1. Up
do
{
if(C.Parent==null)
throw new Exception("No Left Leaf found!");
if(C.Parent.Right == C)
{
C = C.Parent;
continue;
}
else
{
C = C.Parent;
break;
}
}while(true);
return (VEdgeNode)C;
}
public static VNode ProcessCircleEvent(VCircleEvent e, VNode Root, VoronoiGraph VG, double ys, out VDataNode[] CircleCheckList)
{
VDataNode a,b,c;
VEdgeNode eu,eo;
b = e.NodeN;
a = VNode.LeftDataNode(b);
c = VNode.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
}
eu = (VEdgeNode)b.Parent;
CircleCheckList = new VDataNode[] {a,c};
//1. Create the new Vertex
Point VNew = new Point(e.Center.X,e.Center.Y);
// VNew.X = Fortune.ParabolicCut(a.DataPoint.X,a.DataPoint.Y,c.DataPoint.X,c.DataPoint.Y,ys);
// VNew.Y = (ys + a.DataPoint.Y)/2 - 1/(2*(ys-a.DataPoint.Y))*(VNew.X-a.DataPoint.X)*(VNew.X-a.DataPoint.X);
VG.Vertizes.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 = VNode.EdgeToRightDataNode(a);
// replace eu by eu's Right
eu.Parent.Replace(eu,eu.Right);
}
else // a is sibling
{
eo = VNode.EdgeToRightDataNode(b);
// replace eu by eu's Left
eu.Parent.Replace(eu,eu.Left);
}
eu.Edge.AddVertex(VNew);
// ///////////////////// uncertain
// if(eo==eu)
// return Root;
// /////////////////////
//complete & cleanup eo
eo.Edge.AddVertex(VNew);
//while(eo.Edge.VVertexB == Fortune.VVUnkown)
//{
// eo.Flipped = !eo.Flipped;
// eo.Edge.AddVertex(Fortune.VVInfinite);
//}
//if(eo.Flipped)
//{
// Vector T = eo.Edge.LeftData;
// eo.Edge.LeftData = eo.Edge.RightData;
// eo.Edge.RightData = T;
//}
//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;
}
public static VCircleEvent CircleCheckDataNode(VDataNode n, double ys)
{
var l = LeftDataNode(n);
var r = RightDataNode(n);
if (l == null || r == null || l.DataPoint == r.DataPoint || l.DataPoint == n.DataPoint || n.DataPoint == r.DataPoint)
return null;
if (MathTools.ccw(l.DataPoint, n.DataPoint, r.DataPoint, false) <= 0)
return null;
var center = Fortune.CircumCircleCenter(l.DataPoint, n.DataPoint, r.DataPoint);
var vc = new VCircleEvent
{
NodeN = n,
NodeL = l,
NodeR = r,
Center = center,
Valid = true
};
if (vc.Y > ys || Math.Abs(vc.Y - ys) < 1e-10)
return vc;
return null;
}
public static VCircleEvent CircleCheckDataNode(VDataNode n, double ys)
{
VDataNode l = VNode.LeftDataNode(n);
VDataNode r = VNode.RightDataNode(n);
if(l==null || r==null || l.DataPoint==r.DataPoint || l.DataPoint==n.DataPoint || n.DataPoint==r.DataPoint)
return null;
if(MathF.ccw(l.DataPoint.X,l.DataPoint.Y,n.DataPoint.X,n.DataPoint.Y,r.DataPoint.X,r.DataPoint.Y,false)<=0)
return null;
Point Center = Fortune.CircumCircleCenter(l.DataPoint,n.DataPoint,r.DataPoint);
VCircleEvent VC = new VCircleEvent();
VC.NodeN = n;
VC.NodeL = l;
VC.NodeR = r;
VC.Center = Center;
VC.Valid = true;
if(VC.Y>ys || Math.Abs(VC.Y - ys) < 1e-10)
return VC;
return null;
}
public static VDataNode RightDataNode(VDataNode current)
{
VNode c = current;
//1. Up
do
{
if (c.Parent == null)
return null;
if (c.Parent.Right == c)
{
c = c.Parent;
}
else
{
c = c.Parent;
break;
}
} while (true);
//2. One Right
c = c.Right;
//3. Down
while (c.Left != null)
c = c.Left;
return (VDataNode)c; // Cast statt 'as' damit eine Exception kommt
}
/// <summary>
/// Will return the new root (unchanged except in start-up)
/// </summary>
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[] { (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)
var ve = new Edge
{
LeftData = ((VDataNode)c).DataPoint,
RightData = e.DataPoint,
VVertexA = null,
VVertexB = null
};
vg.MutableEdges.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[] { (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[] { (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;
var b = e.NodeN;
var a = LeftDataNode(b);
var 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
}
var eu = (VEdgeNode)b.Parent;
circleCheckList = new VDataNode[] { a, c };
//1. Create the new Vertex
var vNew = new Vector2(e.Center.X, e.Center.Y);
// VNew.X = Fortune.ParabolicCut(a.DataPoint.X,a.DataPoint.Y,c.DataPoint.X,c.DataPoint.Y,ys);
// VNew.Y = (ys + a.DataPoint.Y)/2 - 1/(2*(ys-a.DataPoint.Y))*(VNew.X-a.DataPoint.X)*(VNew.X-a.DataPoint.X);
vg.MutableVertices.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;
// /////////////////////
//complete & cleanup eo
eo.Edge.AddVertex(vNew);
//while(eo.Edge.VVertexB == Fortune.VVUnkown)
//{
// eo.flipped = !eo.flipped;
// eo.Edge.AddVertex(Fortune.VVInfinite);
//}
//if(eo.flipped)
//{
// Vector T = eo.Edge.LeftData;
// eo.Edge.LeftData = eo.Edge.RightData;
// eo.Edge.RightData = T;
//}
//2. Replace eo by new Edge
var ve = new Edge
{
LeftData = a.DataPoint,
RightData = c.DataPoint
};
ve.AddVertex(vNew);
vg.MutableEdges.Add(ve);
var ven = new VEdgeNode(ve, false)
{
Left = eo.Left,
Right = eo.Right
};
if (eo.Parent == null)
return ven;
eo.Parent.Replace(eo, ven);
return root;
}
public static VEdgeNode EdgeToRightDataNode(VDataNode current)
{
VNode c = current;
//1. Up
do
{
if (c.Parent == null)
throw new Exception("No Left Leaf found!");
if (c.Parent.Right == c)
{
c = c.Parent;
}
else
{
c = c.Parent;
break;
}
} while (true);
return (VEdgeNode)c;
}
public static VNode ProcessCircleEvent(VCircleEvent e, VNode Root, VoronoiGraph VG, double ys, out VDataNode[] CircleCheckList)
{
VDataNode a, b, c;
VEdgeNode eu, eo;
b = e.NodeN;
a = VNode.LeftDataNode(b);
c = VNode.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
}
eu = (VEdgeNode)b.Parent;
CircleCheckList = new VDataNode[] { a, c };
//1. Create the new Vertex
Point VNew = new Point(e.Center.X, e.Center.Y);
// VNew.X = Fortune.ParabolicCut(a.DataPoint.X,a.DataPoint.Y,c.DataPoint.X,c.DataPoint.Y,ys);
// VNew.Y = (ys + a.DataPoint.Y)/2 - 1/(2*(ys-a.DataPoint.Y))*(VNew.X-a.DataPoint.X)*(VNew.X-a.DataPoint.X);
VG.Vertizes.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 = VNode.EdgeToRightDataNode(a);
// replace eu by eu's Right
eu.Parent.Replace(eu, eu.Right);
}
else // a is sibling
{
eo = VNode.EdgeToRightDataNode(b);
// replace eu by eu's Left
eu.Parent.Replace(eu, eu.Left);
}
eu.Edge.AddVertex(VNew);
// ///////////////////// uncertain
// if(eo==eu)
// return Root;
// /////////////////////
//complete & cleanup eo
eo.Edge.AddVertex(VNew);
//while(eo.Edge.VVertexB == Fortune.VVUnkown)
//{
// eo.Flipped = !eo.Flipped;
// eo.Edge.AddVertex(Fortune.VVInfinite);
//}
//if(eo.Flipped)
//{
// Vector T = eo.Edge.LeftData;
// eo.Edge.LeftData = eo.Edge.RightData;
// eo.Edge.RightData = T;
//}
//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);
}