Find throats which make a Gabriel subgraph
throats – An ndarray of boolean values with
Trueindicating 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:
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 .