Answers are grounded in this paper and cite their sources.
Visibility graphs map a time series into a network by linking two datawhenever the straight line between them is not obstructed by intermediate data.Their extension to two-dimensional fields has so far been restricted to regularlattices, where visibility is checked along a finite number of latticedirections. We propose a definition for scalar data sampled at arbitrary,irregularly scattered points of the plane. Each point is assigned its Voronoicell, so that the data become a landscape of prisms, and two points are linkedwhen the line of sight between them clears the cells crossed by the connectingsegment. This yields horizontal () and natural () Voronoivisibility graphs that reduce exactly to the classical horizontal and naturalvisibility graphs when the points are collinear, contain the Gabriel graph ofthe point set, and can be built by an exact walk through the Delaunaytriangulation. For uncorrelated heights, the horizontal graph depends only onthe ranks of the data, so its statistics are independent of the marginaldistribution. The probability that two points see each other is$2/[(M+1)(M+2)]$, where M is the number of Voronoi cells crossed, whichreduces the problem to the geometry of the tessellation. For Poisson pointsthis gives a degree distribution with a scale-free tailP(k)(π³/4)\,k⁻² and a mean degree that grows as (π³/8)ln N,in contrast with the finite value k=4 of one-dimensionalseries. Two dimensions are therefore the marginal case in which isotropichorizontal visibility ceases to be local. Numerical simulations with up toN=1.28×10⁵ points support these predictions.
No takes yet. Share an insight, caveat, or question.
Muñoz et al. (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: