weightedVoronoi: weighted Euclidean and geodesic tessellations for ecological and social spatial allocation

Read full text
Authors: Harri Ravenscroft
Cited by: 0

Abstract

Spatial tessellations such as Voronoi diagrams are widely used to represent zones of influence around point locations, yet standard implementations assume equal weights and unconstrained Euclidean space. These assumptions are often violated in ecological and social--ecological systems, where locations differ in importance and spatial influence is limited by complex boundaries or internal barriers. We present a flexible software framework for generating weighted tessellations within arbitrary polygonal domains, allowing both Euclidean and geodesic distance metrics and user-defined transformations of generator weights. Additionally, Geodesic distances may optionally incorporate elevation-dependent resistance, enabling terrain-aware spatial allocation. The method assigns each location within a spatial domain to the generator that minimises a weighted distance function, producing complete, non-overlapping partitions that conform exactly to domain boundaries. A raster-based implementation ensures compatibility with irregular and concave geometries and enables geodesic distances that respect spatial constraints. Post-processing steps enforce single connected regions per generator and eliminate enclave artefacts, improving interpretability and robustness. The software returns spatial tessellations alongside summary tables and diagnostics that quantify allocated area, coverage, and sensitivity to parameter choices. An example application demonstrates how Euclidean and geodesic tessellations can yield markedly different partitions within the same domain. The framework provides a transparent and extensible tool for spatial allocation problems in ecology and related fields where heterogeneity and geographic constraints are central.

Fields of Study & Subjects

Computational Geometry and Mesh Generation Spatial and Panel Data Analysis Geographic Information Systems Studies

Publication details

Publication date
6 February 2026
Document type
Preprint