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
|
/*
* Copyright 2016-2018 Uber Technologies, Inc.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
/** @file algos.h
* @brief Hexagon grid algorithms
*/
#ifndef ALGOS_H
#define ALGOS_H
#include "bbox.h"
#include "coordijk.h"
#include "h3api.h"
#include "linkedGeo.h"
#include "vertexGraph.h"
// neighbor along the ijk coordinate system of the current face, rotated
H3Index h3NeighborRotations(H3Index origin, Direction dir, int* rotations);
// k-ring implementation
void _kRingInternal(H3Index origin, int k, H3Index* out, int* distances,
int maxIdx, int curK);
// Create a vertex graph from a set of hexagons
void h3SetToVertexGraph(const H3Index* h3Set, const int numHexes,
VertexGraph* out);
// Create a LinkedGeoPolygon from a vertex graph
void _vertexGraphToLinkedGeo(VertexGraph* graph, LinkedGeoPolygon* out);
// Internal function for polyfill that traces a geofence with hexagons of a
// specific size
int _getEdgeHexagons(const Geofence* geofence, int numHexagons, int res,
int* numSearchHexes, H3Index* search, H3Index* found);
// The polyfill algorithm. Separated out because it can theoretically fail
int _polyfillInternal(const GeoPolygon* geoPolygon, int res, H3Index* out);
#endif
|
