Welcome to mirror list, hosted at ThFree Co, Russian Federation.

node_geo_curve_fill.cc « nodes « geometry « nodes « blender « source - git.blender.org/blender.git - Unnamed repository; edit this file 'description' to name the repository.
summaryrefslogtreecommitdiff
blob: 8de2975f9b0aebbe7fdbbd1cfd5e413820070a79 (plain)
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
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
/*
 * This program is free software; you can redistribute it and/or
 * modify it under the terms of the GNU General Public License
 * as published by the Free Software Foundation; either version 2
 * of the License, or (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software Foundation,
 * Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
 */

#include "BLI_array.hh"
#include "BLI_delaunay_2d.h"
#include "BLI_double2.hh"

#include "DNA_mesh_types.h"
#include "DNA_meshdata_types.h"

#include "BKE_mesh.h"
#include "BKE_spline.hh"

#include "BLI_task.hh"

#include "UI_interface.h"
#include "UI_resources.h"

#include "node_geometry_util.hh"

namespace blender::nodes {

static void geo_node_curve_fill_declare(NodeDeclarationBuilder &b)
{
  b.add_input<decl::Geometry>("Curve");
  b.add_output<decl::Geometry>("Mesh");
}

static void geo_node_curve_fill_layout(uiLayout *layout, bContext *UNUSED(C), PointerRNA *ptr)
{
  uiItemR(layout, ptr, "mode", UI_ITEM_R_EXPAND, nullptr, ICON_NONE);
}

static void geo_node_curve_fill_init(bNodeTree *UNUSED(ntree), bNode *node)
{
  NodeGeometryCurveFill *data = (NodeGeometryCurveFill *)MEM_callocN(sizeof(NodeGeometryCurveFill),
                                                                     __func__);

  data->mode = GEO_NODE_CURVE_FILL_MODE_TRIANGULATED;
  node->storage = data;
}

static blender::meshintersect::CDT_result<double> do_cdt(const CurveEval &curve,
                                                         const CDT_output_type output_type)
{
  Span<SplinePtr> splines = curve.splines();
  blender::meshintersect::CDT_input<double> input;
  input.need_ids = false;
  Array<int> offsets = curve.evaluated_point_offsets();
  input.vert.reinitialize(offsets.last());
  input.face.reinitialize(splines.size());

  for (const int i_spline : splines.index_range()) {
    const SplinePtr &spline = splines[i_spline];
    const int vert_offset = offsets[i_spline];

    Span<float3> positions = spline->evaluated_positions();
    for (const int i : positions.index_range()) {
      input.vert[vert_offset + i] = double2(positions[i].x, positions[i].y);
    }

    input.face[i_spline].resize(spline->evaluated_edges_size());
    MutableSpan<int> face_verts = input.face[i_spline];
    for (const int i : IndexRange(spline->evaluated_edges_size())) {
      face_verts[i] = vert_offset + i;
    }
  }
  blender::meshintersect::CDT_result<double> result = delaunay_2d_calc(input, output_type);
  return result;
}

/* Converts the CDT result into a Mesh. */
static Mesh *cdt_to_mesh(const blender::meshintersect::CDT_result<double> &result)
{
  int vert_len = result.vert.size();
  int edge_len = result.edge.size();
  int poly_len = result.face.size();
  int loop_len = 0;

  for (const Vector<int> &face : result.face) {
    loop_len += face.size();
  }

  Mesh *mesh = BKE_mesh_new_nomain(vert_len, edge_len, 0, loop_len, poly_len);
  MutableSpan<MVert> verts{mesh->mvert, mesh->totvert};
  MutableSpan<MEdge> edges{mesh->medge, mesh->totedge};
  MutableSpan<MLoop> loops{mesh->mloop, mesh->totloop};
  MutableSpan<MPoly> polys{mesh->mpoly, mesh->totpoly};

  for (const int i : IndexRange(result.vert.size())) {
    copy_v3_v3(verts[i].co, float3((float)result.vert[i].x, (float)result.vert[i].y, 0.0f));
  }
  for (const int i : IndexRange(result.edge.size())) {
    edges[i].v1 = result.edge[i].first;
    edges[i].v2 = result.edge[i].second;
    edges[i].flag = ME_EDGEDRAW | ME_EDGERENDER;
  }
  int i_loop = 0;
  for (const int i : IndexRange(result.face.size())) {
    polys[i].loopstart = i_loop;
    polys[i].totloop = result.face[i].size();
    for (const int j : result.face[i].index_range()) {
      loops[i_loop].v = result.face[i][j];
      i_loop++;
    }
  }

  /* The delaunay triangulation doesn't seem to return all of the necessary edges, even in
   * triangulation mode. */
  BKE_mesh_calc_edges(mesh, true, false);
  return mesh;
}

static void curve_fill_calculate(GeometrySet &geometry_set, const GeometryNodeCurveFillMode mode)
{
  if (!geometry_set.has_curve()) {
    return;
  }

  const CurveEval &curve = *geometry_set.get_curve_for_read();
  if (curve.splines().is_empty()) {
    geometry_set.replace_curve(nullptr);
    return;
  }

  const CDT_output_type output_type = (mode == GEO_NODE_CURVE_FILL_MODE_NGONS) ?
                                          CDT_CONSTRAINTS_VALID_BMESH_WITH_HOLES :
                                          CDT_INSIDE_WITH_HOLES;

  const blender::meshintersect::CDT_result<double> results = do_cdt(curve, output_type);
  Mesh *mesh = cdt_to_mesh(results);

  geometry_set.replace_mesh(mesh);
  geometry_set.replace_curve(nullptr);
}

static void geo_node_curve_fill_exec(GeoNodeExecParams params)
{
  GeometrySet geometry_set = params.extract_input<GeometrySet>("Curve");

  const NodeGeometryCurveFill &storage = *(const NodeGeometryCurveFill *)params.node().storage;
  const GeometryNodeCurveFillMode mode = (GeometryNodeCurveFillMode)storage.mode;

  if (geometry_set.has_instances()) {
    InstancesComponent &instances = geometry_set.get_component_for_write<InstancesComponent>();
    instances.ensure_geometry_instances();

    threading::parallel_for(IndexRange(instances.references_amount()), 16, [&](IndexRange range) {
      for (int i : range) {
        GeometrySet &geometry_set = instances.geometry_set_from_reference(i);
        geometry_set = bke::geometry_set_realize_instances(geometry_set);
        curve_fill_calculate(geometry_set, mode);
      }
    });

    params.set_output("Mesh", std::move(geometry_set));
    return;
  }

  curve_fill_calculate(geometry_set, mode);

  params.set_output("Mesh", std::move(geometry_set));
}

}  // namespace blender::nodes

void register_node_type_geo_curve_fill()
{
  static bNodeType ntype;

  geo_node_type_base(&ntype, GEO_NODE_CURVE_FILL, "Curve Fill", NODE_CLASS_GEOMETRY, 0);

  node_type_init(&ntype, blender::nodes::geo_node_curve_fill_init);
  node_type_storage(
      &ntype, "NodeGeometryCurveFill", node_free_standard_storage, node_copy_standard_storage);
  ntype.declare = blender::nodes::geo_node_curve_fill_declare;
  ntype.geometry_node_execute = blender::nodes::geo_node_curve_fill_exec;
  ntype.draw_buttons = blender::nodes::geo_node_curve_fill_layout;
  nodeRegisterType(&ntype);
}