|
| void | blender::UV_clipboard_free () |
| static int | blender::iso_index_for_loop (const BMLoop *loop, UvElementMap *element_map, const int island_index) |
| static void | blender::add_iso_edge (GraphISO *graph, BMLoop *loop_v, BMLoop *loop_w, UvElementMap *element_map, int island_index) |
| static GraphISO * | blender::build_iso_graph (UvElementMap *element_map, const int island_index, int) |
| static bool | blender::find_isomorphism (UvElementMap *dest, const int dest_island_index, GraphISO *graph_source, const int cd_loop_uv_offset, Vector< int > &r_label, bool *r_search_abandoned) |
| static wmOperatorStatus | blender::uv_copy_exec (bContext *C, wmOperator *) |
| static wmOperatorStatus | blender::uv_paste_exec (bContext *C, wmOperator *op) |
| void | blender::UV_OT_copy (wmOperatorType *ot) |
| void | blender::UV_OT_paste (wmOperatorType *ot) |
Attempt to find a graph isomorphism between the topology of two different UV islands.
- Note
- On terminology, for the purposes of this file:
- An iso_graph is a "Graph" in Graph Theory.
- An iso_graph has an unordered set of iso_verts.
- An iso_graph has an unordered set of iso_edges.
- An iso_vert is a "Vertex" in Graph Theory
- Each iso_vert has a label.
- An iso_edge is an "Edge" in Graph Theory
- Each iso_edge connects two iso_verts.
- An iso_edge is undirected.
Definition in file uvedit_clipboard.cc.