traversal_recurse.cpp 10.8 KB
Newer Older
sachinc's avatar
sachinc committed
1
2
3
/*
 * Software License Agreement (BSD License)
 *
4
5
 *  Copyright (c) 2011-2014, Willow Garage, Inc.
 *  Copyright (c) 2014-2015, Open Source Robotics Foundation
sachinc's avatar
sachinc committed
6
7
8
9
10
11
12
13
14
15
16
17
 *  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.
 *   * Redistributions in binary form must reproduce the above
 *     copyright notice, this list of conditions and the following
 *     disclaimer in the documentation and/or other materials provided
 *     with the distribution.
18
 *   * Neither the name of Open Source Robotics Foundation nor the names of its
sachinc's avatar
sachinc committed
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
 *     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 AND CONTRIBUTORS
 *  "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.
 */

/** \author Jia Pan */


jpan's avatar
jpan committed
39
#include "fcl/traversal/traversal_recurse.h"
sachinc's avatar
sachinc committed
40
41
42

namespace fcl
{
43
44
void collisionRecurse(CollisionTraversalNodeBase* node, int b1, int b2, 
		      BVHFrontList* front_list, FCL_REAL& sqrDistLowerBound)
sachinc's avatar
sachinc committed
45
{
46
  FCL_REAL sqrDistLowerBound1 = 0, sqrDistLowerBound2 = 0;
sachinc's avatar
sachinc committed
47
48
49
50
51
52
  bool l1 = node->isFirstNodeLeaf(b1);
  bool l2 = node->isSecondNodeLeaf(b2);
  if(l1 && l2)
  {
    updateFrontList(front_list, b1, b2);

53
54
55
56
57
    if (node->enable_distance_lower_bound) {
      if(node->BVTesting(b1, b2, sqrDistLowerBound)) return;
    } else {
      if(node->BVTesting(b1, b2)) return;
    }
sachinc's avatar
sachinc committed
58

59
    node->leafTesting(b1, b2, sqrDistLowerBound);
sachinc's avatar
sachinc committed
60
61
62
    return;
  }

63
64
65
66
67
68
69
70
71
72
  if (node->enable_distance_lower_bound) {
    if(node->BVTesting(b1, b2, sqrDistLowerBound)) {
      updateFrontList(front_list, b1, b2);
      return;
    }
  } else {
    if(node->BVTesting(b1, b2)) {
      updateFrontList(front_list, b1, b2);
      return;
    }
sachinc's avatar
sachinc committed
73
74
75
76
77
78
  }
  if(node->firstOverSecond(b1, b2))
  {
    int c1 = node->getFirstLeftChild(b1);
    int c2 = node->getFirstRightChild(b1);

79
    collisionRecurse(node, c1, b2, front_list, sqrDistLowerBound1);
sachinc's avatar
sachinc committed
80
81
82
83

    // early stop is disabled is front_list is used
    if(node->canStop() && !front_list) return;

84
85
    collisionRecurse(node, c2, b2, front_list, sqrDistLowerBound2);
    sqrDistLowerBound = std::min (sqrDistLowerBound1, sqrDistLowerBound2);
sachinc's avatar
sachinc committed
86
87
88
89
90
91
  }
  else
  {
    int c1 = node->getSecondLeftChild(b2);
    int c2 = node->getSecondRightChild(b2);

92
    collisionRecurse(node, b1, c1, front_list, sqrDistLowerBound1);
sachinc's avatar
sachinc committed
93
94
95
96

    // early stop is disabled is front_list is used
    if(node->canStop() && !front_list) return;

97
98
    collisionRecurse(node, b1, c2, front_list, sqrDistLowerBound2);
    sqrDistLowerBound = std::min (sqrDistLowerBound1, sqrDistLowerBound2);
sachinc's avatar
sachinc committed
99
100
101
  }
}

102
103
104
void collisionRecurse(MeshCollisionTraversalNodeOBB* node, int b1, int b2,
		      const Matrix3f& R, const Vec3f& T,
		      BVHFrontList* front_list)
jpan's avatar
   
jpan committed
105
{
106
  throw std::runtime_error ("Not implemented.");
jpan's avatar
   
jpan committed
107
108
109
110
}

void collisionRecurse(MeshCollisionTraversalNodeRSS* node, int b1, int b2, const Matrix3f& R, const Vec3f& T, BVHFrontList* front_list)
{
111
  throw std::runtime_error ("Not implemented.");
jpan's avatar
   
jpan committed
112
113
}

sachinc's avatar
sachinc committed
114
115
116
117
118
/** Recurse function for self collision
 * Make sure node is set correctly so that the first and second tree are the same
 */
void selfCollisionRecurse(CollisionTraversalNodeBase* node, int b, BVHFrontList* front_list)
{
119
  FCL_REAL sqrDistLowerBound;
sachinc's avatar
sachinc committed
120
121
122
123
124
125
126
127
  bool l = node->isFirstNodeLeaf(b);

  if(l) return;

  int c1 = node->getFirstLeftChild(b);
  int c2 = node->getFirstRightChild(b);

  selfCollisionRecurse(node, c1, front_list);
jpan's avatar
jpan committed
128
  if(node->canStop() && !front_list) return;
sachinc's avatar
sachinc committed
129
130

  selfCollisionRecurse(node, c2, front_list);
jpan's avatar
jpan committed
131
  if(node->canStop() && !front_list) return;
sachinc's avatar
sachinc committed
132

133
  collisionRecurse(node, c1, c2, front_list, sqrDistLowerBound);
sachinc's avatar
sachinc committed
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
}

void distanceRecurse(DistanceTraversalNodeBase* node, int b1, int b2, BVHFrontList* front_list)
{
  bool l1 = node->isFirstNodeLeaf(b1);
  bool l2 = node->isSecondNodeLeaf(b2);

  if(l1 && l2)
  {
    updateFrontList(front_list, b1, b2);

    node->leafTesting(b1, b2);
    return;
  }

  int a1, a2, c1, c2;

  if(node->firstOverSecond(b1, b2))
  {
    a1 = node->getFirstLeftChild(b1);
    a2 = b2;
    c1 = node->getFirstRightChild(b1);
    c2 = b2;
  }
  else
  {
    a1 = b1;
    a2 = node->getSecondLeftChild(b2);
    c1 = b1;
    c2 = node->getSecondRightChild(b2);
  }

166
167
  FCL_REAL d1 = node->BVTesting(a1, a2);
  FCL_REAL d2 = node->BVTesting(c1, c2);
sachinc's avatar
sachinc committed
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

  if(d2 < d1)
  {
    if(!node->canStop(d2))
      distanceRecurse(node, c1, c2, front_list);
    else
      updateFrontList(front_list, c1, c2);

    if(!node->canStop(d1))
      distanceRecurse(node, a1, a2, front_list);
    else
      updateFrontList(front_list, a1, a2);
  }
  else
  {
    if(!node->canStop(d1))
      distanceRecurse(node, a1, a2, front_list);
    else
      updateFrontList(front_list, a1, a2);

    if(!node->canStop(d2))
      distanceRecurse(node, c1, c2, front_list);
    else
      updateFrontList(front_list, c1, c2);
  }
}


/** \brief Bounding volume test structure */
struct BVT
{
  /** \brief distance between bvs */
200
  FCL_REAL d;
sachinc's avatar
sachinc committed
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

