2a4323c2f5
Implements #95966, as the final step of #95965. This commit changes the storage of mesh edge vertex indices from the `MEdge` type to the generic `int2` attribute type. This follows the general design for geometry and the attribute system, where the data storage type and the usage semantics are separated. The main benefit of the change is reduced memory usage-- the requirements of storing mesh edges is reduced by 1/3. For example, this saves 8MB on a 1 million vertex grid. This also gives performance benefits to any memory-bound mesh processing algorithm that uses edges. Another benefit is that all of the edge's vertex indices are contiguous. In a few cases, it's helpful to process all of them as `Span<int>` rather than `Span<int2>`. Similarly, the type is more likely to match a generic format used by a library, or code that shouldn't know about specific Blender `Mesh` types. Various Notes: - The `.edge_verts` name is used to reflect a mapping between domains, similar to `.corner_verts`, etc. The period means that it the data shouldn't change arbitrarily by the user or procedural operations. - `edge[0]` is now used instead of `edge.v1` - Signed integers are used instead of unsigned to reduce the mixing of signed-ness, which can be error prone. - All of the previously used core mesh data types (`MVert`, `MEdge`, `MLoop`, `MPoly` are now deprecated. Only generic types are used). - The `vec2i` DNA type is used in the few C files where necessary. Pull Request: https://projects.blender.org/blender/blender/pulls/106638
44 lines
1.7 KiB
C++
44 lines
1.7 KiB
C++
/* SPDX-License-Identifier: GPL-2.0-or-later
|
|
* Copyright 2018 Blender Foundation */
|
|
|
|
/** \file
|
|
* \ingroup bke
|
|
*/
|
|
|
|
#pragma once
|
|
|
|
#include "BLI_math_vector_types.hh"
|
|
#include "BLI_sys_types.h"
|
|
|
|
struct Mesh;
|
|
struct MeshElemMap;
|
|
struct Subdiv;
|
|
|
|
struct SubdivToMeshSettings {
|
|
/* Resolution at which regular ptex (created for quad polygon) are being
|
|
* evaluated. This defines how many vertices final mesh will have: every
|
|
* regular ptex has resolution^2 vertices. Special (irregular, or ptex
|
|
* created for a corner of non-quad polygon) will have resolution of
|
|
* `resolution - 1`.
|
|
*/
|
|
int resolution;
|
|
/* When true, only edges emitted from coarse ones will be displayed. */
|
|
bool use_optimal_display;
|
|
};
|
|
|
|
/* Create real hi-res mesh from subdivision, all geometry is "real". */
|
|
Mesh *BKE_subdiv_to_mesh(Subdiv *subdiv,
|
|
const SubdivToMeshSettings *settings,
|
|
const Mesh *coarse_mesh);
|
|
|
|
/* Interpolate a position along the `coarse_edge` at the relative `u` coordinate. If `is_simple` is
|
|
* false, this will perform a B-Spline interpolation using the edge neighbors, otherwise a linear
|
|
* interpolation will be done base on the edge vertices. */
|
|
void BKE_subdiv_mesh_interpolate_position_on_edge(const float (*coarse_positions)[3],
|
|
const blender::int2 *coarse_edges,
|
|
const MeshElemMap *vert_to_edge_map,
|
|
int coarse_edge_index,
|
|
bool is_simple,
|
|
float u,
|
|
float pos_r[3]);
|