coal 3.0.1
Coal, The Collision Detection Library. Previously known as HPP-FCL, fork of FCL -- The Flexible Collision Library
Loading...
Searching...
No Matches
RSS.h
Go to the documentation of this file.
1/*
2 * Software License Agreement (BSD License)
3 *
4 * Copyright (c) 2011-2014, Willow Garage, Inc.
5 * Copyright (c) 2014-2015, Open Source Robotics Foundation
6 * All rights reserved.
7 *
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
10 * are met:
11 *
12 * * Redistributions of source code must retain the above copyright
13 * notice, this list of conditions and the following disclaimer.
14 * * Redistributions in binary form must reproduce the above
15 * copyright notice, this list of conditions and the following
16 * disclaimer in the documentation and/or other materials provided
17 * with the distribution.
18 * * Neither the name of Open Source Robotics Foundation nor the names of its
19 * contributors may be used to endorse or promote products derived
20 * from this software without specific prior written permission.
21 *
22 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
23 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
24 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
25 * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
26 * COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
27 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
28 * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
29 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
30 * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
31 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
32 * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
33 * POSSIBILITY OF SUCH DAMAGE.
34 */
35
38#ifndef COAL_RSS_H
39#define COAL_RSS_H
40
41#include "coal/data_types.h"
42
43#include <boost/math/constants/constants.hpp>
44
45namespace coal {
46
47struct CollisionRequest;
48
51
54 EIGEN_MAKE_ALIGNED_OPERATOR_NEW
55
62
65
67 Scalar length[2];
68
71
73 RSS() : axes(Matrix3s::Zero()), Tr(Vec3s::Zero()), radius(-1) {
74 length[0] = 0;
75 length[1] = 0;
76 }
77
79 bool operator==(const RSS& other) const {
80 return axes == other.axes && Tr == other.Tr &&
81 length[0] == other.length[0] && length[1] == other.length[1] &&
82 radius == other.radius;
83 }
84
86 bool operator!=(const RSS& other) const { return !(*this == other); }
87
89 bool contain(const Vec3s& p) const;
90
92 bool overlap(const RSS& other) const;
93
95 bool overlap(const RSS& other, const CollisionRequest&,
96 Scalar& sqrDistLowerBound) const {
97 sqrDistLowerBound = std::numeric_limits<Scalar>::quiet_NaN();
98 return overlap(other);
99 }
100
103 Scalar distance(const RSS& other, Vec3s* P = NULL, Vec3s* Q = NULL) const;
104
107 RSS& operator+=(const Vec3s& p);
108
110 inline RSS& operator+=(const RSS& other) {
111 *this = *this + other;
112 return *this;
113 }
114
116 RSS operator+(const RSS& other) const;
117
119 inline Scalar size() const {
120 return (std::sqrt(length[0] * length[0] + length[1] * length[1]) +
121 2 * radius);
122 }
123
125 inline const Vec3s& center() const { return Tr; }
126
128 inline Scalar width() const { return length[0] + 2 * radius; }
129
131 inline Scalar height() const { return length[1] + 2 * radius; }
132
134 inline Scalar depth() const { return 2 * radius; }
135
137 inline Scalar volume() const {
138 return (length[0] * length[1] * 2 * radius +
139 4 * boost::math::constants::pi<Scalar>() * radius * radius *
140 radius);
141 }
142
146 bool overlap(const RSS& other, RSS& /*overlap_part*/) const {
147 return overlap(other);
148 }
149};
150
// end of Bounding_Volume
152
158COAL_DLLAPI Scalar distance(const Matrix3s& R0, const Vec3s& T0, const RSS& b1,
159 const RSS& b2, Vec3s* P = NULL, Vec3s* Q = NULL);
160
163COAL_DLLAPI bool overlap(const Matrix3s& R0, const Vec3s& T0, const RSS& b1,
164 const RSS& b2);
165
168COAL_DLLAPI bool overlap(const Matrix3s& R0, const Vec3s& T0, const RSS& b1,
169 const RSS& b2, const CollisionRequest& request,
170 Scalar& sqrDistLowerBound);
171
172} // namespace coal
173
174#endif
#define COAL_DLLAPI
Definition config.hh:88
Main namespace.
Definition broadphase_bruteforce.h:44
Scalar distance(const Matrix3s &R0, const Vec3s &T0, const kIOS &b1, const kIOS &b2, Vec3s *P=NULL, Vec3s *Q=NULL)
Approximate distance between two kIOS bounding volumes.
bool overlap(const Matrix3s &R0, const Vec3s &T0, const AABB &b1, const AABB &b2)
Check collision between two aabbs, b1 is in configuration (R0, T0) and b2 is in identity.
Eigen::Matrix< Scalar, 3, 1 > Vec3s
Definition data_types.h:70
double Scalar
Definition data_types.h:68
Eigen::Matrix< Scalar, 3, 3 > Matrix3s
Definition data_types.h:74
request to the collision algorithm
Definition collision_data.h:311
A class for rectangle sphere-swept bounding volume.
Definition RSS.h:53
RSS & operator+=(const RSS &other)
Merge the RSS and another RSS.
Definition RSS.h:110
EIGEN_MAKE_ALIGNED_OPERATOR_NEW Matrix3s axes
Orientation of RSS. axis[i] is the ith column of the orientation matrix for the RSS; it is also the i...
Definition RSS.h:61
RSS()
&#160;
Definition RSS.h:73
RSS operator+(const RSS &other) const
Return the merged RSS of current RSS and the other one.
Scalar radius
Radius of sphere summed with rectangle to form RSS.
Definition RSS.h:70
bool contain(const Vec3s &p) const
Check whether the RSS contains a point.
Scalar height() const
Height of the RSS.
Definition RSS.h:131
bool overlap(const RSS &other, RSS &) const
Check collision between two RSS and return the overlap part. For RSS, we return nothing,...
Definition RSS.h:146
Scalar volume() const
Volume of the RSS.
Definition RSS.h:137
Vec3s Tr
Origin of the rectangle in RSS.
Definition RSS.h:64
Scalar size() const
Size of the RSS (used in BV_Splitter to order two RSSs)
Definition RSS.h:119
Scalar depth() const
Depth of the RSS.
Definition RSS.h:134
Scalar width() const
Width of the RSS.
Definition RSS.h:128
bool overlap(const RSS &other) const
Check collision between two RSS.
RSS & operator+=(const Vec3s &p)
A simple way to merge the RSS and a point, not compact.
Scalar length[2]
Side lengths of rectangle.
Definition RSS.h:67
const Vec3s & center() const
The RSS center.
Definition RSS.h:125
bool operator!=(const RSS &other) const
Difference operator.
Definition RSS.h:86
bool overlap(const RSS &other, const CollisionRequest &, Scalar &sqrDistLowerBound) const
Not implemented.
Definition RSS.h:95
Scalar distance(const RSS &other, Vec3s *P=NULL, Vec3s *Q=NULL) const
the distance between two RSS; P and Q, if not NULL, return the nearest points
bool operator==(const RSS &other) const
Equality operator.
Definition RSS.h:79