  /** \brief bv indices for a pair of bvs in two models */
  int b1, b2;
};

/** \brief Comparer between two BVT */
struct BVT_Comparer
{
  bool operator() (const BVT& lhs, const BVT& rhs) const
  {
    return lhs.d > rhs.d;
  }
};

struct BVTQ
{
  BVTQ() : qsize(2) {}

  bool empty() const
  {
    return pq.empty();
  }

  size_t size() const
  {
    return pq.size();
  }

  const BVT& top() const
  {
    return pq.top();
  }

  void push(const BVT& x)
  {
    pq.push(x);
  }

  void pop()
  {
    pq.pop();
  }

  bool full() const
  {
jpan's avatar
jpan committed
246
    return (pq.size() + 1 >= qsize);
sachinc's avatar
sachinc committed
247
248
249
250
251
  }

  std::priority_queue<BVT, std::vector<BVT>, BVT_Comparer> pq;

  /** \brief Queue size */
252
  unsigned int qsize;
sachinc's avatar
sachinc committed
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
};


void distanceQueueRecurse(DistanceTraversalNodeBase* node, int b1, int b2, BVHFrontList* front_list, int qsize)
{
  BVTQ bvtq;
  bvtq.qsize = qsize;

  BVT min_test;
  min_test.b1 = b1;
  min_test.b2 = b2;

  while(1)
  {
    bool l1 = node->isFirstNodeLeaf(min_test.b1);
    bool l2 = node->isSecondNodeLeaf(min_test.b2);

    if(l1 && l2)
    {
      updateFrontList(front_list, min_test.b1, min_test.b2);

      node->leafTesting(min_test.b1, min_test.b2);
    }
    else if(bvtq.full())
    {
      // queue should not get two more tests, recur

      distanceQueueRecurse(node, min_test.b1, min_test.b2, front_list, qsize);
    }
    else
    {
      // queue capacity is not full yet
      BVT bvt1, bvt2;

      if(node->firstOverSecond(min_test.b1, min_test.b2))
      {
        int c1 = node->getFirstLeftChild(min_test.b1);
        int c2 = node->getFirstRightChild(min_test.b1);
        bvt1.b1 = c1;
        bvt1.b2 = min_test.b2;
        bvt1.d = node->BVTesting(bvt1.b1, bvt1.b2);

        bvt2.b1 = c2;
        bvt2.b2 = min_test.b2;
        bvt2.d = node->BVTesting(bvt2.b1, bvt2.b2);
      }
      else
      {
        int c1 = node->getSecondLeftChild(min_test.b2);
        int c2 = node->getSecondRightChild(min_test.b2);
        bvt1.b1 = min_test.b1;
        bvt1.b2 = c1;
        bvt1.d = node->BVTesting(bvt1.b1, bvt1.b2);

        bvt2.b1 = min_test.b1;
        bvt2.b2 = c2;
        bvt2.d = node->BVTesting(bvt2.b1, bvt2.b2);
      }

      bvtq.push(bvt1);
      bvtq.push(bvt2);
    }

    if(bvtq.empty())
      break;
    else
    {
      min_test = bvtq.top();
      bvtq.pop();

      if(node->canStop(min_test.d))
      {
        updateFrontList(front_list, min_test.b1, min_test.b2);
        break;
      }
    }
  }
}

332
333
334
void propagateBVHFrontListCollisionRecurse
(CollisionTraversalNodeBase* node, BVHFrontList* front_list,
 FCL_REAL& sqrDistLowerBound)
sachinc's avatar
sachinc committed
335
{
336
  FCL_REAL sqrDistLowerBound1 = 0, sqrDistLowerBound2 = 0;
sachinc's avatar
sachinc committed
337
338
339
340
341
342
343
344
345
346
347
348
  BVHFrontList::iterator front_iter;
  BVHFrontList append;
  for(front_iter = front_list->begin(); front_iter != front_list->end(); ++front_iter)
  {
    int b1 = front_iter->left;
    int b2 = front_iter->right;
    bool l1 = node->isFirstNodeLeaf(b1);
    bool l2 = node->isSecondNodeLeaf(b2);

    if(l1 & l2)
    {
      front_iter->valid = false; // the front node is no longer valid, in collideRecurse will add again.
349
      collisionRecurse(node, b1, b2, &append, sqrDistLowerBound);
sachinc's avatar
sachinc committed
350
351
352
    }
    else
    {
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
      if (node->enable_distance_lower_bound) {
	if(!node->BVTesting(b1, b2, sqrDistLowerBound)) {
	  front_iter->valid = false;
	  if(node->firstOverSecond(b1, b2)) {
	    int c1 = node->getFirstLeftChild(b1);
	    int c2 = node->getFirstRightChild(b2);

	    collisionRecurse(node, c1, b2, front_list, sqrDistLowerBound1);
	    collisionRecurse(node, c2, b2, front_list, sqrDistLowerBound2);
	    sqrDistLowerBound = std::min (sqrDistLowerBound1,
					  sqrDistLowerBound2);
	  } else {
	    int c1 = node->getSecondLeftChild(b2);
	    int c2 = node->getSecondRightChild(b2);
	
	    collisionRecurse(node, b1, c1, front_list, sqrDistLowerBound1);
	    collisionRecurse(node, b1, c2, front_list, sqrDistLowerBound2);
	    sqrDistLowerBound = std::min (sqrDistLowerBound1,
					  sqrDistLowerBound2);
	  }
	}
      } else {
	if(!node->BVTesting(b1, b2)) {
	  front_iter->valid = false;
	  if(node->firstOverSecond(b1, b2)) {
	    int c1 = node->getFirstLeftChild(b1);
	    int c2 = node->getFirstRightChild(b2);

	    collisionRecurse(node, c1, b2, front_list, sqrDistLowerBound1);
	    collisionRecurse(node, c2, b2, front_list, sqrDistLowerBound2);
	    sqrDistLowerBound = std::min (sqrDistLowerBound1,
					  sqrDistLowerBound2);
	  } else {
	    int c1 = node->getSecondLeftChild(b2);
	    int c2 = node->getSecondRightChild(b2);
	
	    collisionRecurse(node, b1, c1, front_list, sqrDistLowerBound1);
	    collisionRecurse(node, b1, c2, front_list, sqrDistLowerBound2);
	    sqrDistLowerBound = std::min (sqrDistLowerBound1,
					  sqrDistLowerBound2);
	  }
	}
sachinc's avatar
sachinc committed
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
      }
    }
  }


  // clean the old front list (remove invalid node)
  for(front_iter = front_list->begin(); front_iter != front_list->end();)
  {
    if(!front_iter->valid)
      front_iter = front_list->erase(front_iter);
    else
      ++front_iter;
  }

  for(front_iter = append.begin(); front_iter != append.end(); ++front_iter)
  {
    front_list->push_back(*front_iter);
  }
}


}