com.mockturtlesolutions.snifflib.util

Class Triangulation

java.lang.Object

com.mockturtlesolutions.snifflib.util.Triangulation

All Implemented Interfaces:

GriddedRegion

public class Triangulation
extends java.lang.Object
implements GriddedRegion

Manages point set data and their triangulation. Example: Owing to their space-filling properties, Halton sequences tend to generate lots of colinear data which often lead to degenerate Delaunay triangulations. To get a successful triangulation try increasing the random perturbation size. DblMatrix DATA = PseudoRandom.haltonSeq(50,2); Triangulation T = Triangulation(DATA); T.setPerturbationSize(0.0); T.delaunay(); T.setPerturbationSize(0.001); T.delaunay();

Nested Class Summary

Nested Classes

Modifier and Type	Class and Description
class	Triangulation.SplittingPlane
class	Triangulation.VertexTracker

Constructor Summary

Constructors

Constructor and Description
Triangulation(DblMatrix dat)

Method Summary

Methods

Modifier and Type	Method and Description
void	addAvoidanceRegion(java.util.Vector simplices2avoid)
void	addGriddedRegionListener(GriddedRegionListener l)
static java.util.Vector	circleRegion(DblMatrix center, DblMatrix rad, int Npts) Produces a Delaunay triangulation of a circle in 2 dimensions.
void	cleanPointSearch(java.util.LinkedHashMap P)
void	delaunay() Performs Delaunay triangulation on the data of this triangulation.
void	dewall(java.util.LinkedHashMap P, java.util.Vector AFL, int DIM)
DblMatrix	DTFE() Returns the Delaunay tessellation field estimator (DTFE).
java.util.Vector	faceNeighbors(RefSimplex s) Returns the simplices neighboring (sharing a face) with the given simplex.
void	fireGriddedRegionEvent(GriddedRegionEvent dv)
int	getGridCount()
GridElement	getGridElement(int idx)
DblMatrix	getPerturbationSize()
java.util.List	getRegion()
RefSimplex	getSimplex(int idx)
RefSimplex	getSimplex(java.lang.Integer index)
DblMatrix	getTolerance()
DblMatrix	getTriangulation()
java.util.Iterator	gridIterator()
java.util.Vector	hollow() Returns the collection of faces which have no face neighbors.
int	ismember(RefSimplex fprime, java.util.Vector AFL)
RefSimplex	MakeFirstSimplex(java.util.LinkedHashMap P, Triangulation.SplittingPlane alpha, java.util.LinkedHashMap P1, java.util.LinkedHashMap P2)
RefSimplex	MakeSimplex(RefSimplex face, java.util.LinkedHashMap P)
DblMatrix	normOntoPlane(DblMatrix point, DblMatrix pointOn, int dim)
void	Pointset_Partition(java.util.LinkedHashMap P, Triangulation.SplittingPlane alpha, java.util.LinkedHashMap P1, java.util.LinkedHashMap P2)
static java.util.Vector	rectangleRegion(DblMatrix corner, DblMatrix len, int Npts) Produces a Delaunay triangulation of a rectangular region.
static DblMatrix	regionToTriangulation(java.util.Vector region)
void	removeAvoidanceRegion(java.util.Vector simplices2avoid)
void	removeGriddedRegionListener(GriddedRegionListener l)
void	setPerturbationSize(DblMatrix c)
void	setPerturbationSize(double c)
void	setPerturbationSize(java.lang.Double c)
void	setTolerance(DblMatrix tol)
void	show()
void	show(java.lang.String msg)
static java.util.Vector	sphereRegion(DblMatrix center, DblMatrix rad, int Npts) Produces a Delaunay triangulation of a sphere (hypersphere) in N dimensions.
boolean	subsetOf(RefSimplex f, java.util.LinkedHashMap pts) Determines if every vertex of this simplex belongs in the given set.
void	Update(RefSimplex fprime, java.util.Vector AFL)
java.util.Vector	vertexNeighbors(RefSimplex s) Returns the simplices neighboring (sharing a face) with the given simplex.

Methods inherited from class java.lang.Object

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

Constructor Detail

Triangulation

public Triangulation(DblMatrix dat)

Method Detail

addGriddedRegionListener

public void addGriddedRegionListener(GriddedRegionListener l)

Specified by:

addGriddedRegionListener in interface GriddedRegion

removeGriddedRegionListener

