CoarseQuadMesh.polyedge_graph

CoarseQuadMesh.polyedge_graph()[source]

Compute the vertices and edges of the graph representing the polyedge connectivity, where each graph vertex is a mesh polyedge and each graph edge a non-compas_singular mesh vertex representing the crossing of two polyedges. Polyedges connected by their extremities, which are singularities, do not count as overlapping. Potentially includes loop edges (u, u) or multiple arallel edges (u, v) and/or (v, u).

Returns

tuple – A tuple of two objects, the dictionary of mesh polyedge indices pointing to their centroid coordinates, and the list of edges between graph vertices.