A C# implementations for several algorithms to solve some classical problems in Computational Geometry (like Convex Hull, Segment Intersections and Polygon Triangulation).
forked from TarekVito/Computational-Geometry
A C# implementations for solving many classical problems in Computational Geometry (like Convex Hull, Segment Intersections and Polygon Triangulation)
License
PlastecProfiles/Computational-Geometry
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
A C# implementations for solving many classical problems in Computational Geometry (like Convex Hull, Segment Intersections and Polygon Triangulation)
Resources
License
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published
Languages
- C# 100.0%