VoronoiLib - GitLite

KO | EN

gitlite — search

#javascript #hacktoberfest #ai #llm #golang #android #machine-learning #linux #java #windows #cli #awesome-list #ios #mcp

VoronoiLib

(★ 92)

C# implementation of Fortunes Algorithm. Includes MonoGame example

파일 탐색기

최종 버전 다운로드 (.zip)

- - Content.mgcb
  - Courier New.spritefont
- - AssemblyInfo.cs
- Icon.ico
- packages.config
- Program.cs
- VoronoiDemo.cs
- VoronoiDemo.csproj
- - AssemblyInfo.cs
- - BeachLine.cs
  - FortuneCircleEvent.cs
  - FortuneEvent.cs
  - FortuneSite.cs
  - FortuneSiteEvent.cs
  - MinHeap.cs
  - RBTree.cs
  - VEdge.cs
  - VPoint.cs
- FortunesAlgorithm.cs
- ParabolaMath.cs
- VoronoiLib.csproj
- - AssemblyInfo.cs
- FortuneAlgorithmTest.cs
- MinHeapTest.cs
- ParabolaTest.cs
- RBTreeTest.cs
- VoronoiLibTests.csproj
- - AssemblyInfo.cs
- Program.cs
- VoronoiSpeedTest.csproj
.gitignore
Intersecting Parabolas.mw
License.md
README.md
VoronoiDemo.sln

// repository documentation

Was this content helpful?

★ 0 (0 ratings)

# VoronoiLib
C# implementation of Fortune's Algorithm. Includes MonoGame example.
Unlike several implemenations of Fortune's Algorithm, this implementation guarantees O(n ln(n)) performance by way of a specialized Red Black Tree (Credit: Raymond Hill).

# Dependencies
- The library (VoronoiLib) is compiled for .net standard 1.1.
- The demo (VoronoiDemo) is compiled for the MonoGame runtime
- The speed test (VoronoiSpeedTest) is compiled for .NET Core

As such, all three projects should be able to be built on Linux or OS X.
# Use
```
var points = new List<FortuneSite> {
  new FortuneSite(100, 200),
  new FortuneSite(500, 200),
  new FortuneSite(300, 300)
}
//FortunesAlgorithm.Run(points, min x, min y, max x, max y)
LinkedList<VEdge> = FortunesAlgorithm.Run(points, 0, 0, 800, 800);

//VEdge.Start is a VPoint with location VEdge.Start.X and VEdge.End.Y
//VEdge.End is the ending point for the edge
//FortuneSite.Neighbors contains the site's neighbors in the Delaunay Triangulation
```
#MonoGame Example:
##Voronoi Cells in Red. Delaunay Triangulation in Yellow
Controls:
- V: Show/ Hide Voronoi Diagram
- D: Show/ Hide Delaunay Triangulation
- W: Enable/ Disable Point Wiggle
- G: Generate a New Set of Points
- C: Clear the Screen
- Click: Insert a Point

![Voronoi](http://i.imgur.com/tr1XCib.png)

##Implementation inspired by:
- Ivan Kuckir's project (MIT) @ http://blog.ivank.net/fortunes-algorithm-and-implementation.html
- Raymond Hill's project (MIT) @ https://github.com/gorhill/Javascript-Voronoi

Feel free to use the code under MIT license. However, if you find the code useful, feel free to send me a message or make a link back to the repo.