Recent changes to Triangulation

WikiPage Triangulation modified by Daniel P. Dougherty

Daniel P. Dougherty — Tue, 15 Jan 2013 02:14:10 -0000

--- v3
+++ v4
@@ -19,7 +19,9 @@

     X.show("Indicies of Triangulation","00");

+

+
 The result will look something like this when graphed.

-
+

WikiPage Triangulation modified by Daniel P. Dougherty

Daniel P. Dougherty — Sat, 12 Jan 2013 00:35:17 -0000

--- v2
+++ v3
@@ -22,4 +22,4 @@
 The result will look something like this when graphed.

-
+

WikiPage Triangulation modified by Daniel P. Dougherty

Daniel P. Dougherty — Sat, 12 Jan 2013 00:35:03 -0000

--- v1
+++ v2
@@ -1,4 +1,3 @@
-
 The following [Groovy](http://groovy.codehaus.org) script illustrates how to perform [Delaunay triangulation](http://en.wikipedia.org/wiki/Delaunay_triangulation) using Snifflib.

 First, we create a 2D space-filling pseudo random sequence called a [Halton Sequence](http://en.wikipedia.org/wiki/Halton_sequence) using Snifflib's PseudoRandom class.
@@ -23,4 +22,4 @@
 The result will look something like this when graphed.

-
+

WikiPage Triangulation modified by Daniel P. Dougherty

Daniel P. Dougherty — Sat, 12 Jan 2013 00:34:37 -0000

The following Groovy script illustrates how to perform Delaunay triangulation using Snifflib.

First, we create a 2D space-filling pseudo random sequence called a Halton Sequence using Snifflib's PseudoRandom class.

import com.mockturtlesolutions.snifflib.datatypes.DblMatrix;
import com.mockturtlesolutions.snifflib.util.Triangulation;
import com.mockturtlesolutions.snifflib.util.PseudoRandom;

DATA = PseudoRandom.haltonSeq(50,2);
T = new Triangulation(DATA);

T.setPerturbationSize(0.001);
T.delaunay();

X = T.getTriangulation();

X.show("Indicies of Triangulation","00");

The result will look something like this when graphed.