- Implementation of the Triangulation of an n-sided polygon in O(n^2) and O(nlogn) time and visualisation using graphics.h (use -lgraph as a compiler flag).
- O(n^2) method for simple polygons: finding all ears, forming diagonals and pruning the ear-list recursively.
- O(nlogn) method for monotone polygons: splitting into monotone chains and adding diagonals using stack.
-
Notifications
You must be signed in to change notification settings - Fork 0
License
jai2706/Polygon-Triangulator
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
No description, website, or topics provided.
Resources
License
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published