A new graph related to the directions of nearest neighbors in a point process

This paper introduces a new graph constructed from a point process. The idea is to connect a point with its nearest neighbour, then to the second nearest and continue this process until the point belongs to the interior of the convex hull of these nearest neighbours. The number of such neighbours is called the degree of a point. We derive the distribution of the degree of the typical point in a Poison process, prove a central limit theorem for the sum of degrees, and propose an edge-corrected estimator of the distribution of the degree that is unbiased for a stationary Poison process. Simulation studies show that this degree is a useful concept that allows the separation of clustering and repulsive behaviour of point processes.