mesh_conservative_advancement_traversal_node.h

/*
 * Software License Agreement (BSD License)
 *
 *  Copyright (c) 2011-2014, Willow Garage, Inc.
 *  Copyright (c) 2014-2016, Open Source Robotics Foundation
 *  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.
 *   * Neither the name of Open Source Robotics Foundation nor the names 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 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.
 */

#ifndef FCL_TRAVERSAL_MESHCONSERVATIVEADVANCEMENTTRAVERSALNODE_H
#define FCL_TRAVERSAL_MESHCONSERVATIVEADVANCEMENTTRAVERSALNODE_H

#include "fcl/math/motion/tbv_motion_bound_visitor.h"
#include "fcl/narrowphase/detail/traversal/distance/mesh_distance_traversal_node.h"
#include "fcl/narrowphase/detail/traversal/distance/conservative_advancement_stack_data.h"

namespace fcl
{

namespace detail
{

template <typename BV>
class MeshConservativeAdvancementTraversalNode
    : public MeshDistanceTraversalNode<BV>
{
public:

  using S = typename BV::S;

  MeshConservativeAdvancementTraversalNode(S w_ = 1);

  S BVTesting(int b1, int b2) const;

  void leafTesting(int b1, int b2) const;

  bool canStop(S c) const;

  mutable S min_distance;
 
  mutable Vector3<S> closest_p1, closest_p2;
  
  mutable int last_tri_id1, last_tri_id2;

  S w;

  S toc;
  S t_err;

  mutable S delta_t;

  const MotionBase<S>* motion1;
  const MotionBase<S>* motion2;

  mutable std::vector<ConservativeAdvancementStackData<S>> stack;

  template <typename, typename>
  friend struct CanStopImpl;
};

template <typename BV>
bool initialize(
    MeshConservativeAdvancementTraversalNode<BV>& node,
    BVHModel<BV>& model1,
    const Transform3<typename BV::S>& tf1,
    BVHModel<BV>& model2,
    const Transform3<typename BV::S>& tf2,
    typename BV::S w = 1,
    bool use_refit = false,
    bool refit_bottomup = false);

template <typename S>
class MeshConservativeAdvancementTraversalNodeRSS
    : public MeshConservativeAdvancementTraversalNode<RSS<S>>
{
public:
  MeshConservativeAdvancementTraversalNodeRSS(S w_ = 1);

  S BVTesting(int b1, int b2) const
  {
    if (this->enable_statistics)
      this->num_bv_tests++;

    Vector3<S> P1, P2;
    S d = distance(
        R,
        T,
        this->model1->getBV(b1).bv,
        this->model2->getBV(b2).bv,
        &P1,
        &P2);

    this->stack.emplace_back(P1, P2, b1, b2, d);

    return d;
  }

  void leafTesting(int b1, int b2) const;

  bool canStop(S c) const;

  Matrix3<S> R;
  Vector3<S> T;

  EIGEN_MAKE_ALIGNED_OPERATOR_NEW
};

using MeshConservativeAdvancementTraversalNodeRSSf = MeshConservativeAdvancementTraversalNodeRSS<float>;
using MeshConservativeAdvancementTraversalNodeRSSd = MeshConservativeAdvancementTraversalNodeRSS<double>;

template <typename S>
bool initialize(
    MeshConservativeAdvancementTraversalNodeRSS<S>& node,
    const BVHModel<RSS<S>>& model1,
    const Transform3<S>& tf1,
    const BVHModel<RSS<S>>& model2,
    const Transform3<S>& tf2,
    S w = 1);

template <typename S>
class MeshConservativeAdvancementTraversalNodeOBBRSS
    : public MeshConservativeAdvancementTraversalNode<OBBRSS<S>>
{
public:
  MeshConservativeAdvancementTraversalNodeOBBRSS(S w_ = 1);

  S BVTesting(int b1, int b2) const
  {
    if (this->enable_statistics)
      this->num_bv_tests++;

    Vector3<S> P1, P2;
    S d = distance(
        R,
        T,
        this->model1->getBV(b1).bv,
        this->model2->getBV(b2).bv,
        &P1,
        &P2);

    this->stack.emplace_back(P1, P2, b1, b2, d);

    return d;
  }

  void leafTesting(int b1, int b2) const;

  bool canStop(S c) const;

  Matrix3<S> R;
  Vector3<S> T;

  EIGEN_MAKE_ALIGNED_OPERATOR_NEW
};

using MeshConservativeAdvancementTraversalNodeOBBRSSf = MeshConservativeAdvancementTraversalNodeOBBRSS<float>;
using MeshConservativeAdvancementTraversalNodeOBBRSSd = MeshConservativeAdvancementTraversalNodeOBBRSS<double>;

template <typename S>
bool initialize(
    MeshConservativeAdvancementTraversalNodeOBBRSS<S>& node,
    const BVHModel<OBBRSS<S>>& model1,
    const Transform3<S>& tf1,
    const BVHModel<OBBRSS<S>>& model2,
    const Transform3<S>& tf2,
    S w = 1);

template <typename S, typename BV>
const Vector3<S> getBVAxis(const BV& bv, int i);

template <typename BV>
bool meshConservativeAdvancementTraversalNodeCanStop(
    typename BV::S c,
    typename BV::S min_distance,
    typename BV::S abs_err,
    typename BV::S rel_err,
    typename BV::S w,
    const BVHModel<BV>* model1,
    const BVHModel<BV>* model2,
    const MotionBase<typename BV::S>* motion1,
    const MotionBase<typename BV::S>* motion2,
    std::vector<ConservativeAdvancementStackData<typename BV::S>>& stack,
    typename BV::S& delta_t);

template <typename BV>
bool meshConservativeAdvancementOrientedNodeCanStop(
    typename BV::S c,
    typename BV::S min_distance,
    typename BV::S abs_err,
    typename BV::S rel_err,
    typename BV::S w,
    const BVHModel<BV>* model1,
    const BVHModel<BV>* model2,
    const MotionBase<typename BV::S>* motion1,
    const MotionBase<typename BV::S>* motion2,
    std::vector<ConservativeAdvancementStackData<typename BV::S>>& stack,
    typename BV::S& delta_t);

template <typename BV>
void meshConservativeAdvancementOrientedNodeLeafTesting(
    int b1,
    int b2,
    const BVHModel<BV>* model1,
    const BVHModel<BV>* model2,
    const Triangle* tri_indices1,
    const Triangle* tri_indices2,
    const Vector3<typename BV::S>* vertices1,
    const Vector3<typename BV::S>* vertices2,
    const Matrix3<typename BV::S>& R,
    const Vector3<typename BV::S>& T,
    const MotionBase<typename BV::S>* motion1,
    const MotionBase<typename BV::S>* motion2,
    bool enable_statistics,
    typename BV::S& min_distance,
    Vector3<typename BV::S>& p1,
    Vector3<typename BV::S>& p2,
    int& last_tri_id1,
    int& last_tri_id2,
    typename BV::S& delta_t,
    int& num_leaf_tests);

} // namespace detail
} // namespace fcl

#include "fcl/narrowphase/detail/traversal/distance/mesh_conservative_advancement_traversal_node-inl.h"

#endif