Blender V5.3
bmesh_edgenet.cc File Reference
#include <climits>
#include "MEM_guardedalloc.h"
#include "BLI_array.hh"
#include "BLI_linklist.hh"
#include "BLI_mempool.hh"
#include "BLI_utildefines.hh"
#include "bmesh.hh"
#include "bmesh_edgenet.hh"
#include "BLI_strict_flags.hh"

Go to the source code of this file.

Classes

struct  blender::VertNetInfo

Namespaces

namespace  blender
 BMesh Iterators.

Enumerations

enum  { blender::VNINFO_FLAG_IS_MIXFACE = (1 << 0) }

Functions

static bool blender::bm_edge_step_ok (BMEdge *e)
static int blender::bm_edge_face (BMEdge *e)
static BMEdge * blender::bm_edgenet_edge_get_next (BMesh *bm, LinkNode **edge_queue, BLI_mempool *edge_queue_pool)
static uint blender::bm_edgenet_path_from_pass (BMVert *v, LinkNode **v_ls, VertNetInfo *vnet_info, BLI_mempool *path_pool)
static bool blender::bm_edgenet_path_check_overlap (BMVert *v1, BMVert *v2, VertNetInfo *vnet_info)
static BMFace * blender::bm_edgenet_face_from_path (BMesh *bm, LinkNode *path, const uint path_len)
static BMEdge * blender::bm_edgenet_path_step (BMVert *v_curr, LinkNode **v_ls, VertNetInfo *vnet_info, BLI_mempool *path_pool)
static LinkNode * blender::bm_edgenet_path_calc (BMEdge *e, const int pass_nr, const uint path_cost_max, uint *r_path_len, uint *r_path_cost, VertNetInfo *vnet_info, BLI_mempool *path_pool)
static LinkNode * blender::bm_edgenet_path_calc_best (BMEdge *e, int *pass_nr, uint path_cost_max, uint *r_path_len, uint *r_path_cost, VertNetInfo *vnet_info, BLI_mempool *path_pool)
void blender::BM_mesh_edgenet (BMesh *bm, const bool use_edge_tag, const bool use_new_face_tag)

Detailed Description

Edge-net Fill.

Definition in file bmesh_edgenet.cc.