Hierarchical Hexagonal Clustering and Indexing

Abstract

Space-filling curves (SFCs) represent an efficient and straightforward method for sparse-space indexing to transform an n-dimensional space into a one-dimensional representation. This is often applied for multidimensional point indexing which brings a better perspective for data analysis, visualization and queries. SFCs are involved in many areas such as big data analysis and visualization, image decomposition, computer graphics and geographic information systems (GISs). The indexing methods subdivide the space into logic clusters of close points and they differ in various parameters including the cluster order, the distance metrics, and the pattern shape. Beside the simple and highly preferred triangular and square uniform grids, the hexagonal uniform grids have gained high interest especially in areas such as GISs, image processing and data visualization for the uniform distance between cells and high effectiveness of circle coverage. While the linearization of hexagons is an obvious approach for memory representation, it seems there is no hexagonal SFC indexing method generally used in practice. The main limitation of hexagons lies in lacking infinite decomposition into sub-hexagons and similarity of tiles on different levels of hierarchy. Our research aims at defining a fast and robust hexagonal SFC method. The Gosper fractal is utilized to preserve the benefits of hexagonal grids and to efficiently and hierarchically linearize points in a hexagonal grid while solving the non-convex shape and recursive transformation issues of the fractal. A comparison to other SFCs and grids is conducted to verify the robustness and effectiveness of our hexagonal method.

Use of GIS Tools in Sustainable Heritage Management—The Importance of Data Generalization in Spatial Modeling

“…The most popular geometric figures are: triangles, squares, and hexagons; these are the only regular shapes that tessellates the plane with no gaps [49]. In studies performed for the purposes of the article hexagonal grid was used-the higher usefulness of the hexagon over other figures has been repeatedly confirmed in the case of spatial analyses [50][51][52], as well as in other cases [53][54][55][56][57]. The aim of this research was to find the optimal size of the hexagonal grid, to the level of which the data can be generalized, without a significant decrease in the reliability of spatial modeling for various sustainable heritage management needs.…”

Drivers of global irrigation expansion: the role of discrete global grid choice

“…The second design choice requires to pick a method of partitioning the surface of the icosahedron. Hexagons have been found in many research fields to be the optimal choice for discrete gridding and location representation (Apte et al, 2013;Uher et al, 2019). One unique property of a hexagonal grid is its uniform adjacency; each cell in a hexagonal grid has six neighbors, all of which share an edge with the cell, and all of which have centers exactly the same distance away from their neighbouring cells.…”

Automation of Cleaning and Ensembles for Outliers Detection in Questionnaire Data

“…The main problem of these methods is to determine the size of neighborhood or estimate the number of samples expected within the neighborhood depending on the distribution of data (Uher, Gajdoš, & Snášel, 2018;Uher, Gajdoš, Snášel, Lai, & Radeckỳ, 2019). Another issue can be the usability of the Euclidean distance in high dimensions.…”