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
162
163
164
165
166
167
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
|
/* ResidualVM - A 3D game interpreter
*
* ResidualVM is the legal property of its developers, whose names
* are too numerous to list here. Please refer to the AUTHORS
* file distributed with this source distribution.
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License
* as published by the Free Software Foundation; either version 2
* of the License, or (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
*
*/
#include "engines/stark/resources/path.h"
#include "engines/stark/formats/xrc.h"
namespace Stark {
namespace Resources {
Object *Path::construct(Object *parent, byte subType, uint16 index, const Common::String &name) {
switch (subType) {
case kPath2D:
return new Path2D(parent, subType, index, name);
case kPath3D:
return new Path3D(parent, subType, index, name);
default:
error("Unknown path subtype %d", subType);
}
}
Path::~Path() {
}
Path::Path(Object *parent, byte subType, uint16 index, const Common::String &name) :
Object(parent, subType, index, name),
_field_30(0) {
_type = TYPE;
}
void Path::readData(Formats::XRCReadStream *stream) {
_field_30 = stream->readUint32LE();
}
void Path::printData() {
debug("field_30: %d", _field_30);
}
float Path::getEdgeLength(uint edgeIndex) const {
Math::Vector3d edgeStart = getVertexPosition(edgeIndex);
Math::Vector3d edgeEnd = getVertexPosition(edgeIndex + 1);
return edgeStart.getDistanceTo(edgeEnd);
}
float Path::getWeightedEdgeLength(uint edgeIndex) const {
float length = getEdgeLength(edgeIndex);
float startWeight = getVertexWeight(edgeIndex);
float endWeight = getVertexWeight(edgeIndex + 1);
return 2000.0 * length / (startWeight + endWeight);
}
Math::Vector3d Path::getWeightedPositionInEdge(uint edgeIndex, float positionInEdge) {
float edgeLength = getEdgeLength(edgeIndex);
float weightedEdgeLength = getWeightedEdgeLength(edgeIndex);
float startWeight = getVertexWeight(edgeIndex);
float endWeight = getVertexWeight(edgeIndex + 1);
float weightedEdgePosition = ((endWeight - startWeight) / (2 * weightedEdgeLength) * positionInEdge + startWeight) * 0.001
* positionInEdge / edgeLength;
Math::Vector3d edgeStart = getVertexPosition(edgeIndex);
Math::Vector3d edgeEnd = getVertexPosition(edgeIndex + 1);
return edgeEnd * weightedEdgePosition + edgeStart * (1.0 - weightedEdgePosition);
}
float Path::getSortKey() const {
return 0;
}
Math::Vector3d Path::getEdgeDirection(uint edgeIndex) const {
return Math::Vector3d();
}
Path2D::Path2D(Object *parent, byte subType, uint16 index, const Common::String &name) :
Path(parent, subType, index, name) {
}
void Path2D::readData(Formats::XRCReadStream *stream) {
Path::readData(stream);
uint32 vertexCount = stream->readUint32LE();
for (uint i = 0; i < vertexCount; i++) {
Vertex vertex;
vertex.weight = stream->readFloat();
vertex.position = stream->readPoint();
_vertices.push_back(vertex);
}
stream->readUint32LE(); // Unused in the original
}
void Path2D::printData() {
Path::printData();
for (uint i = 0; i < _vertices.size(); i++) {
debug("vertex[%d]: (x %d, y %d), weight: %f", i,
_vertices[i].position.x, _vertices[i].position.y, _vertices[i].weight);
}
}
Path2D::~Path2D() {
}
uint Path2D::getEdgeCount() const {
return _vertices.size() - 1;
}
Math::Vector3d Path2D::getVertexPosition(uint vertexIndex) const {
Common::Point point = _vertices[vertexIndex].position;
return Math::Vector3d(point.x, point.y, 0.0);
}
float Path2D::getVertexWeight(uint vertexIndex) const {
return _vertices[vertexIndex].weight;
}
Path3D::Path3D(Object *parent, byte subType, uint16 index, const Common::String &name) :
Path(parent, subType, index, name),
_sortKey(0) {
}
void Path3D::readData(Formats::XRCReadStream *stream) {
Path::readData(stream);
uint32 vertexCount = stream->readUint32LE();
for (uint i = 0; i < vertexCount; i++) {
Vertex vertex;
vertex.weight = stream->readFloat();
vertex.position = stream->readVector3();
_vertices.push_back(vertex);
}
_sortKey = stream->readFloat();
}
void Path3D::printData() {
Path::printData();
for (uint i = 0; i < _vertices.size(); i++) {
debug("vertex[%d]: (x %f, y %f, z %f), weight: %f", i,
_vertices[i].position.x(), _vertices[i].position.y(), _vertices[i].position.z(), _vertices[i].weight);
}
debug("sortKey: %f", _sortKey);
}
Path3D::~Path3D() {
}
uint Path3D::getEdgeCount() const {
return _vertices.size() - 1;
}
Math::Vector3d Path3D::getVertexPosition(uint vertexIndex) const {
return _vertices[vertexIndex].position;
}
float Path3D::getVertexWeight(uint vertexIndex) const {
return _vertices[vertexIndex].weight;
}
float Path3D::getSortKey() const {
return _sortKey;
}
Math::Vector3d Path3D::getEdgeDirection(uint edgeIndex) const {
Math::Vector3d direction = getVertexPosition(edgeIndex) - getVertexPosition(edgeIndex + 1);
direction.normalize();
return direction;
}
} // End of namespace Resources
} // End of namespace Stark
|
