Akeldov.Math.Hexes 0.2.0

Akeldov.Math.Hexes

Akeldov.Math.Hexes is a .NET library for hex-grid coordinates, topology, geometry, maps, rasterization, pathfinding, polyhex processing, and weighted partitioning.

Features

The library is organized around practical hex-grid workflows.

Coordinates and Layouts

• Fractional and integer QRS axial vectors with the cube-coordinate zero-sum invariant.
• Conversion between QRS, offset-grid indexes, and two-dimensional world coordinates.
• Odd and even row layouts for pointy-top hexes and odd and even column layouts for flat-top hexes.
• Layout-aware discretization, rotation, affine transformations, and binary serialization.
• Sixfold angles for directions and rotations in 60-degree increments.

Topology and Maps

• Rectangular map topology with edge, vertex, pair, triplet, and six-neighbor adjacency helpers.
• Mutable HexMap<T> and geometry-aware SpatialHexMap<T> value storage.
• Dedicated Boolean, integer, and floating-point maps with conditional selection.
• Extrema queries and arithmetic operators for numeric maps; logical operators for Boolean maps.
• Deterministic Perlin-noise generation and Gaussian blur for floating-point maps.
• Index maps and compact pair, triplet, and septuplet containers with presence flags.
• Polyhex masks, builders, extension operations, and binary serialization.

Geometry and Rasterization

• Radius-based hex geometry with layout-aware centers, vertices, bounding boxes, and raster geometry.
• Barycentric sampling for the three hexes meeting at a vertex.
• Topology and geometry rasters with arbitrary world-space bounds and resolution.
• Generic map rasterization and optional XY or QRS index labels.
• Polyhex boundary extraction, contour construction, apothem offsets, and region conversion.

Chromatization

• Repeating chromatic indexes for hexes and shared vertices.
• Chromatic maps and full or partial triplet rasters.
• Barycentric chromatic weights for blending values around hex vertices.

Pathfinding and Partitioning

• Weighted shortest-path search using separate cell entry and exit costs.
• Impassable cells represented by positive-infinity transfer costs.
• Weighted Voronoi partitioning of hex centers with read-only cell assignments.

Documentation

Documentation is available at:

https://akeldov.github.io/Akeldov.Math/Hexes/