edu.tufts.cs.geometry
Class ProximityGraph

java.lang.Object
  edu.tufts.cs.geometry.ProximityGraph

All Implemented Interfaces:

java.lang.Iterable<int[]>

Direct Known Subclasses:

PGBeta, PGDelaunay, PGGabriel

public abstract class ProximityGraph
extends java.lang.Object
implements java.lang.Iterable<int[]>

A ProximityGraph represents a real proxmity graph for a set of points. It is defined by a set of edges.

Constructor Summary

ProximityGraph()

Method Summary

abstract void	computeGraph() Compute the graph from a initialized set of points.
int[]	getConnectedVertices(int vindex)
int	getEdgeCount() Return the number of edges in the graph
java.util.Iterator<int[]>	iterator()
void	setData(javax.vecmath.GMatrix data)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

ProximityGraph

public ProximityGraph()

Method Detail

setData

public void setData(javax.vecmath.GMatrix data)

computeGraph

public abstract void computeGraph()

Compute the graph from a initialized set of points. Typically, this is the slowest part of the calculation.

getConnectedVertices

public int[] getConnectedVertices(int vindex)

Parameters:

vindex -

Returns:

getEdgeCount

public int getEdgeCount()

Return the number of edges in the graph

Returns:

the number of edges in the graph

iterator

public java.util.Iterator<int[]> iterator()

Specified by:

iterator in interface java.lang.Iterable<int[]>