https://github.com/ammanvedi/planar-face-discovery
Given a planar, undirected, graph enumerate all of the faces of the graph. Can also be described as finding all of the polygons within the graph, or the minimum cycle basis, based on Geometric Tools C++ Library
https://github.com/ammanvedi/planar-face-discovery
faces graph minimum-cycle-basis planar planar-graphs polygons undirected-graphs
Last synced: 3 months ago
JSON representation
Given a planar, undirected, graph enumerate all of the faces of the graph. Can also be described as finding all of the polygons within the graph, or the minimum cycle basis, based on Geometric Tools C++ Library
- Host: GitHub
- URL: https://github.com/ammanvedi/planar-face-discovery
- Owner: ammanvedi
- Created: 2021-10-07T21:05:48.000Z (over 4 years ago)
- Default Branch: master
- Last Pushed: 2021-11-14T12:44:24.000Z (over 4 years ago)
- Last Synced: 2024-04-14T20:00:27.751Z (about 2 years ago)
- Topics: faces, graph, minimum-cycle-basis, planar, planar-graphs, polygons, undirected-graphs
- Language: TypeScript
- Homepage:
- Size: 1.03 MB
- Stars: 10
- Watchers: 3
- Forks: 5
- Open Issues: 0