Algorithm Search⌘K

Algorithmcore

Finding faces of a planar graph

Algorithm that finds all faces of a planar graph embedded in the plane by sorting edges by angle and walking around each face.

Algorithm that finds all faces of a planar graph embedded in the plane by sorting edges by angle and walking around each face.

About this page

The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.

LadderLevelWhat the next level needs
Human proofH0 no proof
  • add a proof in proofs/ (06.5)
LeanL0 no Lean part
  • name a Lean module in the lean field (07)
VisualV0 none
  • add viz/scene.ts or a figure (10)
WritingW0 stub
  • the section The problem
  • pseudocode in The algorithm
  • complexity claims in the front matter
  • one source with a locator

Tag X3Q68V Edit this page History Report an error