B C D E F G L M P R T V

B

BarPathFinder - interface cs252proj.api.BarPathFinder.

An interface for finding the shortest path between two points, avoiding bar obstacles.

C

ClosestPointFinder - interface cs252proj.api.ClosestPointFinder.

An interface for finding the closest pair of a set of points.

ConstrainedTriangulator - interface cs252proj.api.ConstrainedTriangulator.

An interface for the constrained triangulation of a graph of vertices and edges.

D

DelaunayTriangulator - interface cs252proj.api.DelaunayTriangulator.

An interface for finding the Delaunay triangulation of a collection of points.

E

execute(InspectableEmbeddedPlanarGraph) - Method in interface cs252proj.api.PointLocator

Initializes the PointLocator with the given EmbeddedPlanarGraph;

execute(InspectableEmbeddedPlanarGraph) - Method in interface cs252proj.api.PolygonPathFinder

Initializes the PolygonPathFinder with the given embedded planar graph.

execute(InspectableGraph) - Method in interface cs252proj.api.ConstrainedTriangulator

Triangulates the given graph such that all vertices and edges present in the original graph are present in the triangulation.

execute(ObjectIterator) - Method in interface cs252proj.api.BarPathFinder

Initializes the path finder with the given set of bars.

execute(ObjectIterator) - Method in interface cs252proj.api.ClosestPointFinder

Initializes the ClosestPointFinder with the given set of points.

execute(ObjectIterator) - Method in interface cs252proj.api.DelaunayTriangulator

Creates a triangulation with the given set of points.

execute(ObjectIterator) - Method in interface cs252proj.api.RectangleContourFinder

Initializes the RectangleContourFinder with the given collection of rectangles.

execute(ObjectIterator) - Method in interface cs252proj.api.RectangleIntersector

Initializes the RectangleIntersector with the given set of Rectangle2Ds.

execute(ObjectIterator) - Method in interface cs252proj.api.VoronoiDiagrammer

Finds the Voronoi diagram for a given set of points.

F

findPath(Point2D, Point2D) - Method in interface cs252proj.api.BarPathFinder

Finds a path avoiding the bars.

G

getClosestPoints() - Method in interface cs252proj.api.ClosestPointFinder

Finds the closest pair of points in the container.

getContour() - Method in interface cs252proj.api.RectangleContourFinder

getCorrespEdge(Edge) - Method in interface cs252proj.api.ConstrainedTriangulator

Given an edge in the original graph, returns the corresponding edge in the triangulation.

getCorrespFace(Point2D) - Method in interface cs252proj.api.VoronoiDiagrammer

Finds the corresponding face in the Voronoi diagram given the original point.

getCorrespRects(Edge) - Method in interface cs252proj.api.RectangleContourFinder

Finds the rectangles in the original collection that correspond to the given edge in the contour.

getCorrespRects(Vertex) - Method in interface cs252proj.api.RectangleContourFinder

Finds the rectangles in the original collection that correspond to the given vertex in the contour.

getCorrespVertex(Point2D) - Method in interface cs252proj.api.DelaunayTriangulator

Given a point in the original point set, returns the corresponding vertex in the triangulation.

getCorrespVertex(Vertex) - Method in interface cs252proj.api.ConstrainedTriangulator

Given a vertex in the original graph, returns the corresponding vertex in the triangulation.

getIntersected(Rectangle2D) - Method in interface cs252proj.api.RectangleIntersector

Finds rectangles that intersect the given rectangle.

getOrigPoint(Face) - Method in interface cs252proj.api.VoronoiDiagrammer

Finds the corresponding point in the original collection given a face in the Voronoi diagram.

getOrigPoint(Vertex) - Method in interface cs252proj.api.DelaunayTriangulator

Given a vertex in the triangulation, returns an iterator over the points that correspond to it.

getPath(Point2D, Point2D) - Method in interface cs252proj.api.PolygonPathFinder

Finds a path within the polygonal subdivision.

getPoint1() - Method in class cs252proj.api.Point2DPair

getPoint2() - Method in class cs252proj.api.Point2DPair

getTriangulation() - Method in interface cs252proj.api.ConstrainedTriangulator

getTriangulation() - Method in interface cs252proj.api.DelaunayTriangulator

Returns a Delaunay triangulation for the collection of points.

getVoronoi() - Method in interface cs252proj.api.VoronoiDiagrammer

Returns the Voronoi diagram for the collection of points.

L

locatePoint(Point2D) - Method in interface cs252proj.api.PointLocator

Finds the Position in the EmbeddedPlanarGraph on which the point lies: may be a Face, Edge, or Vertex.

M

m_point1 - Variable in class cs252proj.api.Point2DPair

m_point2 - Variable in class cs252proj.api.Point2DPair

P

Point2DPair - class cs252proj.api.Point2DPair.

A utility class containing two points.

Point2DPair(Point2D, Point2D) - Constructor for class cs252proj.api.Point2DPair

PointLocator - interface cs252proj.api.PointLocator.

An interface for finding the face of a graph in which a point lies.

PolygonPathFinder - interface cs252proj.api.PolygonPathFinder.

An interface for finding the shortest path within a simple polygonal subdivision.

PrioritySearchTree - interface cs252proj.api.PrioritySearchTree.

An interface for a collection upon which three-sided queries can be performed.

R

RectangleContourFinder - interface cs252proj.api.RectangleContourFinder.

An interface for finding the contour of a collection of Rectangle2Ds.

RectangleIntersector - interface cs252proj.api.RectangleIntersector.

An interface for determining which rectangles in a collection intersect a given rectangle.

T

threeSidedQuery(Point2D, Point2D) - Method in interface cs252proj.api.PrioritySearchTree

Finds the Point2D-element pairs within the given three-sided range.

V

VoronoiDiagrammer - interface cs252proj.api.VoronoiDiagrammer.

An interface for finding the Voronoi diagram of a collection of points.

B C D E F G L M P R T V