forked from nvpro-samples/optix_prime_baking
/
bake_sample.cpp
341 lines (288 loc) · 12.6 KB
/
bake_sample.cpp
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
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
/*-----------------------------------------------------------------------
Copyright (c) 2015-2016, NVIDIA. All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
* Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
* Neither the name of its contributors may be used to endorse
or promote products derived from this software without specific
prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS ``AS IS'' AND ANY
EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR
CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-----------------------------------------------------------------------*/
#include "bake_api.h"
#include "bake_sample.h"
#include "bake_sample_internal.h" // templates
#include <optixu/optixu_math_namespace.h>
#include <optixu/optixu_matrix_namespace.h>
#include "random.h"
#include <algorithm>
#include <cassert>
#include <iostream>
#include <vector>
using namespace optix;
// Ref: https://en.wikipedia.org/wiki/Halton_sequence
template <unsigned int BASE>
float halton(const unsigned int index)
{
float result = 0.0f;
const float invBase = 1.0f / BASE;
float f = invBase;
unsigned int i = index;
while( i > 0 ) {
result += f*( i % BASE );
i = i / BASE;
f *= invBase;
}
return result;
}
float3 faceforward( const float3& normal, const float3& geom_normal )
{
if ( optix::dot( normal, geom_normal ) > 0.0f ) return normal;
return -normal;
}
float3 operator*(const optix::Matrix4x4& mat, const float3& v)
{
return make_float3(mat*make_float4(v, 1.0f));
}
void sample_triangle(const optix::Matrix4x4& xform, const optix::Matrix4x4& xform_invtrans,
const float3** verts, const float3** normals,
const size_t tri_idx, const size_t tri_sample_count, const double tri_area,
const unsigned base_seed,
float3* sample_positions, float3* sample_norms, float3* sample_face_norms, bake::SampleInfo* sample_infos)
{
const float3& v0 = *verts[0];
const float3& v1 = *verts[1];
const float3& v2 = *verts[2];
const float3 face_normal = optix::normalize( optix::cross( v1-v0, v2-v0 ) );
float3 n0, n1, n2;
if (normals) {
n0 = faceforward( *normals[0], face_normal );
n1 = faceforward( *normals[1], face_normal );
n2 = faceforward( *normals[2], face_normal );
} else {
// missing vertex normals, so use face normal.
n0 = face_normal;
n1 = face_normal;
n2 = face_normal;
}
// Random offset per triangle, to shift Halton points
unsigned seed = tea<4>( base_seed, (unsigned)tri_idx );
const float2 offset = make_float2( rnd(seed), rnd(seed) );
for ( size_t index = 0; index < tri_sample_count; ++index )
{
sample_infos[index].tri_idx = (unsigned)tri_idx;
sample_infos[index].dA = static_cast<float>(tri_area / tri_sample_count);
// Random point in unit square
float r1 = offset.x + halton<2>((unsigned)index+1);
r1 = r1 - (int)r1;
float r2 = offset.y + halton<3>((unsigned)index+1);
r2 = r2 - (int)r2;
assert(r1 >= 0 && r1 <= 1);
assert(r2 >= 0 && r2 <= 1);
// Map to triangle. Ref: PBRT 2nd edition, section 13.6.4
float3& bary = *reinterpret_cast<float3*>(sample_infos[index].bary);
const float sqrt_r1 = sqrt(r1);
bary.x = 1.0f - sqrt_r1;
bary.y = r2*sqrt_r1;
bary.z = 1.0f - bary.x - bary.y;
sample_positions[index] = xform*(bary.x*v0 + bary.y*v1 + bary.z*v2);
sample_norms[index] = optix::normalize(xform_invtrans*( bary.x*n0 + bary.y*n1 + bary.z*n2 ));
sample_face_norms[index] = optix::normalize(xform_invtrans*face_normal);
}
}
double triangle_area(const float3& v0, const float3& v1, const float3& v2)
{
float3 e0 = v1 - v0;
float3 e1 = v2 - v0;
float3 c = optix::cross(e0, e1);
double x = c.x, y = c.y, z = c.z;
return 0.5*sqrt(x*x + y*y + z*z);
}
class TriangleSamplerCallback
{
public:
TriangleSamplerCallback(const unsigned int minSamplesPerTriangle,
const double* areaPerTriangle)
: m_minSamplesPerTriangle(minSamplesPerTriangle),
m_areaPerTriangle(areaPerTriangle)
{}
unsigned int minSamples(size_t i) const {
return m_minSamplesPerTriangle; // same for every triangle
}
double area(size_t i) const {
return m_areaPerTriangle[i];
}
private:
const unsigned int m_minSamplesPerTriangle;
const double* m_areaPerTriangle;
};
const float3* get_vertex(const float* v, unsigned stride_bytes, int index)
{
return reinterpret_cast<const float3*>(reinterpret_cast<const unsigned char*>(v) + index*stride_bytes);
}
void sample_instance(
const bake::Mesh& mesh,
const optix::Matrix4x4& xform,
const unsigned int seed,
const size_t min_samples_per_triangle,
bake::AOSamples& ao_samples
)
{
// Setup access to mesh data
const optix::Matrix4x4 xform_invtrans = xform.inverse().transpose();
assert( ao_samples.num_samples >= mesh.num_triangles*min_samples_per_triangle );
assert( mesh.vertices );
assert( mesh.num_vertices );
assert( ao_samples.sample_positions );
assert( ao_samples.sample_normals );
assert( ao_samples.sample_infos );
const int3* tri_vertex_indices = reinterpret_cast<int3*>( mesh.tri_vertex_indices );
float3* sample_positions = reinterpret_cast<float3*>( ao_samples.sample_positions );
float3* sample_norms = reinterpret_cast<float3*>( ao_samples.sample_normals );
float3* sample_face_norms = reinterpret_cast<float3*>( ao_samples.sample_face_normals );
bake::SampleInfo* sample_infos = ao_samples.sample_infos;
const unsigned vertex_stride_bytes = mesh.vertex_stride_bytes > 0 ? mesh.vertex_stride_bytes : 3*sizeof(float);
const unsigned normal_stride_bytes = mesh.normal_stride_bytes > 0 ? mesh.normal_stride_bytes : 3*sizeof(float);
// Compute triangle areas
std::vector<double> tri_areas(mesh.num_triangles, 0.0);
for ( size_t tri_idx = 0; tri_idx < mesh.num_triangles; tri_idx++ ) {
const int3& tri = tri_vertex_indices[tri_idx];
const float3* verts[] = {get_vertex(mesh.vertices, vertex_stride_bytes, tri.x),
get_vertex(mesh.vertices, vertex_stride_bytes, tri.y),
get_vertex(mesh.vertices, vertex_stride_bytes, tri.z)};
const double area = triangle_area(xform*verts[0][0], xform*verts[1][0], xform*verts[2][0]);
tri_areas[tri_idx] = area;
}
// Get sample counts
std::vector<size_t> tri_sample_counts(mesh.num_triangles, 0);
TriangleSamplerCallback cb((unsigned)min_samples_per_triangle, &tri_areas[0]);
distribute_samples_generic(cb, ao_samples.num_samples, mesh.num_triangles, &tri_sample_counts[0]);
// Place samples
size_t sample_idx = 0;
for (size_t tri_idx = 0; tri_idx < mesh.num_triangles; tri_idx++) {
const int3& tri = tri_vertex_indices[tri_idx];
const float3* verts[] = {get_vertex(mesh.vertices, vertex_stride_bytes, tri.x),
get_vertex(mesh.vertices, vertex_stride_bytes, tri.y),
get_vertex(mesh.vertices, vertex_stride_bytes, tri.z)};
const float3** normals = NULL;
const float3* norms[3];
if (mesh.normals) {
norms[0] = get_vertex(mesh.normals, normal_stride_bytes, tri.x);
norms[1] = get_vertex(mesh.normals, normal_stride_bytes, tri.y);
norms[2] = get_vertex(mesh.normals, normal_stride_bytes, tri.z);
normals = norms;
}
sample_triangle(xform, xform_invtrans, verts, normals,
tri_idx, tri_sample_counts[tri_idx], tri_areas[tri_idx],
seed,
sample_positions+sample_idx, sample_norms+sample_idx, sample_face_norms+sample_idx, sample_infos+sample_idx);
sample_idx += tri_sample_counts[tri_idx];
}
assert( sample_idx == ao_samples.num_samples );
#ifdef DEBUG_MESH_SAMPLES
for (size_t i = 0; i < ao_samples.num_samples; ++i ) {
const SampleInfo& info = sample_infos[i];
std::cerr << "sample info (" << i << "): " << info.tri_idx << ", (" << info.bary[0] << ", " << info.bary[1] << ", " << info.bary[2] << "), " << info.dA << std::endl;
}
#endif
}
void bake::sample_instances(
const Scene& scene,
const size_t* num_samples_per_instance,
const size_t min_samples_per_triangle,
bake::AOSamples& ao_samples
)
{
std::vector<size_t> sample_offsets(scene.num_instances);
{
size_t sample_offset = 0;
for (size_t i = 0; i < scene.num_instances; ++i) {
sample_offsets[i] = sample_offset;
sample_offset += num_samples_per_instance[i];
}
}
#pragma omp parallel for
for (ptrdiff_t i = 0; i < ptrdiff_t(scene.num_instances); ++i) {
size_t sample_offset = sample_offsets[i];
// Point to samples for this instance
AOSamples instance_ao_samples;
instance_ao_samples.num_samples = num_samples_per_instance[i];
instance_ao_samples.sample_positions = ao_samples.sample_positions + 3*sample_offset;
instance_ao_samples.sample_normals = ao_samples.sample_normals + 3*sample_offset;
instance_ao_samples.sample_face_normals = ao_samples.sample_face_normals + 3*sample_offset;
instance_ao_samples.sample_infos = ao_samples.sample_infos + sample_offset;
optix::Matrix4x4 xform(scene.instances[i].xform);
sample_instance(scene.meshes[scene.instances[i].mesh_index], xform, (unsigned int)i, min_samples_per_triangle, instance_ao_samples);
}
}
class InstanceSamplerCallback
{
public:
InstanceSamplerCallback(const unsigned int* minSamplesPerInstance,
const double* areaPerInstance)
: m_minSamplesPerInstance(minSamplesPerInstance),
m_areaPerInstance(areaPerInstance)
{}
unsigned int minSamples(size_t i) const {
return m_minSamplesPerInstance[i];
}
double area(size_t i) const {
return m_areaPerInstance[i];
}
private:
const unsigned int* m_minSamplesPerInstance;
const double* m_areaPerInstance;
};
size_t bake::distribute_samples(
const Scene& scene,
const size_t min_samples_per_triangle,
const size_t requested_num_samples,
size_t* num_samples_per_instance
)
{
// Compute min samples per instance
std::vector<unsigned int> min_samples_per_instance(scene.num_instances);
size_t num_triangles = 0;
for (size_t i = 0; i < scene.num_instances; ++i) {
const bake::Mesh& mesh = scene.meshes[scene.instances[i].mesh_index];
min_samples_per_instance[i] = (unsigned int)(min_samples_per_triangle * mesh.num_triangles);
num_triangles += mesh.num_triangles;
}
const size_t min_num_samples = min_samples_per_triangle*num_triangles;
size_t num_samples = std::max(min_num_samples, requested_num_samples);
// Compute surface area per instance.
// Note: for many xforms, we could compute surface area per mesh instead of per instance.
std::vector<double> area_per_instance(scene.num_instances, 0.0);
if (num_samples > min_num_samples) {
#pragma omp parallel for
for (ptrdiff_t idx = 0; idx < ptrdiff_t(scene.num_instances); ++idx) {
const bake::Mesh& mesh = scene.meshes[scene.instances[idx].mesh_index];
const optix::Matrix4x4 xform(scene.instances[idx].xform);
const int3* tri_vertex_indices = reinterpret_cast<int3*>( mesh.tri_vertex_indices );
const unsigned vertex_stride_bytes = mesh.vertex_stride_bytes > 0 ? mesh.vertex_stride_bytes : 3*sizeof(float);
for (size_t tri_idx = 0; tri_idx < mesh.num_triangles; ++tri_idx) {
const int3& tri = tri_vertex_indices[tri_idx];
const float3* verts[] = {get_vertex(mesh.vertices, vertex_stride_bytes, tri.x),
get_vertex(mesh.vertices, vertex_stride_bytes, tri.y),
get_vertex(mesh.vertices, vertex_stride_bytes, tri.z)};
double area = triangle_area(xform*verts[0][0], xform*verts[1][0], xform*verts[2][0]);
area_per_instance[idx] += area;
}
}
}
// Distribute samples
InstanceSamplerCallback cb(&min_samples_per_instance[0], &area_per_instance[0]);
distribute_samples_generic(cb, num_samples, scene.num_instances, num_samples_per_instance);
return num_samples;
}