The phrase "a proximity graph" is correct and usable in written English.
It can be used in mathematical or computational contexts, particularly in discussions about graph theory or data structures that represent spatial relationships.
Example: "In our analysis, we utilized a proximity graph to visualize the relationships between different data points based on their spatial distances."
Alternatives: "a spatial graph" or "a distance graph".
First, a proximity graph is generated.
This paper addresses the leader follower flocking problem with a moving leader for networked Lagrange systems with parametric uncertainties under a proximity graph.
This has been accomplished by constructing a proximity graph over the data samples to infer its manifold connectivity and then projecting the samples onto the screen space to stipple the contour tree.
In this way, especially for functions R 2 → R and R 3 → R, extracting features of differential topology can be accomplished by composing a proximity graph over the discrete samples first and then constructing a tree that represents the splitting and merging of the inverse images according to the function value changes.
In a proximity graph there is an edge between two vertices if they fulfill a certain proximity condition.
Furthermore, it is also able to incorporate in the layout process the results of a clustering algorithm and a proximity graph.
The second phase matches the spatial relationships between color regions in the image with the query using a spatial proximity graph (SPG) structure designed for the purpose.
The BH is a SKDS that keeps proximity graph representation in hierarchical form.
The same holds for the physical proximity graph, since it is possible to represent an undirected graph as a digraph.
In the proximity graph, the neighbor relationship is defined according to the relative distance between each pair of agents.
Using the tools from proximity graph theory and Lyapunov stability theory, the proposed distributed linear control protocol guarantees that the attitudes of all agents exponentially converge to synchronization, and simultaneously ensures connectivity preservation and collision avoidance of the whole group, if the initial proximity graph is connected.
