Solver
public sealed class Solver
Methods
Solve_BruteForce
#Solve the voronoi diagram using a Sorted Brute force approach. Works best with a collection of nodes which are spread along the x-direction. This function will renumber and sort the nodes.
Parameters:
| nodes (Node2List) | Nodes to solve for. This list will be renumbered and sorted. |
| outline (IEnumerable<Node2>) | Initial boundary for every cell. |
Returns: The voronoi cells. Order of cells is identical to the order of nodes.
Solve_Connectivity
#public static List<Cell2> Solve_Connectivity(Node2List nodes, Connectivity diagram, IEnumerable<Node2> outline)
Solve the voronoi diagram using a minimal connectivity map.
Parameters:
| nodes (Node2List) | Nodes to solve for. |
| diagram (Connectivity) | Connectivity diagram. Can be obtained from a Delaunay mesh. |
| outline (IEnumerable<Node2>) | Initial boundary for every cell. |