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
|
/*
* ***** BEGIN GPL LICENSE BLOCK *****
*
* 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.
*
* Contributor(s):
*
* ***** END GPL LICENSE BLOCK *****
*/
#ifndef __UVEDIT_PARAMETRIZER_H__
#define __UVEDIT_PARAMETRIZER_H__
/** \file blender/editors/uvedit/uvedit_parametrizer.h
* \ingroup eduv
*/
#ifdef __cplusplus
extern "C" {
#endif
#include "DNA_meshdata_types.h"
#include "DNA_object_types.h"
#include "BKE_deform.h"
#include "BLI_sys_types.h" // for intptr_t support
#include "matrix_transfer.h" // for SLIM
#include "slim_C_interface.h"
typedef void ParamHandle; /* handle to a set of charts */
typedef intptr_t ParamKey; /* (hash) key for identifying verts and faces */
typedef enum ParamBool {
PARAM_TRUE = 1,
PARAM_FALSE = 0
} ParamBool;
/* Chart construction:
* -------------------
* - faces and seams may only be added between construct_{begin|end}
* - the pointers to co and uv are stored, rather than being copied
* - vertices are implicitly created
* - in construct_end the mesh will be split up according to the seams
* - the resulting charts must be:
* - manifold, connected, open (at least one boundary loop)
* - output will be written to the uv pointers
*/
ParamHandle *param_construct_begin(void);
void param_aspect_ratio(ParamHandle *handle, float aspx, float aspy);
void param_face_add(ParamHandle *handle,
ParamKey key,
int nverts,
ParamKey *vkeys,
float *co[4],
float *uv[4],
float id[4],
ParamBool *pin,
ParamBool *select,
float face_normal[3]);
void param_edge_set_seam(ParamHandle *handle,
ParamKey *vkeys);
void param_construct_end(ParamHandle *handle, ParamBool fill, ParamBool impl);
void param_delete(ParamHandle *chart);
/* SLIM handle enrichment/construction:
* -----------------------------
* - enrich handle
*/
void add_index_to_vertices(BMEditMesh *em);
int retrieve_weightmap_index(Object *obedit);
void param_slim_enrich_handle(Object *obedit,
BMEditMesh *em,
ParamHandle *handle,
matrix_transfer *mt,
MDeformVert *dvert,
int weightMapIndex,
int n_iterations,
bool skip_initialization,
bool pack_islands,
bool with_weighted_parameterization);
/* unwrapping:
* -----------------------------
* - Either Conformal or SLIM
*/
void param_begin(ParamHandle *handle, ParamBool abf, bool useSlim);
void param_solve(ParamHandle *handle, bool useSlim);
void param_end(ParamHandle *handle, bool useSlim);
/* Least Squares Conformal Maps:
* -----------------------------
* - charts with less than two pinned vertices are assigned 2 pins
* - lscm is divided in three steps:
* - begin: compute matrix and it's factorization (expensive)
* - solve using pinned coordinates (cheap)
* - end: clean up
* - uv coordinates are allowed to change within begin/end, for
* quick re-solving
*/
void param_slim_begin(ParamHandle *handle);
void param_slim_solve(ParamHandle *handle);
void param_slim_end(ParamHandle *handle);
/* Least Squares Conformal Maps:
* -----------------------------
* - charts with less than two pinned vertices are assigned 2 pins
* - lscm is divided in three steps:
* - begin: compute matrix and it's factorization (expensive)
* - solve using pinned coordinates (cheap)
* - end: clean up
* - uv coordinates are allowed to change within begin/end, for
* quick re-solving
*/
void param_lscm_begin(ParamHandle *handle, ParamBool live, ParamBool abf);
void param_lscm_solve(ParamHandle *handle);
void param_lscm_end(ParamHandle *handle);
/* Stretch */
void param_stretch_begin(ParamHandle *handle);
void param_stretch_blend(ParamHandle *handle, float blend);
void param_stretch_iter(ParamHandle *handle);
void param_stretch_end(ParamHandle *handle);
/* Area Smooth */
void param_smooth_area(ParamHandle *handle);
/* Packing */
void param_pack(ParamHandle *handle, float margin, bool do_rotate);
/* Average area for all charts */
void param_average(ParamHandle *handle);
/* Simple x,y scale */
void param_scale(ParamHandle *handle, float x, float y);
/* Flushing */
void param_flush(ParamHandle *handle);
void param_flush_restore(ParamHandle *handle);
/* AUREL THESIS */
void transfer_data_to_slim(ParamHandle *handle);
void convert_blender_slim(ParamHandle *handle, bool selectionOnly, int weightMapIndex);
void set_uv_param_slim(ParamHandle *handle, matrix_transfer *mt);
bool transformIslands(ParamHandle *handle);
bool mark_pins(ParamHandle *paramHandle);
#ifdef __cplusplus
}
#endif
#endif /*__UVEDIT_PARAMETRIZER_H__*/
|
