gabriel_edges

gabriel_edges(network)

Find throats which make a Gabriel subgraph

Returns:

throats – An ndarray of boolean values with True indicating that a throat satisfies the conditions of Gabriel graph, meaning that a circle (or sphere) can be drawn between its two connected pores that does not contain any other pores.

Return type:

ndarray

Notes

Technically this should only be used on a Delaunay network, but it will work on any graph. By deleting all throats that are not identified by this fuction one would obtain the Gabriel graph [1].

References

[1] Wikipedia