Given The vertices and Edges of a simple polygon it forms a Doubly Connected Edge List data structures.
Then it forms a set of Y-Monotone Polygons by decomposing the Original Polygon.
Then we use the polygon Triangulation algorithm to triangulate each y-monotone polygon.
-
Notifications
You must be signed in to change notification settings - Fork 0
dragod812/Polygonal-Triangulation-using-DCEL-API
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Creation Of Triangulated Simple Polygon using the Doubly Connected Edge List Data Structure.
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published