/
HexGrid.hpp
143 lines (130 loc) · 4.79 KB
/
HexGrid.hpp
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
/******************************************************************************
* Copyright (c) 2014, Hobu Inc. (howard@hobu.co)
*
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following
* conditions are met:
*
* * Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* * Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in
* the documentation and/or other materials provided
* with the distribution.
* * Neither the name of the Howard Butler or Hobu, Inc.
* the names of its contributors may be
* used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
* FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
* COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
* BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS
* OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED
* AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
* OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
* OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY
* OF SUCH DAMAGE.
****************************************************************************/
#pragma once
#include <unordered_map>
#include <set>
#include "exception.hpp"
#include "Hexagon.hpp"
#include "Mathpair.hpp"
#include "Path.hpp"
#include "Segment.hpp"
namespace hexer
{
class HexIter;
static const double SQRT_3 = 1.732050808;
class HexGrid
{
friend class HexIter;
public:
HexGrid(int dense_limit);
HexGrid(double height, int dense_limit) : m_dense_limit(dense_limit)
{ initialize(height); }
~HexGrid()
{
for (std::vector<Path*>::size_type i = 0; i < m_paths.size(); i++)
delete m_paths[i];
}
bool dense(Hexagon *h);
void addPoint(double x, double y)
{ addPoint(Point(x, y)); }
void addPoint(Point p);
void processSample();
void findShapes();
void findParentPaths();
void extractShapes();
void dumpInfo();
void drawHexagons();
Hexagon *getHexagon(int x, int y);
Hexagon *getHexagon(const Coord& c)
{ return getHexagon(c.m_x, c.m_y); }
void addDenseHexagon(int x, int y);
HexIter hexBegin();
HexIter hexEnd();
double width() const
{ return m_width; }
double height() const
{ return m_height; }
Point const& offset(int idx) const
{ return m_offsets[idx]; }
Point centerOffset(int idx) const
{ return (m_offsets[idx] - m_center_offset); }
Point const& origin() const
{ return m_origin; }
int denseLimit() const
{ return m_dense_limit; }
std::vector<Path *> const& rootPaths() const
{ return m_paths; }
void setSampleSize(unsigned sampleSize)
{ m_maxSample = sampleSize; }
void toWKT(std::ostream&) const;
size_t densePointCount() const;
private:
void initialize(double height);
Hexagon *findHexagon(Point p);
void findShape(Hexagon *hex);
void findHole(Hexagon *hex);
void cleanPossibleRoot(Segment s, Path *p);
void findParentPath(Path *p);
void markNeighborBelow(Hexagon *hex);
/// Height of the hexagons in the grid (2x apothem)
double m_height;
/// Width of the hexagons in the grid
double m_width;
/// Origin of the hex grid in point coordinates.
Point m_origin;
/// Offsets of vertices of hexagon, going anti-clockwise from upper-left
Point m_offsets[6];
/// Offset of the center of the hexagons.
Point m_center_offset;
/// Map of hexagons based on keys.
typedef std::unordered_map<uint64_t, Hexagon> HexMap;
HexMap m_hexes;
/// Set of dense hexagons with non-dense neighbors above.
typedef std::set<Hexagon *, HexCompare> HexSet;
HexSet m_pos_roots;
/// Map of roots and their associated paths.
typedef std::unordered_map<Hexagon *, Path *> HexPathMap;
HexPathMap m_hex_paths;
/// List of paths
std::vector<Path *> m_paths;
/// Number of points that must lie in a hexagon for it to be interesting.
int m_dense_limit;
/// Minimum y - 1.
int m_miny;
/// Vector of points to use to determine hex height.
std::vector<Point> m_sample;
/// Maximum sample size.
unsigned m_maxSample;
};
} // namespace