Differential D16083 Diff 56395 source/blender/nodes/geometry/nodes/node_geo_mesh_topology_corners_of_vertex.cc

Changeset View

Standalone View

source/blender/nodes/geometry/nodes/node_geo_mesh_topology_corners_of_vertex.cc

This file was added.

				/* SPDX-License-Identifier: GPL-2.0-or-later */

				#include "BKE_mesh.h"
				#include "BKE_mesh_mapping.h"

				#include "BLI_task.hh"

				#include "node_geometry_util.hh"

				namespace blender::nodes::node_geo_mesh_topology_corners_of_vertex_cc {

				static void node_declare(NodeDeclarationBuilder &b)
				{
				b.add_input<decl::Int>(N_("Vertex Index"))
				.implicit_field(implicit_field_inputs::index)
				.description(
				N_("The vertex to retrieve data from. Defaults to the vertex from the context"));
				b.add_input<decl::Float>(N_("Weights"))
				.supports_field()
				.hide_value()
				.description(
				N_("Values used to sort corners attached to the vertex. Uses indices by default"));
				b.add_input<decl::Int>(N_("Sort Index"))
				.min(0)
				.supports_field()
				.description(N_("Which of the sorted corners to output"));
				b.add_output<decl::Int>(N_("Total"))
				.dependent_field()
				.description(N_("The number of faces or corners connected to each vertex"));
				b.add_output<decl::Int>(N_("Corner Index"))
				.dependent_field()
				.description(N_("A corner connected to the face, chosen by the sort index"));
				}

				static void convert_span(const Span<int> src, MutableSpan<int64_t> dst)
				{
				for (const int i : src.index_range()) {
				dst[i] = src[i];
				}
				}

				class CornersOfVertInput final : public bke::MeshFieldInput {
				const Field<int> vert_index_;
				const Field<int> sort_index_;
				const Field<float> sort_weight_;

				public:
				CornersOfVertInput(Field<int> vert_index, Field<int> sort_index, Field<float> sort_weight)
				: bke::MeshFieldInput(CPPType::get<int>(), "Corner of Vertex"),
				vert_index_(std::move(vert_index)),
				sort_index_(std::move(sort_index)),
				sort_weight_(std::move(sort_weight))
				{
				category_ = Category::Generated;
				}

				GVArray get_varray_for_context(const Mesh &mesh,
				const eAttrDomain domain,
				const IndexMask mask) const final
				{
				const IndexRange vert_range(mesh.totvert);
				const Span<MLoop> loops = mesh.loops();
				Array<Vector<int>> vert_to_corner_map = mesh_topology::build_vert_to_corner_map(loops,
				mesh.totvert);

				const bke::MeshFieldContext context{mesh, domain};
				fn::FieldEvaluator evaluator{context, &mask};
				evaluator.add(vert_index_);
				evaluator.add(sort_index_);
				evaluator.evaluate();
				const VArray<int> vert_indices = evaluator.get_evaluated<int>(0);
				const VArray<int> indices_in_sort = evaluator.get_evaluated<int>(1);

				const bke::MeshFieldContext corner_context{mesh, ATTR_DOMAIN_CORNER};
				fn::FieldEvaluator corner_evaluator{corner_context, loops.size()};
				corner_evaluator.add(sort_weight_);
				corner_evaluator.evaluate();
				const VArray<float> all_sort_weights = corner_evaluator.get_evaluated<float>(0);

				Array<int> corner_of_vertex(mask.min_array_size());
				threading::parallel_for(mask.index_range(), 1024, [&](const IndexRange range) {
				/* Reuse arrays to avoid allocation. */
				Array<int64_t> corner_indices;
				Array<float> sort_weights;
				Array<int> sort_indices;

				for (const int selection_i : mask.slice(range)) {
				const int vert_i = vert_indices[selection_i];
				const int index_in_sort = indices_in_sort[selection_i];
				if (!vert_range.contains(vert_i)) {
				corner_of_vertex[selection_i] = 0;
				continue;
				}

				const Span<int> corners = vert_to_corner_map[vert_i];

				/* Retrieve the connected edge indices as 64 bit integers for #materialize_compressed. */
				corner_indices.reinitialize(corners.size());
				convert_span(corners, corner_indices);

				/* Retrieve a compressed array of weights for each edge. */
				sort_weights.reinitialize(corners.size());
				all_sort_weights.materialize_compressed(IndexMask(corner_indices),
				sort_weights.as_mutable_span());

				/* Sort a separate array of compressed indices corresponding to the compressed weights.
				* This allows using `materialize_compressed` to avoid virtual function call overhead
				* when accessing values in the sort weights. However, it means a separate array of
				* indices within the compressed array is necessary for sorting. */
				sort_indices.reinitialize(corners.size());
				std::iota(sort_indices.begin(), sort_indices.end(), 0);
				std::stable_sort(sort_indices.begin(), sort_indices.end(), [&](int a, int b) {
				return sort_weights[a] < sort_weights[b];
				});

				const int index_in_sort_wrapped = mod_i(index_in_sort, corners.size());
				corner_of_vertex[selection_i] = corner_indices[sort_indices[index_in_sort_wrapped]];
				}
				});

				return VArray<int>::ForContainer(std::move(corner_of_vertex));
				}

				uint64_t hash() const final
				{
				return 3541871368173645;
				}

				bool is_equal_to(const fn::FieldNode &other) const final
				{
				if (const auto typed = dynamic_cast<const CornersOfVertInput >(&other)) {
				return typed->vert_index_ == vert_index_ && typed->sort_index_ == sort_index_ &&
				typed->sort_weight_ == sort_weight_;
				}
				return false;
				}
				};

				class CornersOfVertCountInput final : public bke::MeshFieldInput {
				public:
				CornersOfVertCountInput() : bke::MeshFieldInput(CPPType::get<int>(), "Vertex Corner Count")
				{
				category_ = Category::Generated;
				}

				GVArray get_varray_for_context(const Mesh &mesh,
				const eAttrDomain domain,
				const IndexMask /mask/) const final
				{
				if (domain != ATTR_DOMAIN_POINT) {
				return {};
				}
				const Span<MLoop> loops = mesh.loops();
				Array<int> counts(mesh.totvert, 0);
				for (const int i : loops.index_range()) {
				counts[loops[i].v]++;
				}
				return VArray<int>::ForContainer(std::move(counts));
				}

				uint64_t hash() const final
				{
				return 253098745374645;
				}

				bool is_equal_to(const fn::FieldNode &other) const final
				{
				if (dynamic_cast<const CornersOfVertCountInput *>(&other)) {
				return true;
				}
				return false;
				}
				};

				static void node_geo_exec(GeoNodeExecParams params)
				{
				const Field<int> vert_index = params.extract_input<Field<int>>("Vertex Index");
				if (params.output_is_required("Total")) {
				params.set_output("Total",
				Field<int>(std::make_shared<FieldAtIndexInput>(
				vert_index,
				Field<int>(std::make_shared<CornersOfVertCountInput>()),
				ATTR_DOMAIN_POINT)));
				}
				if (params.output_is_required("Corner Index")) {
				params.set_output("Corner Index",
				Field<int>(std::make_shared<CornersOfVertInput>(
				vert_index,
				params.extract_input<Field<int>>("Sort Index"),
				params.extract_input<Field<float>>("Weights"))));
				}
				}
				} // namespace blender::nodes::node_geo_mesh_topology_corners_of_vertex_cc

				void register_node_type_geo_mesh_topology_corners_of_vertex()
				{
				namespace file_ns = blender::nodes::node_geo_mesh_topology_corners_of_vertex_cc;

				static bNodeType ntype;
				geo_node_type_base(
				&ntype, GEO_NODE_MESH_TOPOLOGY_CORNERS_OF_VERTEX, "Corners of Vertex", NODE_CLASS_INPUT);
				ntype.geometry_node_execute = file_ns::node_geo_exec;
				ntype.declare = file_ns::node_declare;
				nodeRegisterType(&ntype);
				}