ammanvedi / planar-face-discoveryLinks

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
15Updated 3 years ago

Alternatives and similar repositories for planar-face-discovery

Users that are interested in planar-face-discovery are comparing it to the libraries listed below

Sorting: