Add Windows and CGAL_HEADER_ONLY cythonization support

Add OFF reader interfaces (required by Euclidean witness complex)
Add Euclidean_witness_complex



git-svn-id: svn+ssh://scm.gforge.inria.fr/svnroot/gudhi/branches/ST_cythonize@2186 636b058d-ea47-450e-bf9e-a15bfbe3eedb

Former-commit-id: 4d780f05c3409bea47a81e4377dbaf509b9e718c

1 files changed, 29 insertions, 22 deletions

diff --git a/src/cython/test/test_witness_complex.py b/src/cython/test/test_witness_complex.py
index a55e80d7..7d1fb6be 100755
--- a/src/cython/test/test_witness_complex.py
+++ b/src/cython/test/test_witness_complex.py
@@ -1,4 +1,4 @@
-from gudhi import WitnessComplex
+from gudhi import WitnessComplex, StrongWitnessComplex, SimplexTree
 
 """This file is part of the Gudhi Library. The Gudhi library
    (Geometric Understanding in Higher Dimensions) is a generic C++
@@ -32,24 +32,31 @@ def test_empty_witness_complex():
     assert witness.__is_defined() == False
 
 def test_witness_complex():
-    point_list = [[0, 0], [1, 0], [0, 1], [1, 1]]
-    witness = WitnessComplex(points=point_list, number_of_landmarks=10)
-    assert witness.__is_defined() == True
-
-    # FIXME: Remove this line
-    witness.set_dimension(2)
-
-    assert witness.num_simplices() == 13
-    assert witness.num_vertices() == 10
-    witness.initialize_filtration()
-"""
-    assert witness.get_filtered_tree() == \
-        [([0], 0.0), ([1], 0.0), ([0, 1], 0.0), ([2], 0.0), ([1, 2], 0.0),
-         ([3], 0.0), ([2, 3], 0.0), ([4], 0.0), ([5], 0.0), ([6], 0.0),
-         ([7], 0.0), ([8], 0.0), ([9], 0.0)]
-
-
-    assert witness.get_coface_tree([2], 1) == [([1, 2], 0.0), ([2, 3], 0.0)]
-    assert witness.get_star_tree([2]) == \
-        [([1, 2], 0.0), ([2], 0.0), ([2, 3], 0.0)]
-"""
+    nearest_landmark_table = [[[0, 0], [1, 1], [2, 2], [3, 3], [4, 4]],
+                              [[1, 0], [2, 1], [3, 2], [4, 3], [0, 4]],
+                              [[2, 0], [3, 1], [4, 2], [0, 3], [1, 4]],
+                              [[3, 0], [4, 1], [0, 2], [1, 3], [2, 4]],
+                              [[4, 0], [0, 1], [1, 2], [2, 3], [3, 4]]]
+
+    witness_complex = WitnessComplex(nearest_landmark_table=nearest_landmark_table)
+    simplex_tree = witness_complex.create_simplex_tree(max_alpha_square=4.1)
+    assert simplex_tree.num_vertices() == 5
+    assert simplex_tree.num_simplices() == 31
+    simplex_tree = witness_complex.create_simplex_tree(max_alpha_square=4.1, limit_dimension=2)
+    assert simplex_tree.num_vertices() == 5
+    assert simplex_tree.num_simplices() == 25
+
+def test_strong_witness_complex():
+    nearest_landmark_table = [[[0, 0], [1, 1], [2, 2], [3, 3], [4, 4]],
+                              [[1, 0], [2, 1], [3, 2], [4, 3], [0, 4]],
+                              [[2, 0], [3, 1], [4, 2], [0, 3], [1, 4]],
+                              [[3, 0], [4, 1], [0, 2], [1, 3], [2, 4]],
+                              [[4, 0], [0, 1], [1, 2], [2, 3], [3, 4]]]
+
+    strong_witness_complex = StrongWitnessComplex(nearest_landmark_table=nearest_landmark_table)
+    simplex_tree = strong_witness_complex.create_simplex_tree(max_alpha_square=4.1)
+    assert simplex_tree.num_vertices() == 5
+    assert simplex_tree.num_simplices() == 31
+    simplex_tree = strong_witness_complex.create_simplex_tree(max_alpha_square=4.1, limit_dimension=2)
+    assert simplex_tree.num_vertices() == 5
+    assert simplex_tree.num_simplices() == 25