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
|
// Copyright (c) 2007-09 INRIA Sophia-Antipolis (France).
// All rights reserved.
//
// This file is part of CGAL (www.cgal.org).
//
// $URL: https://github.com/CGAL/cgal/blob/v6.1/Point_set_processing_3/include/CGAL/random_simplify_point_set.h $
// $Id: include/CGAL/random_simplify_point_set.h b26b07a1242 $
// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
//
// Author(s) : Laurent Saboret
#ifndef CGAL_RANDOM_SIMPLIFY_POINT_SET_H
#define CGAL_RANDOM_SIMPLIFY_POINT_SET_H
#include <CGAL/license/Point_set_processing_3.h>
#include <CGAL/disable_warnings.h>
#include <CGAL/algorithm.h>
#include <CGAL/Kernel_traits.h>
#include <CGAL/property_map.h>
#include <CGAL/assertions.h>
#include <CGAL/Iterator_range.h>
#include <CGAL/Named_function_parameters.h>
#include <CGAL/boost/graph/named_params_helper.h>
#include <iterator>
#include <set>
#include <algorithm>
#include <cmath>
namespace CGAL {
/**
\ingroup PkgPointSetProcessing3Algorithms
Randomly deletes a user-specified fraction of the input points.
This method modifies the order of input points so as to pack all remaining points first,
and returns an iterator over the first point to remove (see erase-remove idiom).
For this reason it should not be called on sorted containers.
\tparam PointRange is a model of `Range`.
\param points input point range
\param removed_percentage percentage of points to remove.
\return iterator over the first point to remove.
*/
template <typename PointRange>
typename PointRange::iterator
random_simplify_point_set(
PointRange& points,
double removed_percentage)
{
CGAL_precondition(removed_percentage >= 0 && removed_percentage <= 100);
// Random shuffle
CGAL::cpp98::random_shuffle (points.begin(), points.end());
// Computes first iterator to remove
std::size_t nb_points = std::distance(points.begin(), points.end());
std::size_t first_index_to_remove = (std::size_t)(double(nb_points) * ((100.0-removed_percentage)/100.0));
typename PointRange::iterator first_point_to_remove = points.begin();
std::advance(first_point_to_remove, first_index_to_remove);
return first_point_to_remove;
}
} //namespace CGAL
#include <CGAL/enable_warnings.h>
#endif // CGAL_RANDOM_SIMPLIFY_POINT_SET_H
|
