dcel is a Python implementation of a doubly-connected edge list, a data structure that represents a planar graph in the plane, providing a simple way of extracting topological information such as vertices, edges and faces.
-
Notifications
You must be signed in to change notification settings - Fork 7
Python implementation of a doubly connected edge list
License
anglyan/dcel
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
Python implementation of a doubly connected edge list
Resources
License
Stars
Watchers
Forks
Packages 0
No packages published