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
|
/* ScummVM - Graphic Adventure Engine
*
* ScummVM is the legal property of its developers, whose names
* are too numerous to list here. Please refer to the COPYRIGHT
* 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.
*
* $URL$
* $Id$
*
*/
/*
* This code is based on Broken Sword 2.5 engine
*
* Copyright (c) Malte Thiesen, Daniel Queteschiner and Michael Elsdoerfer
*
* Licensed under GNU GPL v2
*
*/
#ifndef SWORD25_WALKREGION_H
#define SWORD25_WALKREGION_H
#include "common/array.h"
#include "sword25/kernel/common.h"
#include "sword25/math/region.h"
namespace Sword25 {
typedef Common::Array<Vertex> BS_Path;
/**
* This class represents the region in which the main character can move
*/
class WalkRegion : public Region {
friend class Region;
protected:
WalkRegion();
WalkRegion(InputPersistenceBlock &Reader, uint handle);
public:
virtual ~WalkRegion();
virtual bool init(const Polygon &contour, const Common::Array<Polygon> *pHoles = 0);
/**
* Get the shortest path between two points in the region
*
* This method requires that the starting point lies within the region. The end point
* may lie outside the region. Int his case, the end is chosen as the cloest point to it
* that lies within the region.
*
* @param X1 X Co-ordinate of the start point
* @param Y1 Y Co-ordinate of the start point
* @param X2 X Co-ordinate of the end point
* @param Y2 Y Co-ordinate of the end point
* @param Path An empty BS_Path that will be set to the resulting path
* @return Returns false if the result is invalid, otherwise returns true.
*/
bool queryPath(int x1, int y1, int x2, int y2, BS_Path &path) {
return queryPath(Vertex(x1, y1), Vertex(x2, y2), path);
}
/**
* Get the shortest path between two points in the region.
*
* @param StartPoint The start point
* @param EndPoint The end point
* @param Path An empty BS_Path that will be set to the resulting path
* @return Returns false if the result is invalid, otherwise returns true.
*/
bool queryPath(Vertex startPoint, Vertex endPoint, BS_Path &path);
virtual void setPos(int x, int y);
const Common::Array<Vertex> &getNodes() const {
return _nodes;
}
const Common::Array< Common::Array<int> > &getVisibilityMatrix() const {
return _visibilityMatrix;
}
virtual bool persist(OutputPersistenceBlock &writer);
virtual bool unpersist(InputPersistenceBlock &reader);
private:
Common::Array<Vertex> _nodes;
Common::Array< Common::Array<int> > _visibilityMatrix;
void initNodeVector();
void computeVisibilityMatrix();
bool checkAndPrepareStartAndEnd(Vertex &start, Vertex &end) const;
bool findPath(const Vertex &start, const Vertex &end, BS_Path &path) const;
};
} // End of namespace Sword25
#endif
|
