This is a standard C# implementation of Fortune's algorithm for computing a voronoi diagram of a 2D point set. The result is visualized with OpenTK.

Most object-oriented methodologies use a notation set that depicts the class diagram as a graph of nodes representing classes and edges representing relationships between classes. An important ...

A C# implementation of the Bowyer–Watson algorithm. The result is a Delaunay triangulation for a set of randomly generated points. Following the Delaunay triangulation, the dual Voronoi diagram is ...

Influence diagrams have been widely applied to decision analysis and uncertain inference in many domains. Learning IDs aided by computer is an active research area. An ID structure learning algorithm ...