bool TryDeletePoint(Vertex v)
{
List<Edge> edges = new List<Edge>();
List<Vertex> verts = new List<Vertex>();
List<triangle> trsw = new List<triangle>();
Dictionary<Vertex, Vertex> parallelcopy = new Dictionary<Vertex, Vertex>();
foreach (var a in v.GetAdjacentTriangles)
{
foreach (var w in a.GetVertices)
{
if (w != v && !verts.Contains(w))
{
verts.Add(w);
}
}
List<Vertex> tempo = new List<Vertex>();
foreach (var w in a.GetVertices)
{
if (w != v)
{
tempo.Add(w);
}
}
Vertex p1=tempo[0],p2=tempo[1];
edges.Add(new Edge(p1,p2));
}
vertices.Remove(v);
Vertex v1 = verts[0],
v2 = edges.First(a => a.GetVertexes.Contains(v1)).GetVertexes.Single(b => b != v1),
v3 = edges.Single(a => (a.GetVertexes.Contains(v2)) && (!a.GetVertexes.Contains(v1))).GetVertexes.Single(b => b != v2);
int maxit = 0;
if (verts.Count == 4) maxit = 2;
if (verts.Count > 4) maxit = verts.Count;
while (verts.Count > 3)
{
triangle t1 = new triangle(v1, v2, v3,false);
bool y = true;
foreach (var v4 in vertices)
{
int c = Math.Sign(t1.SignVertex(v4));
if ((c != 0) && (c != t1.GetSignCenter))
{
y = false;
break;
}
}
if (y == true)
{
var g = new triangle(v1, v3, new Vertex(new double[] { 0, 0, 0 }), false);
if (Math.Sign(g.SignVertex(v2)) == Math.Sign(g.SignVertex(v)))
{
maxit--;
if (maxit == 0) { vertices.Add(v); return false; }
v1 = v2;
v2 = v3;
v3 = edges.Single(a => (a.GetVertexes.Contains(v2)) && (!a.GetVertexes.Contains(v1))).GetVertexes.Single(b => b != v2);
}
else
{
verts.Remove(v2);
if (verts.Count == 4) maxit = 2;
if (verts.Count > 4) maxit = verts.Count;
edges.RemoveAll(a => a.GetVertexes.Contains(v2));
edges.Add(new Edge(v1, v3));
trsw.Add(t1);
v2 = v3;
v3 = edges.Single(a => (a.GetVertexes.Contains(v2)) && (!a.GetVertexes.Contains(v1))).GetVertexes.Single(b => b != v2);
}
}
if (y == false)
{
maxit--;
if (maxit == 0) { vertices.Add(v); return false; }
v1 = v2;
v2 = v3;
v3 = edges.Single(a => (a.GetVertexes.Contains(v2)) && (!a.GetVertexes.Contains(v1))).GetVertexes.Single(b => b != v2);
}
}
var fgh = new triangle(verts[0], verts[1], verts[2],false);
trsw.Add(fgh);
maxit = v.GetAdjacentTriangles.Count;
for (int k = 0; k < maxit;k++ )
{
var o = v.GetAdjacentTriangles[0];
o.deltr();
triangles.Remove(o);
}
foreach (var o in trsw)
{
triangles.Add(new triangle(o.GetVertices[0], o.GetVertices[1], o.GetVertices[2]));
}
return true;
}
void NatNearestInterpolation(Vertex vert, bool ExceptNaN)
{
pseudopol.Clear();
pseuvotr.Clear();
pseuvovert.Clear();
newtriangles.Clear();
if (addnewpoint(vert, false) == -1) return;
List<Vertex> lv = new List<Vertex>();
foreach (var e1 in pseuvotr)
foreach (var e2 in e1.GetVertices)
{
if (!lv.Contains(e2)) lv.Add(e2);
}
lv.Add(vert);
foreach (var q in lv)
{
List<Vertex> temp = new List<Vertex>();
triangle t = q.GetAdjacentTriangles[0];
Vertex y = t.GetVertices.First(a => a != q);
Vertex y0;
for (int i = 0; i < q.GetAdjacentTriangles.Count; i++)
{
temp.Add(t.GetOR);
y0 = y;
y = t.GetVertices.Single(a => (a != y) && (a != q));
t = q.GetAdjacentTriangles.Single(a => a.GetVertices.Contains(y) && (!a.GetVertices.Contains(y0)));
}
VoronoiCell p = new VoronoiCell(q, temp);
pseudopol.Add(p);
}
lv.Remove(vert);
double sq = 0;
//double sq = pseudopol.Single(a => a.GetCellCentr == vert).GetSquare;
foreach (var q in lv)
{
if ((!ExceptNaN) || (ExceptNaN && !double.IsNaN(q.Value)))
{
double sqss = q.Voronoi_Cell.GetSquare;
double sqs = pseudopol.Single(a => a.GetCellCentr == q).GetSquare;
double delta = sqss - sqs;
vert.Value += delta * q.Value;
sq += delta;
}
}
vert.Value /= sq;
foreach (var n in newtriangles)
{
n.deltr();
triangles.Remove(n);
}
foreach (var n in pseuvotr)
{
var tem = new triangle(n.GetVertices[0], n.GetVertices[1], n.GetVertices[2]);
triangles.Add(tem);
}
vertices.Remove(vert);
}
void anymore(HashSet<triangle> m, triangle l, Vertex x)
{
foreach (var w in l.GetVertices)
{
foreach (var e in w.GetAdjacentTriangles)
{
if (Math.Sign(e.SignVertex(x)) != e.GetSignCenter)
{
if (!m.Contains(e))
{
m.Add(e);
anymore(m, e, x);
}
}
}
}
}
void DeletePoint(Vertex v)
{
List<Edge> edges = new List<Edge>();
List<Vertex> verts = new List<Vertex>();
List<triangle> triangls = new List<triangle>();
vertices.Remove(v);
foreach (var a in v.GetAdjacentTriangles)
{
triangls.Add(a);
a.GetVertices.Remove(v);
foreach (var q0 in a.GetVertices) q0.GetAdjacentTriangles.Remove(a);
edges.Add(new Edge(a.GetVertices[0], a.GetVertices[1]));
foreach (var l in a.GetVertices) if (!verts.Contains(l)) verts.Add(l);
}
v.GetAdjacentTriangles.Clear();
pseuvovert = new List<Vertex>(verts);
foreach (var r in triangls)
triangles.Remove(r);
triangls.Clear();
Vertex v1 = verts[0],
v2 = edges.First(a => a.GetVertexes.Contains(v1)).GetVertexes.Single(b => b != v1),
v3 = edges.Single(a => (a.GetVertexes.Contains(v2)) && (!a.GetVertexes.Contains(v1))).GetVertexes.Single(b => b != v2);
while (verts.Count > 3)
{
triangle t1 = new triangle(v1, v2, v3, true);
bool y = true;
foreach (var v4 in vertices)
{
int c = Math.Sign(t1.SignVertex(v4));
if ((c != 0) && (c != t1.GetSignCenter))
{
y = false;
break;
}
}
if (y == true)
{
var g = new triangle(v1, v3, new Vertex(new double[] { 0, 0, 0 }), false);
if (Math.Sign(g.SignVertex(v2)) == Math.Sign(g.SignVertex(v)))
{
t1.deltr();
v1 = v2;
v2 = v3;
v3 = edges.Single(a => (a.GetVertexes.Contains(v2)) && (!a.GetVertexes.Contains(v1))).GetVertexes.Single(b => b != v2);
}
else
{
verts.Remove(v2);
edges.RemoveAll(a => a.GetVertexes.Contains(v2));
edges.Add(new Edge(v1, v3));
triangles.Add(t1);
v2 = v3;
v3 = edges.Single(a => (a.GetVertexes.Contains(v2)) && (!a.GetVertexes.Contains(v1))).GetVertexes.Single(b => b != v2);
}
}
if (y == false)
{
t1.deltr();
v1 = v2;
v2 = v3;
v3 = edges.Single(a => (a.GetVertexes.Contains(v2)) && (!a.GetVertexes.Contains(v1))).GetVertexes.Single(b => b != v2);
}
}
var fgh = new triangle(verts[0], verts[1], verts[2]);
triangles.Add(fgh);
}
int addnewpoint(Vertex x, bool p = true)
{
foreach (var w in vinit.Where(a => Math.Abs(x.X - a.X) < 0.0000001 && Math.Abs(x.Y - a.Y) < 0.0000001 && Math.Abs(x.Z - a.Z) < 0.0000001))
{
w.SetNewPosition(x.Longitude, x.Latitude);
w.Value = x.Value;
vinit.Remove(w);
return 0;
}
if (vertices.Count > 0)
{
var tm = vertices.ElementAt(0);
double dis = (tm.X - x.X) * (tm.X - x.X) + (tm.Y - x.Y) * (tm.Y - x.Y) + (tm.Z - x.Z) * (tm.Z - x.Z), dis0 = 0;
Vertex ind0 = tm;
do
{
tm = ind0;
foreach (var er in tm.GetAdjacentTriangles)
{
foreach (var t in er.GetVertices)
{
dis0 = (t.X - x.X) * (t.X - x.X) + (t.Y - x.Y) * (t.Y - x.Y) + (t.Z - x.Z) * (t.Z - x.Z);
if (dis0 < dis)
{
dis = dis0;
ind0 = t;
}
}
}
} while (tm != ind0);
if (dis < 0.00000001)
{
if (p == false)
{
x.Value = ind0.Value;
}
else { Console.WriteLine("Warning: SingularPoint"); }
return -1;
}
}
triangle z = null;
triangle l = triangles.ElementAt(0);
if (Math.Sign(l.SignVertex(x)) == l.GetSignCenter)
{
l.TempIndex = x;
double e0 = (l.GetVertices[0].X - x.X) * (l.GetVertices[0].X - x.X) + (l.GetVertices[0].Y - x.Y) * (l.GetVertices[0].Y - x.Y) + (l.GetVertices[0].Z - x.Z) * (l.GetVertices[0].Z - x.Z);
double e1 = (l.GetVertices[1].X - x.X) * (l.GetVertices[1].X - x.X) + (l.GetVertices[1].Y - x.Y) * (l.GetVertices[1].Y - x.Y) + (l.GetVertices[1].Z - x.Z) * (l.GetVertices[1].Z - x.Z);
double e2 = (l.GetVertices[2].X - x.X) * (l.GetVertices[2].X - x.X) + (l.GetVertices[2].Y - x.Y) * (l.GetVertices[2].Y - x.Y) + (l.GetVertices[2].Z - x.Z) * (l.GetVertices[2].Z - x.Z);
int u = 0;
if ((e0 >= e1) && (e2 >= e1))
{
u = 1;
}
if ((e0 >= e2) && (e1 >= e2))
{
u = 2;
}
while (true)
{
z = null;
foreach (var et in l.GetVertices[u].GetAdjacentTriangles)
{
if ((et.TempIndex != x) && (Math.Sign(et.SignVertex(x)) != et.GetSignCenter))
{
z = et;
break;
}
}
if (z != null) break;
triangle t0 = null;
int u0 = 0;
double e = 5;
foreach (var et in l.GetVertices[u].GetAdjacentTriangles)
{
if (et.TempIndex != x)
{
et.TempIndex = x;
e0 = (et.GetVertices[0].X - x.X) * (et.GetVertices[0].X - x.X) + (et.GetVertices[0].Y - x.Y) * (et.GetVertices[0].Y - x.Y) + (et.GetVertices[0].Z - x.Z) * (et.GetVertices[0].Z - x.Z);
e1 = (et.GetVertices[1].X - x.X) * (et.GetVertices[1].X - x.X) + (et.GetVertices[1].Y - x.Y) * (et.GetVertices[1].Y - x.Y) + (et.GetVertices[1].Z - x.Z) * (et.GetVertices[1].Z - x.Z);
e2 = (et.GetVertices[2].X - x.X) * (et.GetVertices[2].X - x.X) + (et.GetVertices[2].Y - x.Y) * (et.GetVertices[2].Y - x.Y) + (et.GetVertices[2].Z - x.Z) * (et.GetVertices[2].Z - x.Z);
if ((e >= e0) && (e1 >= e0) && (e2 >= e0))
{
e = e0;
t0 = et;
u0 = 0;
}
if ((e >= e1) && (e2 >= e1) && (e0 >= e1))
{
e = e1;
t0 = et;
u0 = 1;
}
if ((e >= e2) && (e0 >= e2) && (e1 >= e2))
{
e = e2;
t0 = et;
u0 = 2;
}
}
}
l = t0;
u = u0;
}
l = z;
}
HashSet<triangle> m = new HashSet<triangle>();
anymore(m, l, x);
if (p == false)
{
foreach (var d in m)
pseuvotr.Add(new triangle(d.GetVertices[0], d.GetVertices[1], d.GetVertices[2], false));
}
List<Edge> b = new List<Edge>();
foreach (var t in m)
{
if (b.RemoveAll(a => a.GetVertexes.Contains(t.GetVertices[0]) && a.GetVertexes.Contains(t.GetVertices[1])) == 0)
{
b.Add(new Edge(t.GetVertices[0], t.GetVertices[1]));
}
if (b.RemoveAll(a => a.GetVertexes.Contains(t.GetVertices[2]) && a.GetVertexes.Contains(t.GetVertices[1])) == 0)
{
b.Add(new Edge(t.GetVertices[2], t.GetVertices[1]));
}
if (b.RemoveAll(a => a.GetVertexes.Contains(t.GetVertices[2]) && a.GetVertexes.Contains(t.GetVertices[0])) == 0)
{
b.Add(new Edge(t.GetVertices[2], t.GetVertices[0]));
}
t.deltr();
triangles.Remove(t);
}
foreach (var q in b)
{
var tem = new triangle(x, q.GetVertexes[0], q.GetVertexes[1]);
if (p == false) newtriangles.Add(tem);
triangles.Add(tem);
}
vertices.Add(x);
return 1;
}
