A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is
For i = 1, . . . . n let C(x;, r,) be a circle in the plane with centre .x i and radius r; . A repeated distance graph is a directed graph whose vertices are the centres and where (xi, x;) is a directed edge whenever x; lies on the circle with centre x, . Special cases are the nearest neighbour graph, when ri is the minimum distance between x, and any other centre, and the furthest neighbour graph which is similar except that maximum replaces minimum . Repeated distance graphs generalize to anydoi:10.1002/9781118033203.ch10 fatcat:vciqqgto3jgrthmpa66aj3snjm