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
|
// This code contains NVIDIA Confidential Information and is disclosed to you
// under a form of NVIDIA software license agreement provided separately to you.
//
// Notice
// NVIDIA Corporation and its licensors retain all intellectual property and
// proprietary rights in and to this software and related documentation and
// any modifications thereto. Any use, reproduction, disclosure, or
// distribution of this software and related documentation without an express
// license agreement from NVIDIA Corporation is strictly prohibited.
//
// ALL NVIDIA DESIGN SPECIFICATIONS, CODE ARE PROVIDED "AS IS.". NVIDIA MAKES
// NO WARRANTIES, EXPRESSED, IMPLIED, STATUTORY, OR OTHERWISE WITH RESPECT TO
// THE MATERIALS, AND EXPRESSLY DISCLAIMS ALL IMPLIED WARRANTIES OF NONINFRINGEMENT,
// MERCHANTABILITY, AND FITNESS FOR A PARTICULAR PURPOSE.
//
// Information and code furnished is believed to be accurate and reliable.
// However, NVIDIA Corporation assumes no responsibility for the consequences of use of such
// information or for any infringement of patents or other rights of third parties that may
// result from its use. No license is granted by implication or otherwise under any patent
// or patent rights of NVIDIA Corporation. Details are subject to change without notice.
// This code supersedes and replaces all information previously supplied.
// NVIDIA Corporation products are not authorized for use as critical
// components in life support devices or systems without express written approval of
// NVIDIA Corporation.
//
// Copyright (c) 2016-2018 NVIDIA Corporation. All rights reserved.
#ifndef NVBLASTEXTAUTHORINGACCELERATOR_H
#define NVBLASTEXTAUTHORINGACCELERATOR_H
#include <set>
#include <vector>
#include "NvBlastExtAuthoringTypes.h"
namespace Nv
{
namespace Blast
{
class Mesh;
/**
Acceleration structure interface.
*/
class SpatialAccelerator
{
public:
/**
Set state of accelerator to return all facets which possibly can intersect given facet.
\param[in] pos Vertex buffer
\param[in] ed Edge buffer
\param[in] fc Facet which should be tested.
*/
virtual void setState(const Vertex* pos, const Edge* ed, const Facet& fc) = 0;
/**
Set state of accelerator to return all facets which possibly can cover given point. Needed for testing whether point is inside mesh.
\param[in] point Point which should be tested.
*/
virtual void setState(const physx::PxVec3& point) = 0;
/**
Recieve next facet for setted state.
\return Next facet index, or -1 if no facets left.
*/
virtual int32_t getNextFacet() = 0;
virtual ~SpatialAccelerator() {};
};
/**
Dummy accelerator iterates through all facets of mesh.
*/
class DummyAccelerator : public SpatialAccelerator
{
public:
/**
\param[in] count Mesh facets count for which accelerator should be built.
*/
DummyAccelerator(int32_t count);
virtual void setState(const Vertex* pos, const Edge* ed, const Facet& fc);
virtual void setState(const physx::PxVec3& point);
virtual int32_t getNextFacet();
private:
int32_t count;
int32_t current;
};
struct SegmentToIndex
{
float coord;
uint32_t index;
bool end;
SegmentToIndex(float c, uint32_t i, bool end) : coord(c), index(i), end(end) {};
bool operator<(const SegmentToIndex& in) const
{
if (coord < in.coord) return true;
if (coord > in.coord) return false;
return end < in.end;
}
};
class SweepingAccelerator : public SpatialAccelerator
{
public:
/**
\param[in] count Mesh facets count for which accelerator should be built.
*/
SweepingAccelerator(Nv::Blast::Mesh* in);
virtual void setState(const Vertex* pos, const Edge* ed, const Facet& fc);
virtual void setState(const physx::PxVec3& point);
virtual int32_t getNextFacet();
private:
/*
For fast point test.
*/
std::vector<std::vector<uint32_t> > xSegm;
std::vector<std::vector<uint32_t> > ySegm;
std::vector<std::vector<uint32_t> > zSegm;
std::vector<uint32_t> indices;
std::vector<uint32_t> foundx;
std::vector<uint32_t> foundy;
uint32_t iterId;
int32_t current;
uint32_t facetCount;
physx::PxVec3 minimal;
physx::PxVec3 maximal;
physx::PxVec3 rescale;
};
/**
Accelerator which builds map from 3d grid to initial mesh facets.
To find all facets which possibly intersect given one, it return all facets which are pointed by grid cells, which intersects with bounding box of given facet.
To find all facets which possibly cover given point, all facets which are pointed by cells in column which contains given point are returned.
*/
class BBoxBasedAccelerator : public SpatialAccelerator
{
public:
/**
\param[in] mesh Mesh for which acceleration structure should be built.
\param[in] resolution Resolution on 3d grid.
*/
BBoxBasedAccelerator(const Mesh* mesh, int32_t resolution);
virtual ~BBoxBasedAccelerator();
int32_t getNextFacet();
void setState(const Vertex* pos, const Edge* ed, const Facet& fc);
void setState(const physx::PxVec3& p);
private:
bool testCellPolygonIntersection(int32_t cellId, physx::PxBounds3& facetBB);
void buildAccelStructure(const Vertex* pos, const Edge* edges, const Facet* fc, int32_t facetCount);
int32_t mResolution;
physx::PxBounds3 mBounds;
physx::PxBounds3 facetBox;
std::vector< std::vector<int32_t> > mSpatialMap;
std::vector<physx::PxBounds3> mCells;
// Iterator data
std::vector<uint32_t> alreadyGotFlag;
uint32_t alreadyGotValue;
std::vector<int32_t> cellList;
int32_t mIteratorCell;
int32_t mIteratorFacet;
};
/**
Accelerator which builds map from 3d grid to initial mesh facets.
To find all facets which possibly intersect given one, it return all facets which are pointed by grid cells, which are intersected by given facet.
To find all facets which possibly cover given point, all facets which are pointed by cells in column which contains given point are returned.
In difference with BBoxBasedAccelerator this accelerator computes actual intersection of cube with polygon. It is more precise and omits much more intersections but slower.
*/
class IntersectionTestingAccelerator : public SpatialAccelerator
{
public:
IntersectionTestingAccelerator(const Mesh* mesh, int32_t resolution);
int32_t getNextFacet();
void setState(const Vertex* pos, const Edge* ed, const Facet& fc);
void setState(const physx::PxVec3& p);
private:
std::vector< std::vector<int32_t> > mSpatialMap;
std::vector<physx::PxBounds3> mCubes;
int32_t mResolution;
// Iterator data
std::vector<uint32_t> alreadyGotFlag;
uint32_t alreadyGotValue;
std::vector<int32_t> cellList;
int32_t mIteratorCell;
int32_t mIteratorFacet;
};
} // namespace Blast
} // namsepace Nv
#endif // ifndef NVBLASTEXTAUTHORINGACCELERATOR_H
|