private void FastRec_Click(object sender, EventArgs e)
{
for (int i = 0; i < Array_of_vertexes.Count(); ++i)
{
Array_of_vertexes[i].Highlighted = false;
}
DrawEvents.Clear();
DrawEvents.Add(new Painting(Array_of_vertexes, new List <Edge>()));
AlgorithmsVisualiser.FastRecursive(Array_of_vertexes, DrawEvents);
}
private void Fortune_Click(object sender, EventArgs e)
{
for (int i = 0; i < Array_of_vertexes.Count(); ++i)
{
Array_of_vertexes[i].Highlighted = false;
}
DrawEvents.Clear();
DrawEvents.Add(new Painting(Array_of_vertexes, new List <Edge>()));
List <Vector> Points = new List <Vector>(AlgorithmsVisualiser.Pack_into_ListOfVector(Array_of_vertexes));
VoronoiGraph graph = new VoronoiGraph();
graph = AlgorithmsVisualiser.FortuneAlgo(Points);
List <VoronoiEdge> VE = graph.Edges.ToList <VoronoiEdge>();
DrawEvents.Add(new Painting(Array_of_vertexes, new List <Edge>(), VE));
}
private void Delaunay_Click(object sender, EventArgs e)
{
for (int i = 0; i < Array_of_vertexes.Count(); ++i)
{
Array_of_vertexes[i].Highlighted = false;
}
DrawEvents.Clear();
DrawEvents.Add(new Painting(Array_of_vertexes, new List <Edge>()));
List <Vector> Points = new List <Vector>(AlgorithmsVisualiser.Pack_into_ListOfVector(Array_of_vertexes));
VoronoiGraph graph = new VoronoiGraph();
graph = AlgorithmsVisualiser.FortuneAlgo(Points);
List <VoronoiEdge> VE = graph.Edges.ToList <VoronoiEdge>();
List <Edge> tri = AlgorithmsVisualiser.Delaunay(Array_of_vertexes, graph, DrawEvents);
foreach (Edge edge in tri)
{
edge.color = Color.Red;
}
GL.LineWidth(1);
DrawEvents.Add(new Painting(Array_of_vertexes, tri, VE));
}
