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
|
/****************************************************************************
**
** Copyright (C) 2015 The Qt Company Ltd.
** Contact: http://www.qt.io/licensing/
**
** This file is part of the demonstration applications of the Qt Toolkit.
**
** $QT_BEGIN_LICENSE:LGPL$
** Commercial License Usage
** Licensees holding valid commercial Qt licenses may use this file in
** accordance with the commercial license agreement provided with the
** Software or, alternatively, in accordance with the terms contained in
** a written agreement between you and The Qt Company. For licensing terms
** and conditions see http://www.qt.io/terms-conditions. For further
** information use the contact form at http://www.qt.io/contact-us.
**
** GNU Lesser General Public License Usage
** Alternatively, this file may be used under the terms of the GNU Lesser
** General Public License version 2.1 or version 3 as published by the Free
** Software Foundation and appearing in the file LICENSE.LGPLv21 and
** LICENSE.LGPLv3 included in the packaging of this file. Please review the
** following information to ensure the GNU Lesser General Public License
** requirements will be met: https://www.gnu.org/licenses/lgpl.html and
** http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html.
**
** As a special exception, The Qt Company gives you certain additional
** rights. These rights are described in The Qt Company LGPL Exception
** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.
**
** GNU General Public License Usage
** Alternatively, this file may be used under the terms of the GNU
** General Public License version 3.0 as published by the Free Software
** Foundation and appearing in the file LICENSE.GPL included in the
** packaging of this file. Please review the following information to
** ensure the GNU General Public License version 3.0 requirements will be
** met: http://www.gnu.org/copyleft/gpl.html.
**
** $QT_END_LICENSE$
**
****************************************************************************/
#include "roundedbox.h"
//============================================================================//
// P3T2N3Vertex //
//============================================================================//
VertexDescription P3T2N3Vertex::description[] = {
{VertexDescription::Position, GL_FLOAT, SIZE_OF_MEMBER(P3T2N3Vertex, position) / sizeof(float), 0, 0},
{VertexDescription::TexCoord, GL_FLOAT, SIZE_OF_MEMBER(P3T2N3Vertex, texCoord) / sizeof(float), sizeof(QVector3D), 0},
{VertexDescription::Normal, GL_FLOAT, SIZE_OF_MEMBER(P3T2N3Vertex, normal) / sizeof(float), sizeof(QVector3D) + sizeof(QVector2D), 0},
{VertexDescription::Null, 0, 0, 0, 0},
};
//============================================================================//
// GLRoundedBox //
//============================================================================//
float lerp(float a, float b, float t)
{
return a * (1.0f - t) + b * t;
}
GLRoundedBox::GLRoundedBox(float r, float scale, int n)
: GLTriangleMesh<P3T2N3Vertex, unsigned short>((n+2)*(n+3)*4, (n+1)*(n+1)*24+36+72*(n+1))
{
int vidx = 0, iidx = 0;
int vertexCountPerCorner = (n + 2) * (n + 3) / 2;
P3T2N3Vertex *vp = m_vb.lock();
unsigned short *ip = m_ib.lock();
if (!vp || !ip) {
qWarning("GLRoundedBox::GLRoundedBox: Failed to lock vertex buffer and/or index buffer.");
m_ib.unlock();
m_vb.unlock();
return;
}
for (int corner = 0; corner < 8; ++corner) {
QVector3D centre(corner & 1 ? 1.0f : -1.0f,
corner & 2 ? 1.0f : -1.0f,
corner & 4 ? 1.0f : -1.0f);
int winding = (corner & 1) ^ ((corner >> 1) & 1) ^ (corner >> 2);
int offsX = ((corner ^ 1) - corner) * vertexCountPerCorner;
int offsY = ((corner ^ 2) - corner) * vertexCountPerCorner;
int offsZ = ((corner ^ 4) - corner) * vertexCountPerCorner;
// Face polygons
if (winding) {
ip[iidx++] = vidx;
ip[iidx++] = vidx + offsX;
ip[iidx++] = vidx + offsY;
ip[iidx++] = vidx + vertexCountPerCorner - n - 2;
ip[iidx++] = vidx + vertexCountPerCorner - n - 2 + offsY;
ip[iidx++] = vidx + vertexCountPerCorner - n - 2 + offsZ;
ip[iidx++] = vidx + vertexCountPerCorner - 1;
ip[iidx++] = vidx + vertexCountPerCorner - 1 + offsZ;
ip[iidx++] = vidx + vertexCountPerCorner - 1 + offsX;
}
for (int i = 0; i < n + 2; ++i) {
// Edge polygons
if (winding && i < n + 1) {
ip[iidx++] = vidx + i + 1;
ip[iidx++] = vidx;
ip[iidx++] = vidx + offsY + i + 1;
ip[iidx++] = vidx + offsY;
ip[iidx++] = vidx + offsY + i + 1;
ip[iidx++] = vidx;
ip[iidx++] = vidx + i;
ip[iidx++] = vidx + 2 * i + 2;
ip[iidx++] = vidx + i + offsX;
ip[iidx++] = vidx + 2 * i + offsX + 2;
ip[iidx++] = vidx + i + offsX;
ip[iidx++] = vidx + 2 * i + 2;
ip[iidx++] = (corner + 1) * vertexCountPerCorner - 1 - i;
ip[iidx++] = (corner + 1) * vertexCountPerCorner - 2 - i;
ip[iidx++] = (corner + 1) * vertexCountPerCorner - 1 - i + offsZ;
ip[iidx++] = (corner + 1) * vertexCountPerCorner - 2 - i + offsZ;
ip[iidx++] = (corner + 1) * vertexCountPerCorner - 1 - i + offsZ;
ip[iidx++] = (corner + 1) * vertexCountPerCorner - 2 - i;
}
for (int j = 0; j <= i; ++j) {
QVector3D normal = QVector3D(i - j, j, n + 1 - i).normalized();
QVector3D offset(0.5f - r, 0.5f - r, 0.5f - r);
QVector3D pos = centre * (offset + r * normal);
vp[vidx].position = scale * pos;
vp[vidx].normal = centre * normal;
vp[vidx].texCoord = QVector2D(pos.x() + 0.5f, pos.y() + 0.5f);
// Corner polygons
if (i < n + 1) {
ip[iidx++] = vidx;
ip[iidx++] = vidx + i + 2 - winding;
ip[iidx++] = vidx + i + 1 + winding;
}
if (i < n) {
ip[iidx++] = vidx + i + 1 + winding;
ip[iidx++] = vidx + i + 2 - winding;
ip[iidx++] = vidx + 2 * i + 4;
}
++vidx;
}
}
}
m_ib.unlock();
m_vb.unlock();
}
|
