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
|
// Copyright 2009-2020 Intel Corporation
// SPDX-License-Identifier: Apache-2.0
#pragma once
#include "buffer.h"
#include "default.h"
#include "geometry.h"
namespace embree
{
/*! represents an array of points */
struct Points : public Geometry
{
/*! type of this geometry */
static const Geometry::GTypeMask geom_type = Geometry::MTY_POINTS;
public:
/*! line segments construction */
Points(Device* device, Geometry::GType gtype);
public:
void setMask(unsigned mask);
void setNumTimeSteps(unsigned int numTimeSteps);
void setVertexAttributeCount(unsigned int N);
void setBuffer(RTCBufferType type,
unsigned int slot,
RTCFormat format,
const Ref<Buffer>& buffer,
size_t offset,
size_t stride,
unsigned int num);
void* getBuffer(RTCBufferType type, unsigned int slot);
void updateBuffer(RTCBufferType type, unsigned int slot);
void commit();
bool verify();
void setMaxRadiusScale(float s);
void addElementsToCount (GeometryCounts & counts) const;
public:
/*! returns the number of vertices */
__forceinline size_t numVertices() const {
return vertices[0].size();
}
/*! returns i'th vertex of the first time step */
__forceinline Vec3ff vertex(size_t i) const {
return vertices0[i];
}
/*! returns i'th vertex of the first time step */
__forceinline const char* vertexPtr(size_t i) const {
return vertices0.getPtr(i);
}
/*! returns i'th normal of the first time step */
__forceinline Vec3fa normal(size_t i) const {
return normals0[i];
}
/*! returns i'th radius of the first time step */
__forceinline float radius(size_t i) const {
return vertices0[i].w;
}
/*! returns i'th vertex of itime'th timestep */
__forceinline Vec3ff vertex(size_t i, size_t itime) const {
return vertices[itime][i];
}
/*! returns i'th vertex of itime'th timestep */
__forceinline const char* vertexPtr(size_t i, size_t itime) const {
return vertices[itime].getPtr(i);
}
/*! returns i'th normal of itime'th timestep */
__forceinline Vec3fa normal(size_t i, size_t itime) const {
return normals[itime][i];
}
/*! returns i'th radius of itime'th timestep */
__forceinline float radius(size_t i, size_t itime) const {
return vertices[itime][i].w;
}
/*! calculates bounding box of i'th line segment */
__forceinline BBox3fa bounds(const Vec3ff& v0) const {
return enlarge(BBox3fa(v0), maxRadiusScale*Vec3fa(v0.w));
}
/*! calculates bounding box of i'th line segment */
__forceinline BBox3fa bounds(size_t i) const
{
const Vec3ff v0 = vertex(i);
return bounds(v0);
}
/*! calculates bounding box of i'th line segment for the itime'th time step */
__forceinline BBox3fa bounds(size_t i, size_t itime) const
{
const Vec3ff v0 = vertex(i, itime);
return bounds(v0);
}
/*! calculates bounding box of i'th line segment */
__forceinline BBox3fa bounds(const LinearSpace3fa& space, size_t i) const
{
const Vec3ff v0 = vertex(i);
const Vec3ff w0(xfmVector(space, (Vec3fa)v0), v0.w);
return bounds(w0);
}
/*! calculates bounding box of i'th line segment for the itime'th time step */
__forceinline BBox3fa bounds(const LinearSpace3fa& space, size_t i, size_t itime) const
{
const Vec3ff v0 = vertex(i, itime);
const Vec3ff w0(xfmVector(space, (Vec3fa)v0), v0.w);
return bounds(w0);
}
/*! check if the i'th primitive is valid at the itime'th timestep */
__forceinline bool valid(size_t i, size_t itime) const {
return valid(i, make_range(itime, itime));
}
/*! check if the i'th primitive is valid between the specified time range */
__forceinline bool valid(size_t i, const range<size_t>& itime_range) const
{
const unsigned int index = (unsigned int)i;
if (index >= numVertices())
return false;
for (size_t itime = itime_range.begin(); itime <= itime_range.end(); itime++) {
const Vec3ff v0 = vertex(index + 0, itime);
if (unlikely(!isvalid4(v0)))
return false;
if (v0.w < 0.0f)
return false;
}
return true;
}
/*! calculates the linear bounds of the i'th primitive at the itimeGlobal'th time segment */
__forceinline LBBox3fa linearBounds(size_t i, size_t itime) const {
return LBBox3fa(bounds(i, itime + 0), bounds(i, itime + 1));
}
/*! calculates the build bounds of the i'th primitive, if it's valid */
__forceinline bool buildBounds(size_t i, BBox3fa* bbox) const
{
if (!valid(i, 0))
return false;
*bbox = bounds(i);
return true;
}
/*! calculates the build bounds of the i'th primitive at the itime'th time segment, if it's valid */
__forceinline bool buildBounds(size_t i, size_t itime, BBox3fa& bbox) const
{
if (!valid(i, itime + 0) || !valid(i, itime + 1))
return false;
bbox = bounds(i, itime); // use bounds of first time step in builder
return true;
}
/*! calculates the linear bounds of the i'th primitive for the specified time range */
__forceinline LBBox3fa linearBounds(size_t primID, const BBox1f& dt) const {
return LBBox3fa([&](size_t itime) { return bounds(primID, itime); }, dt, time_range, fnumTimeSegments);
}
/*! calculates the linear bounds of the i'th primitive for the specified time range */
__forceinline LBBox3fa linearBounds(const LinearSpace3fa& space, size_t primID, const BBox1f& dt) const {
return LBBox3fa([&](size_t itime) { return bounds(space, primID, itime); }, dt, time_range, fnumTimeSegments);
}
/*! calculates the linear bounds of the i'th primitive for the specified time range */
__forceinline bool linearBounds(size_t i, const BBox1f& time_range, LBBox3fa& bbox) const
{
if (!valid(i, timeSegmentRange(time_range))) return false;
bbox = linearBounds(i, time_range);
return true;
}
/*! get fast access to first vertex buffer */
__forceinline float * getCompactVertexArray () const {
return (float*) vertices0.getPtr();
}
public:
BufferView<Vec3ff> vertices0; //!< fast access to first vertex buffer
BufferView<Vec3fa> normals0; //!< fast access to first normal buffer
vector<BufferView<Vec3ff>> vertices; //!< vertex array for each timestep
vector<BufferView<Vec3fa>> normals; //!< normal array for each timestep
vector<BufferView<char>> vertexAttribs; //!< user buffers
float maxRadiusScale = 1.0; //!< maximal min-width scaling of curve radii
};
namespace isa
{
struct PointsISA : public Points
{
PointsISA(Device* device, Geometry::GType gtype) : Points(device, gtype) {}
Vec3fa computeDirection(unsigned int primID) const
{
return Vec3fa(1, 0, 0);
}
Vec3fa computeDirection(unsigned int primID, size_t time) const
{
return Vec3fa(1, 0, 0);
}
PrimInfo createPrimRefArray(mvector<PrimRef>& prims, const range<size_t>& r, size_t k, unsigned int geomID) const
{
PrimInfo pinfo(empty);
for (size_t j = r.begin(); j < r.end(); j++) {
BBox3fa bounds = empty;
if (!buildBounds(j, &bounds))
continue;
const PrimRef prim(bounds, geomID, unsigned(j));
pinfo.add_center2(prim);
prims[k++] = prim;
}
return pinfo;
}
PrimInfo createPrimRefArrayMB(mvector<PrimRef>& prims, size_t itime, const range<size_t>& r, size_t k, unsigned int geomID) const
{
PrimInfo pinfo(empty);
for (size_t j = r.begin(); j < r.end(); j++) {
BBox3fa bounds = empty;
if (!buildBounds(j, itime, bounds))
continue;
const PrimRef prim(bounds, geomID, unsigned(j));
pinfo.add_center2(prim);
prims[k++] = prim;
}
return pinfo;
}
PrimInfoMB createPrimRefMBArray(mvector<PrimRefMB>& prims,
const BBox1f& t0t1,
const range<size_t>& r,
size_t k,
unsigned int geomID) const
{
PrimInfoMB pinfo(empty);
for (size_t j = r.begin(); j < r.end(); j++) {
if (!valid(j, timeSegmentRange(t0t1)))
continue;
const PrimRefMB prim(linearBounds(j, t0t1), this->numTimeSegments(), this->time_range, this->numTimeSegments(), geomID, unsigned(j));
pinfo.add_primref(prim);
prims[k++] = prim;
}
return pinfo;
}
BBox3fa vbounds(size_t i) const
{
return bounds(i);
}
BBox3fa vbounds(const LinearSpace3fa& space, size_t i) const
{
return bounds(space, i);
}
LBBox3fa vlinearBounds(size_t primID, const BBox1f& time_range) const
{
return linearBounds(primID, time_range);
}
LBBox3fa vlinearBounds(const LinearSpace3fa& space, size_t primID, const BBox1f& time_range) const
{
return linearBounds(space, primID, time_range);
}
};
} // namespace isa
DECLARE_ISA_FUNCTION(Points*, createPoints, Device* COMMA Geometry::GType);
} // namespace embree
|