1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
|
/* SPDX-License-Identifier: GPL-2.0-or-later */
#include "DNA_mesh_types.h"
#include "DNA_meshdata_types.h"
#include "BKE_mesh.h"
#include "node_geometry_util.hh"
namespace blender::nodes::node_geo_input_mesh_face_neighbors_cc {
static void node_declare(NodeDeclarationBuilder &b)
{
b.add_output<decl::Int>(N_("Vertex Count"))
.field_source()
.description(N_("Number of edges or points in the face"));
b.add_output<decl::Int>(N_("Face Count"))
.field_source()
.description(N_("Number of faces which share an edge with the face"));
}
static VArray<int> construct_neighbor_count_varray(const Mesh &mesh, const eAttrDomain domain)
{
const Span<MPoly> polys = mesh.polys();
const Span<MLoop> loops = mesh.loops();
Array<int> edge_count(mesh.totedge, 0);
for (const MLoop &loop : loops) {
edge_count[loop.e]++;
}
Array<int> poly_count(polys.size(), 0);
for (const int poly_index : polys.index_range()) {
const MPoly &poly = polys[poly_index];
for (const MLoop &loop : loops.slice(poly.loopstart, poly.totloop)) {
poly_count[poly_index] += edge_count[loop.e] - 1;
}
}
return mesh.attributes().adapt_domain<int>(
VArray<int>::ForContainer(std::move(poly_count)), ATTR_DOMAIN_FACE, domain);
}
class FaceNeighborCountFieldInput final : public bke::MeshFieldInput {
public:
FaceNeighborCountFieldInput()
: bke::MeshFieldInput(CPPType::get<int>(), "Face Neighbor Count Field")
{
category_ = Category::Generated;
}
GVArray get_varray_for_context(const Mesh &mesh,
const eAttrDomain domain,
IndexMask UNUSED(mask)) const final
{
return construct_neighbor_count_varray(mesh, domain);
}
uint64_t hash() const override
{
/* Some random constant hash. */
return 823543774;
}
bool is_equal_to(const fn::FieldNode &other) const override
{
return dynamic_cast<const FaceNeighborCountFieldInput *>(&other) != nullptr;
}
};
static VArray<int> construct_vertex_count_varray(const Mesh &mesh, const eAttrDomain domain)
{
const Span<MPoly> polys = mesh.polys();
return mesh.attributes().adapt_domain<int>(
VArray<int>::ForFunc(polys.size(),
[polys](const int i) -> float { return polys[i].totloop; }),
ATTR_DOMAIN_FACE,
domain);
}
class FaceVertexCountFieldInput final : public bke::MeshFieldInput {
public:
FaceVertexCountFieldInput() : bke::MeshFieldInput(CPPType::get<int>(), "Vertex Count Field")
{
category_ = Category::Generated;
}
GVArray get_varray_for_context(const Mesh &mesh,
const eAttrDomain domain,
IndexMask UNUSED(mask)) const final
{
return construct_vertex_count_varray(mesh, domain);
}
uint64_t hash() const override
{
/* Some random constant hash. */
return 236235463634;
}
bool is_equal_to(const fn::FieldNode &other) const override
{
return dynamic_cast<const FaceVertexCountFieldInput *>(&other) != nullptr;
}
};
static void node_geo_exec(GeoNodeExecParams params)
{
Field<int> vertex_count_field{std::make_shared<FaceVertexCountFieldInput>()};
Field<int> neighbor_count_field{std::make_shared<FaceNeighborCountFieldInput>()};
params.set_output("Vertex Count", std::move(vertex_count_field));
params.set_output("Face Count", std::move(neighbor_count_field));
}
} // namespace blender::nodes::node_geo_input_mesh_face_neighbors_cc
void register_node_type_geo_input_mesh_face_neighbors()
{
namespace file_ns = blender::nodes::node_geo_input_mesh_face_neighbors_cc;
static bNodeType ntype;
geo_node_type_base(
&ntype, GEO_NODE_INPUT_MESH_FACE_NEIGHBORS, "Face Neighbors", NODE_CLASS_INPUT);
node_type_size_preset(&ntype, NODE_SIZE_MIDDLE);
ntype.declare = file_ns::node_declare;
ntype.geometry_node_execute = file_ns::node_geo_exec;
nodeRegisterType(&ntype);
}
|
