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
- Updated
Nov 14, 2021 - TypeScript
#
minimum-cycle-basis
Here is 1 public repository matching this topic...
Improve this page
Add a description, image, and links to the minimum-cycle-basis topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the minimum-cycle-basis topic, visit your repo's landing page and select "manage topics."