1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
|
from cython cimport numeric
from libcpp.vector cimport vector
from libcpp.utility cimport pair
from libcpp.string cimport string
from libcpp cimport bool
import os
"""This file is part of the Gudhi Library. The Gudhi library
(Geometric Understanding in Higher Dimensions) is a generic C++
library for computational topology.
Author(s): Vincent Rouvreau
Copyright (C) 2016 INRIA
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>.
"""
__author__ = "Vincent Rouvreau"
__copyright__ = "Copyright (C) 2016 INRIA"
__license__ = "GPL v3"
cdef extern from "Rips_complex_interface.h" namespace "Gudhi":
cdef cppclass Rips_complex_interface "Gudhi::rips_complex::Rips_complex_interface":
Rips_complex_interface(vector[vector[double]] points, double threshold)
# bool from_file is a workaround for cython to find the correct signature
Rips_complex_interface(string off_file, double threshold, bool from_file)
void create_simplex_tree(Simplex_tree_interface_full_featured* simplex_tree, int dim_max)
# RipsComplex python interface
cdef class RipsComplex:
"""RipsComplex is a simplicial complex constructed from the finite cells
of a Delaunay Triangulation.
The filtration value of each simplex is computed as the square of the
circumradius of the simplex if the circumsphere is empty (the simplex is
then said to be Gabriel), and as the minimum of the filtration values of
the codimension 1 cofaces that make it not Gabriel otherwise.
All simplices that have a filtration value strictly greater than a given
alpha squared value are not inserted into the complex.
.. note::
When Rips_complex is constructed with an infinite value of alpha, the
complex is a Delaunay complex.
"""
cdef Rips_complex_interface * thisptr
# Fake constructor that does nothing but documenting the constructor
def __init__(self, points=[], off_file='', max_edge_length=float('inf')):
"""RipsComplex constructor.
:param points: A list of points in d-Dimension.
:type points: list of list of double
Or
:param off_file: An OFF file style name.
:type off_file: string
:param max_edge_length: Rips value.
:type max_edge_length: int
"""
# The real cython constructor
def __cinit__(self, points=[], off_file='', max_edge_length=float('inf')):
if off_file is not '':
if os.path.isfile(off_file):
self.thisptr = new Rips_complex_interface(off_file,
max_edge_length,
True)
else:
print("file " + off_file + " not found.")
else:
self.thisptr = new Rips_complex_interface(points, max_edge_length)
def __dealloc__(self):
if self.thisptr != NULL:
del self.thisptr
def __is_defined(self):
"""Returns true if RipsComplex pointer is not NULL.
"""
return self.thisptr != NULL
def create_simplex_tree(self, max_dimension=1):
"""
:param max_dimension: graph expansion for rips until this given maximal
dimension.
:type max_dimension: int
:returns: A simplex tree created from the Delaunay Triangulation.
:rtype: SimplexTree
"""
simplex_tree = SimplexTree()
self.thisptr.create_simplex_tree(simplex_tree.thisptr, max_dimension)
return simplex_tree
|
