blob: c715598defebf6e2bb9b76928364feaa5af44ef4 (
plain)
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
|
/*
* SOLID - Software Library for Interference Detection
*
* Copyright (C) 2001-2003 Dtecta. All rights reserved.
*
* This library may be distributed under the terms of the Q Public License
* (QPL) as defined by Trolltech AS of Norway and appearing in the file
* LICENSE.QPL included in the packaging of this file.
*
* This library may be distributed and/or modified under the terms of the
* GNU General Public License (GPL) version 2 as published by the Free Software
* Foundation and appearing in the file LICENSE.GPL included in the
* packaging of this file.
*
* This library is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
* WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
*
* Commercial use or any other use of this library not covered by either
* the QPL or the GPL requires an additional license from Dtecta.
* Please contact info@dtecta.com for enquiries about the terms of commercial
* use of this library.
*/
#ifndef DT_POLYTOPE_H
#define DT_POLYTOPE_H
#include "DT_Convex.h"
#include "DT_IndexArray.h"
#include "DT_VertexBase.h"
class DT_Polytope : public DT_Convex {
public:
DT_Polytope() {}
DT_Polytope(const DT_VertexBase *base, DT_Count count, const DT_Index *indices)
: m_base(base),
m_index(count, indices)
{}
virtual MT_BBox bbox() const;
virtual MT_Scalar supportH(const MT_Vector3& v) const;
virtual MT_Point3 support(const MT_Vector3& v) const;
MT_Point3 operator[](int i) const { return (*m_base)[m_index[i]]; }
DT_Count numVerts() const { return m_index.size(); }
protected:
const DT_VertexBase *m_base;
DT_IndexArray m_index;
};
#endif
|
