e/Random geometric graph

Information
has gloss	eng: In graph theory, a random geometric graph is a random undirected graph drawn on a bounded region, eg. the unit torus [0, 1)2. It is generated by # Placing vertices at random uniformly and independently on the region # Connecting two vertices, u, v if and only if the distance between them is at most a threshold r, ie. d (u, v) ≤ r.
lexicalization	eng: Random geometric graph
instance of	e/Random graph