×

An application of graph theory in geographical data handling. (English) Zbl 0531.05033

Let G be a finite, planar, 2-connected digraph without loops and without multiple edges, which is not a circuit or a \(K_ 2\). Let G be embedded in the plane with straight edges. An algorithm is given to enumerate the faces of G together with their boundary edges.
Reviewer: J.Ebert

MSC:

05C10 Planar graphs; geometric and topological aspects of graph theory
68R10 Graph theory (including graph drawing) in computer science
86A30 Geodesy, mapping problems
PDFBibTeX XMLCite