32 unordered_set<SubEdge, SubEdge::Hash, SubEdge::Equal> edges;
34 int num_triangles = 0;
37 int alloc_verts(
const int num);
38 SubEdge *alloc_edge(
const int v0,
const int v1,
const int depth,
bool &was_missing);
43 const bool want_to_own_edge,
44 const bool want_to_own_vertex);
49 std::pair<int, float>
T(
const Patch *patch,
53 const bool recursive_resolve =
false);
54 int limit_edge_factor(
const Patch *patch,
58 void assign_edge_factor(
SubEdge *edge,
62 const bool recursive_resolve =
false);
63 void resolve_edge_factors(
const SubPatch &sub);
74 void split_quad_into_triangles(
SubPatch &&sub);
79 const size_t patches_byte_stride);
88 return subpatches.size();
103 return num_triangles;
ATTR_WARN_UNUSED_RESULT const size_t num
DiagSplit(const SubdParams ¶ms)
int get_num_triangles() const
int get_num_verts() const
const SubPatch & get_subpatch(const size_t i) const
size_t get_num_subpatches() const
void split_patches(const Patch *patches, const size_t patches_byte_stride)
#define CCL_NAMESPACE_END