-
Notifications
You must be signed in to change notification settings - Fork 433
/
DecimationFilter.cpp
92 lines (79 loc) · 3.22 KB
/
DecimationFilter.cpp
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
/******************************************************************************
* Copyright (c) 2011, Michael P. Gerlek (mpg@flaxen.com)
*
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following
* conditions are met:
*
* * Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* * Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in
* the documentation and/or other materials provided
* with the distribution.
* * Neither the name of Hobu, Inc. or Flaxen Geo Consulting nor the
* names of its contributors may be used to endorse or promote
* products derived from this software without specific prior
* written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
* FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
* COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
* BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS
* OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED
* AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
* OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
* OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY
* OF SUCH DAMAGE.
****************************************************************************/
#include "DecimationFilter.hpp"
#include <pdal/PointView.hpp>
#include <pdal/util/ProgramArgs.hpp>
namespace pdal
{
static StaticPluginInfo const s_info
{
"filters.decimation",
"Rank decimation filter. Keep every Nth point",
"http://pdal.io/stages/filters.decimation.html"
};
CREATE_STATIC_STAGE(DecimationFilter, s_info)
std::string DecimationFilter::getName() const { return s_info.name; }
void DecimationFilter::addArgs(ProgramArgs& args)
{
args.add("step", "Points to delete between each kept point", m_step, 1U);
args.add("offset", "Index of first point to consider including in output",
m_offset);
args.add("limit", "Index of last point to consider including in output",
m_limit, (std::numeric_limits<point_count_t>::max)());
}
PointViewSet DecimationFilter::run(PointViewPtr inView)
{
PointViewSet viewSet;
PointViewPtr outView = inView->makeNew();
decimate(*inView.get(), *outView.get());
viewSet.insert(outView);
return viewSet;
}
bool DecimationFilter::processOne(PointRef& point)
{
bool keep = true;
if (m_index < m_offset || m_index >= m_limit)
keep = false;
else if ((m_index - m_offset) % m_step != 0)
keep = false;
m_index++;
return keep;
}
void DecimationFilter::decimate(PointView& input, PointView& output)
{
PointId last_idx = (std::min)(m_limit, input.size());
for (PointId idx = m_offset; idx < last_idx; idx += m_step)
output.appendPoint(input, idx);
}
} // pdal