Class RlimitedDelaunay
java.lang.Object
RlimitedDelaunay
- All Implemented Interfaces:
- IProxGraph
public class RlimitedDelaunay
- extends java.lang.Object
- implements IProxGraph
Proximity graph function for r-limited-disk voronoi graph.
- Since:
- 1.1
Methods inherited from class java.lang.Object |
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
RlimitedDelaunay
public RlimitedDelaunay()
- Initializes disk radius to 1.0
RlimitedDelaunay
public RlimitedDelaunay(double lfRadius)
- Parameters:
lfRadius
- underlying disk graph radius
getGraph
public CommGraph getGraph(int nDimension,
double[] arrPoints,
IProxGraphOptWrapper optHelper,
CommGraph prevGraph,
IEnvironment env)
- Description copied from interface:
IProxGraph
- Proximity graph function: maps finite collects of points
in R^d onto graphs. Copies communication channels from
previous graph, if available. Does not know about
agent discrete state or other internal state vars.
Does know about environment (of particular importance to
"line of sight" type algorithms)
Assumes that the first d entries in the dimension array correspond
to point 0, the next d to point 1, the next d to point 2 etc.
Must be able to work without an optimization helper passed in.
- Specified by:
getGraph
in interface IProxGraph
- Parameters:
nDimension
- the dimensionality the points live in, is this a graph in r^2, r^3, etc?arrPoints
- position vectoroptHelper
- optimization helper, assumed to be modified
(be sure to duplicate before passing in)
modification of this parameter is a way of returning a helper value.prevGraph
- copy message queues (including unread messages)
from prevGraph if possible.env
- current environment.
- Returns:
- new graph corresponding to this set of points in space.
- See Also:
IProxGraph.getGraph(int, double[], IProxGraphOptWrapper, CommGraph, IEnvironment)