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
[email protected] low health (39/100) — consider alternatives
Get this data programmatically — free, no authentication.
curl https://depscope.dev/api/check/npm/planar-face-discoveryFirst published · 2021-10-12T19:52:07.983Z
Last updated · 2021-11-14T12:44:26.203Z