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
|
from cython cimport numeric
from libcpp.vector cimport vector
from libcpp.utility cimport pair
from libc.stdint cimport intptr_t
from gudhi.simplex_tree cimport *
from gudhi.simplex_tree import SimplexTree
# This file is part of the Gudhi Library - https://gudhi.inria.fr/ - which is released under MIT.
# See file LICENSE or go to https://gudhi.inria.fr/licensing/ for full license details.
# Author(s): Vincent Rouvreau
#
# Copyright (C) 2016 Inria
#
# Modification(s):
# - YYYY/MM Author: Description of the modification
__author__ = "Vincent Rouvreau"
__copyright__ = "Copyright (C) 2016 Inria"
__license__ = "MIT"
cdef extern from "Witness_complex_interface.h" namespace "Gudhi":
cdef cppclass Witness_complex_interface "Gudhi::witness_complex::Witness_complex_interface":
Witness_complex_interface(vector[vector[pair[size_t, double]]] nearest_landmark_table)
void create_simplex_tree(Simplex_tree_interface_full_featured* simplex_tree, double max_alpha_square)
void create_simplex_tree(Simplex_tree_interface_full_featured* simplex_tree, double max_alpha_square,
unsigned limit_dimension)
# WitnessComplex python interface
cdef class WitnessComplex:
"""Constructs (weak) witness complex for a given table of nearest landmarks
with respect to witnesses.
"""
cdef Witness_complex_interface * thisptr
# Fake constructor that does nothing but documenting the constructor
def __init__(self, nearest_landmark_table=None):
"""WitnessComplex constructor.
:param nearest_landmark_table: A list of lists of nearest landmarks and their distances.
`nearest_landmark_table[w][k]==(l,d)` means that l is the k-th nearest landmark to
witness w, and d is the (squared) distance between l and w.
:type nearest_landmark_table: list of list of pair of int and float
"""
# The real cython constructor
def __cinit__(self, nearest_landmark_table=None):
if nearest_landmark_table is not None:
self.thisptr = new Witness_complex_interface(nearest_landmark_table)
def __dealloc__(self):
if self.thisptr != NULL:
del self.thisptr
def __is_defined(self):
"""Returns true if WitnessComplex pointer is not NULL.
"""
return self.thisptr != NULL
def create_simplex_tree(self, max_alpha_square = float('inf'), limit_dimension = -1):
"""
:param max_alpha_square: The maximum relaxation parameter.
Default is set to infinity.
:type max_alpha_square: float
:returns: A simplex tree created from the Delaunay Triangulation.
:rtype: SimplexTree
"""
stree = SimplexTree()
cdef intptr_t stree_int_ptr=stree.thisptr
if limit_dimension != -1:
self.thisptr.create_simplex_tree(<Simplex_tree_interface_full_featured*>stree_int_ptr,
max_alpha_square, limit_dimension)
else:
self.thisptr.create_simplex_tree(<Simplex_tree_interface_full_featured*>stree_int_ptr,
max_alpha_square)
return stree
|
