24#define EDGE_IS_UNSET INT_MAX
36#define EDGE_IS_HANDLED (INT_MAX - 1)
37#define EDGE_IS_UNSET_OR_HANDLED(i) ((i) >= EDGE_IS_HANDLED)
44 for (
const auto item : edge_hash.
items()) {
45 int v_data = item.value;
50 int v2 = item.key.v_low;
51 int v3 = item.key.v_high;
57 int l2 = vert_to_corner[
v2];
58 int l3 = vert_to_corner[v3];
66 const uint tmp = value[0];
81 for (
int e = 0;
e < 3;
e++) {
85 bool inv_indices = (vert_tri[1] > vert_tri[2]);
87 {vert_tri[1], vert_tri[2]},
89 int new_value = int(corner_tri[0]) + 1;
90 *value = inv_indices ? -new_value : new_value;
92 vert_to_corner[vert_tri[1]] = corner_tri[1];
93 vert_to_corner[vert_tri[2]] = corner_tri[2];
98 int new_value = int(corner_tri[0]) + 1;
99 *value = inv_indices ? -new_value : new_value;
101 vert_to_corner[vert_tri[1]] = corner_tri[1];
102 vert_to_corner[vert_tri[2]] = corner_tri[2];
116 bool inv_opposite = (v_data < 0);
117 const int corner_opposite =
abs(v_data) - 1;
119 if (inv_opposite == inv_indices) {
122 &elb, corner_tri[0], corner_tri[1], corner_tri[2], corner_tri[0]);
124 &elb, corner_opposite, corner_tri[1], corner_tri[2], corner_opposite);
129 &elb, corner_tri[0], corner_tri[1], corner_tri[2], corner_opposite);
144 const std::array<BMLoop *, 3> &tri = looptris[i];
171 if (!hide_poly.
is_empty() && hide_poly[face]) {
175 for (
const int3 &tri : corner_tris.
slice(tris)) {
177 uint3(corner_verts[tri[0]], corner_verts[tri[1]], corner_verts[tri[2]]),
194 edge_hash.
reserve(tess_edge_len);
196 bool is_manifold =
true;
210 r_is_manifold = is_manifold;
225 edge_hash.
reserve(tess_edge_len);
227 bool is_manifold =
true;
233 const uint loop_index = subdiv_quad_index * 4;
234 const uint corner_0 = loop_index + 0;
235 const uint corner_1 = loop_index + 1;
236 const uint corner_2 = loop_index + 2;
237 const uint corner_3 = loop_index + 3;
245 {corner_0, corner_1, corner_2},
251 {corner_0, corner_2, corner_3},
260 r_is_manifold = is_manifold;
266#undef EDGE_IS_HANDLED
#define BM_elem_index_get(ele)
#define BM_elem_flag_test(ele, hflag)
constexpr IndexRange()=default
auto add_or_modify(const Key &key, const CreateValueF &create_value, const ModifyValueF &modify_value) -> decltype(create_value(nullptr))
ItemIterator items() const &
constexpr Span slice(int64_t start, int64_t size) const
constexpr IndexRange index_range() const
constexpr bool is_empty() const
IndexRange index_range() const
IndexRange face_triangles_range(OffsetIndices< int > faces, int face_i)
gpu::IndexBufPtr extract_lines_adjacency_subdiv(const DRWSubdivCache &subdiv_cache, bool &r_is_manifold)
gpu::IndexBufPtr extract_lines_adjacency(const MeshRenderData &mr, bool &r_is_manifold)
static void calc_adjacency_mesh(const MeshRenderData &mr, MutableSpan< int > vert_to_corner, Map< OrderedEdge, int > &edge_hash, GPUIndexBufBuilder &elb, bool &is_manifold)
void lines_adjacency_triangle(uint3 vert_tri, uint3 corner_tri, MutableSpan< int > vert_to_corner, Map< OrderedEdge, int > &edge_hash, GPUIndexBufBuilder &elb, bool &is_manifold)
static void calc_adjacency_bm(const MeshRenderData &mr, MutableSpan< int > vert_to_corner, Map< OrderedEdge, int > &edge_hash, GPUIndexBufBuilder &elb, bool &is_manifold)
static void create_lines_for_remaining_edges(MutableSpan< int > vert_to_corner, Map< OrderedEdge, int > &edge_hash, GPUIndexBufBuilder &elb, bool &is_manifold)
void rotate_vector(uint3 &value)
std::unique_ptr< IndexBuf, IndexBufDeleter > IndexBufPtr
void GPU_indexbuf_init(GPUIndexBufBuilder *, GPUPrimType, uint prim_len, uint vertex_len)
void GPU_indexbuf_add_line_adj_verts(GPUIndexBufBuilder *, uint v1, uint v2, uint v3, uint v4)
VecBase< uint32_t, 3 > uint3
ATTR_WARN_UNUSED_RESULT const BMVert * v
gpu::IndexBuf * GPU_indexbuf_build(GPUIndexBufBuilder *)
VecBase< int32_t, 3 > int3
ATTR_WARN_UNUSED_RESULT const BMVert * v2
ATTR_WARN_UNUSED_RESULT const BMVert const BMEdge * e
Array< std::array< BMLoop *, 3 > > looptris
int * subdiv_loop_subdiv_vert_index
MeshExtractType extract_type
VArraySpan< bool > hide_poly
OffsetIndices< int > faces