dfj version of delaunay refinement executes the original algorithm with workers=1...

[IRC.git] / Robust / src / Benchmarks / oooJava / DelaunayRefinement / input / tiny.node

diff --git a/Robust/src/Benchmarks/oooJava/DelaunayRefinement/input/tiny.node b/Robust/src/Benchmarks/oooJava/DelaunayRefinement/input/tiny.node
new file mode 100644 (file)
index 0000000..3b01700
--- /dev/null
+++ b/Robust/src/Benchmarks/oooJava/DelaunayRefinement/input/tiny.node
@@ -0,0 +1,7 @@
+6
+0  1 1 0
+1  4 1 0
+2  7 2 0
+3  5 3 0
+4  0 9 0 //if you use this for point 4 it works fine: 2 6 0
+5  6 6 0