public void removeGriddedRegionListener(GriddedRegionListener l)

Specified by:

removeGriddedRegionListener in interface GriddedRegion

fireGriddedRegionEvent

public void fireGriddedRegionEvent(GriddedRegionEvent dv)

Specified by:

fireGriddedRegionEvent in interface GriddedRegion

getGridCount

public int getGridCount()

Specified by:

getGridCount in interface GriddedRegion

gridIterator

public java.util.Iterator gridIterator()

Specified by:

gridIterator in interface GriddedRegion

getPerturbationSize

public DblMatrix getPerturbationSize()

setPerturbationSize

public void setPerturbationSize(double c)

setPerturbationSize

public void setPerturbationSize(java.lang.Double c)

setPerturbationSize

public void setPerturbationSize(DblMatrix c)

hollow

public java.util.Vector hollow()

Returns the collection of faces which have no face neighbors. For a simple Delaunay triangulation this returns the convex hull.

DTFE

public DblMatrix DTFE()

Returns the Delaunay tessellation field estimator (DTFE). See Schaap and van de Weygaert 2000

faceNeighbors

public java.util.Vector faceNeighbors(RefSimplex s)

Returns the simplices neighboring (sharing a face) with the given simplex. The set of neighbors sharing a face will be a subset of the set of vertex neighbors.

getGridElement

public GridElement getGridElement(int idx)

Specified by:

getGridElement in interface GriddedRegion

getSimplex

public RefSimplex getSimplex(java.lang.Integer index)

getSimplex

public RefSimplex getSimplex(int idx)

vertexNeighbors

public java.util.Vector vertexNeighbors(RefSimplex s)

Returns the simplices neighboring (sharing a face) with the given simplex. The set of neighbors sharing a face will be a subset of the set of vertex neighbors.

getRegion

public java.util.List getRegion()

addAvoidanceRegion

public void addAvoidanceRegion(java.util.Vector simplices2avoid)

removeAvoidanceRegion

public void removeAvoidanceRegion(java.util.Vector simplices2avoid)

delaunay

public void delaunay()

Performs Delaunay triangulation on the data of this triangulation.

setTolerance

public void setTolerance(DblMatrix tol)

getTolerance

public DblMatrix getTolerance()

cleanPointSearch

public void cleanPointSearch(java.util.LinkedHashMap P)

dewall

public void dewall(java.util.LinkedHashMap P,
          java.util.Vector AFL,
          int DIM)

ismember

public int ismember(RefSimplex fprime,
           java.util.Vector AFL)

Update

public void Update(RefSimplex fprime,
          java.util.Vector AFL)

Pointset_Partition

public void Pointset_Partition(java.util.LinkedHashMap P,
                      Triangulation.SplittingPlane alpha,
                      java.util.LinkedHashMap P1,
                      java.util.LinkedHashMap P2)

MakeSimplex

public RefSimplex MakeSimplex(RefSimplex face,
                     java.util.LinkedHashMap P)

MakeFirstSimplex

public RefSimplex MakeFirstSimplex(java.util.LinkedHashMap P,
                          Triangulation.SplittingPlane alpha,
                          java.util.LinkedHashMap P1,
                          java.util.LinkedHashMap P2)

subsetOf

public boolean subsetOf(RefSimplex f,
               java.util.LinkedHashMap pts)

Determines if every vertex of this simplex belongs in the given set.

normOntoPlane

public DblMatrix normOntoPlane(DblMatrix point,
                      DblMatrix pointOn,
                      int dim)

show

public void show()

show

public void show(java.lang.String msg)

getTriangulation

public DblMatrix getTriangulation()

regionToTriangulation

public static DblMatrix regionToTriangulation(java.util.Vector region)

circleRegion

public static java.util.Vector circleRegion(DblMatrix center,
                            DblMatrix rad,
                            int Npts)

Produces a Delaunay triangulation of a circle in 2 dimensions. Center, radius and number of points can be tuned.

rectangleRegion

public static java.util.Vector rectangleRegion(DblMatrix corner,
                               DblMatrix len,
                               int Npts)

Produces a Delaunay triangulation of a rectangular region. Lower corner, side lengths, and number of points can be tuned.

sphereRegion

public static java.util.Vector sphereRegion(DblMatrix center,
                            DblMatrix rad,
                            int Npts)

Produces a Delaunay triangulation of a sphere (hypersphere) in N dimensions. Center, radius and number of points can be tuned.