Doubly Connected Edge List (DCEL) is a Half-Edge Data Structure used to Represent Planar Graphs & Polyhedra in Computational Geometry
-
Notifications
You must be signed in to change notification settings - Fork 0
WillKirkmanM/doubly-connected-edge-list
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Doubly Connected Edge List (DCEL) is a Half-Edge Data Structure used to Represent Planar Graphs & Polyhedra in Computational Geometry
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published