summaryrefslogtreecommitdiff
path: root/src/cython/cython/subsampling.pyx
blob: 5ca3809979df44de7418ad817fe238f7b7d3f86e (plain)
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
from cython cimport numeric
from libcpp.vector cimport vector
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 "Subsampling_interface.h" namespace "Gudhi::subsampling":
    vector[vector[double]] subsampling_n_farthest_points(vector[vector[double]] points, unsigned nb_points)
    vector[vector[double]] subsampling_n_farthest_points(vector[vector[double]] points, unsigned nb_points, unsigned starting_point)
    vector[vector[double]] subsampling_n_farthest_points_from_file(string off_file, unsigned nb_points)
    vector[vector[double]] subsampling_n_farthest_points_from_file(string off_file, unsigned nb_points, unsigned starting_point)

def choose_n_farthest_points(points=[], off_file='', nb_points=0, starting_point = ''):
    """Subsample by a greedy strategy of iteratively adding the farthest point
    from the current chosen point set to the subsampling.
    The iteration starts with the landmark `starting point`.

    :param points: The input point set.
    :type points: vector[vector[double]].

    Or

    :param off_file: An OFF file style name.
    :type off_file: string

    :param nb_points: Number of points of the subsample.
    :type nb_points: unsigned.
    :param starting_point: The iteration starts with the landmark `starting \
    point`,which is the index of the poit to start with. If not set, this \
    index is choosen randomly.
    :type starting_point: unsigned.
    :returns:  The subsamplepoint set.
    :rtype: vector[vector[double]]
    """
    if off_file is not '':
        if os.path.isfile(off_file):
            if starting_point is '':
                return subsampling_n_farthest_points_from_file(off_file, nb_points)
            else:
                return subsampling_n_farthest_points_from_file(off_file, nb_points, starting_point)
        else:
            print("file " + off_file + " not found.")
    else:
        if starting_point is '':
            return subsampling_n_farthest_points(points, nb_points)
        else:
            return subsampling_n_farthest_points(points, nb_points, starting_point)