A B C D E F G H I M N S T V X Y

A

a - Variable in class io.github.jdiemke.triangulation.Edge2D

a - Variable in class io.github.jdiemke.triangulation.Triangle2D

add(Vector2D) - Method in class io.github.jdiemke.triangulation.Vector2D

Adds the given vector to this.

B

b - Variable in class io.github.jdiemke.triangulation.Edge2D

b - Variable in class io.github.jdiemke.triangulation.Triangle2D

C

c - Variable in class io.github.jdiemke.triangulation.Triangle2D

compareTo(EdgeDistancePack) - Method in class io.github.jdiemke.triangulation.EdgeDistancePack

contains(Vector2D) - Method in class io.github.jdiemke.triangulation.Triangle2D

Tests if a 2D point lies inside this 2D triangle.

cross(Vector2D) - Method in class io.github.jdiemke.triangulation.Vector2D

Computes the 2D pseudo cross product Dot(Perp(this), vector) of this and the given vector.

D

DelaunayTriangulator - Class in io.github.jdiemke.triangulation

A Java implementation of an incremental 2D Delaunay triangulation algorithm.

DelaunayTriangulator(List<Vector2D>) - Constructor for class io.github.jdiemke.triangulation.DelaunayTriangulator

Constructor of the SimpleDelaunayTriangulator class used to create a new triangulator instance.

distance - Variable in class io.github.jdiemke.triangulation.EdgeDistancePack

dot(Vector2D) - Method in class io.github.jdiemke.triangulation.Vector2D

Computes the dot product of this and the given vector.

E

edge - Variable in class io.github.jdiemke.triangulation.EdgeDistancePack

Edge2D - Class in io.github.jdiemke.triangulation

2D edge class implementation.

Edge2D(Vector2D, Vector2D) - Constructor for class io.github.jdiemke.triangulation.Edge2D

Constructor of the 2D edge class used to create a new edge instance from two 2D vectors describing the edge's vertices.

EdgeDistancePack - Class in io.github.jdiemke.triangulation

Edge distance pack class implementation used to describe the distance to a given edge.

EdgeDistancePack(Edge2D, double) - Constructor for class io.github.jdiemke.triangulation.EdgeDistancePack

Constructor of the edge distance pack class used to create a new edge distance pack instance from a 2D edge and a scalar value describing a distance.

F

findNearestEdge(Vector2D) - Method in class io.github.jdiemke.triangulation.Triangle2D

Returns an EdgeDistancePack containing the edge and its distance nearest to the specified point.

G

getNoneEdgeVertex(Edge2D) - Method in class io.github.jdiemke.triangulation.Triangle2D

Returns the vertex of this triangle that is not part of the given edge.

getPointSet() - Method in class io.github.jdiemke.triangulation.DelaunayTriangulator

Returns the point set in form of a vector of 2D vectors.

getTriangles() - Method in class io.github.jdiemke.triangulation.DelaunayTriangulator

Returns the trianges of the triangulation in form of a vector of 2D triangles.

H

hasVertex(Vector2D) - Method in class io.github.jdiemke.triangulation.Triangle2D

Returns true if the given vertex is one of the vertices describing this triangle.

I

io.github.jdiemke.triangulation - package io.github.jdiemke.triangulation

isNeighbour(Edge2D) - Method in class io.github.jdiemke.triangulation.Triangle2D

Returns true if this triangle contains the given edge.

isOrientedCCW() - Method in class io.github.jdiemke.triangulation.Triangle2D

Test if this triangle is oriented counterclockwise (CCW).

isPointInCircumcircle(Vector2D) - Method in class io.github.jdiemke.triangulation.Triangle2D

Tests if a given point lies in the circumcircle of this triangle.

M

mag() - Method in class io.github.jdiemke.triangulation.Vector2D

Computes the magnitude or length of this.

mult(double) - Method in class io.github.jdiemke.triangulation.Vector2D

Multiplies this by the given scalar.

N

NotEnoughPointsException - Exception in io.github.jdiemke.triangulation

Exception thrown by the Delaunay triangulator when it is initialized with less than three points.

NotEnoughPointsException() - Constructor for exception io.github.jdiemke.triangulation.NotEnoughPointsException

NotEnoughPointsException(String) - Constructor for exception io.github.jdiemke.triangulation.NotEnoughPointsException

S

shuffle() - Method in class io.github.jdiemke.triangulation.DelaunayTriangulator

Creates a random permutation of the specified point set.

shuffle(int[]) - Method in class io.github.jdiemke.triangulation.DelaunayTriangulator

Shuffles the point set using a custom permutation sequence.

sub(Vector2D) - Method in class io.github.jdiemke.triangulation.Vector2D

Subtracts the given vector from this.

T

toString() - Method in class io.github.jdiemke.triangulation.Triangle2D

toString() - Method in class io.github.jdiemke.triangulation.Vector2D

Triangle2D - Class in io.github.jdiemke.triangulation

2D triangle class implementation.

Triangle2D(Vector2D, Vector2D, Vector2D) - Constructor for class io.github.jdiemke.triangulation.Triangle2D

Constructor of the 2D triangle class used to create a new triangle instance from three 2D vectors describing the triangle's vertices.

triangulate() - Method in class io.github.jdiemke.triangulation.DelaunayTriangulator

This method generates a Delaunay triangulation from the specified point set.

V

Vector2D - Class in io.github.jdiemke.triangulation

2D vector class implementation.

Vector2D(double, double) - Constructor for class io.github.jdiemke.triangulation.Vector2D

Constructor of the 2D vector class used to create new vector instances.

X

x - Variable in class io.github.jdiemke.triangulation.Vector2D

Y

y - Variable in class io.github.jdiemke.triangulation.Vector2D

A B C D E F G H I M N S T V X Y