-
Notifications
You must be signed in to change notification settings - Fork 432
/
PDALUtils.cpp
401 lines (338 loc) · 10.4 KB
/
PDALUtils.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
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
/******************************************************************************
* Copyright (c) 2014, 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 <pdal/PDALUtils.hpp>
#include <pdal/pdal_features.hpp> // PDAL_ARBITER_ENABLED
#ifdef PDAL_ARBITER_ENABLED
#include <arbiter/arbiter.hpp>
#endif
#include <pdal/KDIndex.hpp>
#include <pdal/PDALUtils.hpp>
#include <pdal/PointView.hpp>
#include <pdal/Options.hpp>
#include <pdal/util/FileUtils.hpp>
using namespace std;
namespace pdal
{
namespace {
void toJSON(const MetadataNode& m, std::ostream& o, int level);
void arrayToJSON(const MetadataNodeList& children, std::ostream& o, int level);
void arrayEltToJSON(const MetadataNode& m, std::ostream& o, int level);
void subnodesToJSON(const MetadataNode& parent, std::ostream& o, int level)
{
const std::string indent(level * 2, ' ');
std::vector<std::string> names = parent.childNames();
o << indent << "{" << endl;
for (auto ni = names.begin(); ni != names.end(); ++ni)
{
MetadataNodeList children = parent.children(*ni);
MetadataNode& node = *children.begin();
if (node.kind() == MetadataType::Array)
{
o << indent << " \"" << node.name() << "\":" << std::endl;
arrayToJSON(children, o, level + 1);
}
else
toJSON(node, o, level + 1);
if (ni != names.rbegin().base() - 1)
o << ",";
o << std::endl;
}
o << indent << "}";
}
void arrayToJSON(const MetadataNodeList& children, std::ostream& o, int level)
{
const std::string indent(level * 2, ' ');
o << indent << "[" << std::endl;
for (auto ci = children.begin(); ci != children.end(); ++ci)
{
const MetadataNode& m = *ci;
arrayEltToJSON(m, o, level + 1);
if (ci != children.rbegin().base() - 1)
o << ",";
o << std::endl;
}
o << indent << "]";
}
void arrayEltToJSON(const MetadataNode& m, std::ostream& o, int level)
{
std::string indent(level * 2, ' ');
std::string value = m.jsonValue();
bool children = m.hasChildren();
// This is a case from XML. In JSON, you can't have two values.
if (!value.empty() && children)
{
o << value << "," << std::endl;
subnodesToJSON(m, o, level);
}
else if (!value.empty())
o << indent << value;
else
subnodesToJSON(m, o, level);
// There is the case where we have a name and no value to handle. What
// should be done?
}
void toJSON(const MetadataNode& m, std::ostream& o, int level)
{
std::string indent(level * 2, ' ');
std::string name = m.name();
std::string value = m.jsonValue();
bool children = m.hasChildren();
if (name.empty())
name = "unnamed";
// This is a case from XML. In JSON, you can't have two values.
if (!value.empty() && children)
{
o << indent << "\"" << name << "\": " << value << "," << std::endl;
o << indent << "\"" << name << "\": ";
subnodesToJSON(m, o, level);
}
else if (!value.empty())
o << indent << "\"" << name << "\": " << value;
else
{
o << indent << "\"" << name << "\":" << std::endl;
subnodesToJSON(m, o, level);
}
// There is the case where we have a name and no value to handle. What
// should be done?
}
} // unnamed namespace
namespace Utils
{
std::string toJSON(const MetadataNode& m)
{
std::ostringstream o;
toJSON(m, o);
return o.str();
}
void toJSON(const MetadataNode& m, std::ostream& o)
{
if (m.name().empty())
pdal::subnodesToJSON(m, o, 0);
else if (m.kind() == MetadataType::Array)
pdal::arrayToJSON(m.children(), o, 0);
else
{
o << "{" << std::endl;
pdal::toJSON(m, o, 1);
o << std::endl;
o << "}";
}
o << std::endl;
}
namespace
{
#ifdef PDAL_ARBITER_ENABLED
std::string tempFilename(const std::string& path)
{
const std::string tempdir(arbiter::fs::getTempPath());
const std::string basename(arbiter::util::getBasename(path));
return arbiter::util::join(tempdir, basename);
}
#endif
// RAII handling of a temp file to make sure file gets deleted.
class TempFile
{
public:
TempFile(const std::string path) : m_filename(path)
{}
virtual ~TempFile()
{ FileUtils::deleteFile(m_filename); }
const std::string& filename()
{ return m_filename; }
private:
std::string m_filename;
};
class ArbiterOutStream : public std::ofstream
{
public:
ArbiterOutStream(const std::string& localPath,
const std::string& remotePath, std::ios::openmode mode) :
std::ofstream(localPath, mode), m_remotePath(remotePath),
m_localFile(localPath)
{}
virtual ~ArbiterOutStream()
{
#ifdef PDAL_ARBITER_ENABLED
close();
arbiter::Arbiter a;
a.put(m_remotePath, a.getBinary(m_localFile.filename()));
#endif
}
private:
std::string m_remotePath;
TempFile m_localFile;
};
class ArbiterInStream : public std::ifstream
{
public:
ArbiterInStream(const std::string& localPath, const std::string& remotePath,
std::ios::openmode mode) :
m_localFile(localPath)
{
#ifdef PDAL_ARBITER_ENABLED
arbiter::Arbiter a;
a.put(localPath, a.getBinary(remotePath));
open(localPath, mode);
#else
throw pdal_error("Arbiter is not enabled for this configuration!");
#endif
}
private:
TempFile m_localFile;
};
} // unnamed namespace
/**
Create a file (may be on a supported remote filesystem).
\param path Path to file to create.
\param asBinary Whether the file should be written in binary mode.
\return Pointer to the created stream, or NULL.
*/
std::ostream *createFile(const std::string& path, bool asBinary)
{
ostream *ofs(nullptr);
#ifdef PDAL_ARBITER_ENABLED
arbiter::Arbiter a;
const bool remote(a.hasDriver(path) && a.isRemote(path));
if (remote)
{
try
{
ofs = new ArbiterOutStream(tempFilename(path), path,
asBinary ? ios::out | ios::binary : ios::out);
}
catch (arbiter::ArbiterError&)
{}
if (ofs && !ofs->good())
{
delete ofs;
ofs = nullptr;
}
}
else
#endif
ofs = FileUtils::createFile(path, asBinary);
return ofs;
}
/**
Open a file (potentially on a remote filesystem).
\param path Path (potentially remote) of file to open.
\param asBinary Whether the file should be opened binary.
\return Pointer to stream opened for input.
*/
std::istream *openFile(const std::string& path, bool asBinary)
{
#ifdef PDAL_ARBITER_ENABLED
arbiter::Arbiter a;
if (a.hasDriver(path) && a.isRemote(path))
{
try
{
return new ArbiterInStream(tempFilename(path), path,
asBinary ? ios::in | ios::binary : ios::in);
}
catch (arbiter::ArbiterError&)
{
return nullptr;
}
}
#endif
return FileUtils::openFile(path, asBinary);
}
/**
Close an output stream.
\param out Stream to close.
*/
void closeFile(std::ostream *out)
{
FileUtils::closeFile(out);
}
/**
Close an input stream.
\param out Stream to close.
*/
void closeFile(std::istream *in)
{
FileUtils::closeFile(in);
}
/**
Check to see if a file exists.
\param path Path to file.
\return Whether the file exists or not.
*/
bool fileExists(const std::string& path)
{
#ifdef PDAL_ARBITER_ENABLED
arbiter::Arbiter a;
if (a.hasDriver(path) && a.isRemote(path) && a.exists(path))
{
return true;
}
#endif
// Arbiter doesn't handle our STDIN hacks.
return FileUtils::fileExists(path);
}
double computeHausdorff(PointViewPtr srcView, PointViewPtr candView)
{
using namespace Dimension;
KD3Index srcIndex(*srcView);
srcIndex.build();
KD3Index candIndex(*candView);
candIndex.build();
double maxDistSrcToCand = std::numeric_limits<double>::lowest();
double maxDistCandToSrc = std::numeric_limits<double>::lowest();
for (PointId i = 0; i < srcView->size(); ++i)
{
std::vector<PointId> indices(1);
std::vector<double> sqr_dists(1);
PointRef srcPoint = srcView->point(i);
candIndex.knnSearch(srcPoint, 1, &indices, &sqr_dists);
if (sqr_dists[0] > maxDistSrcToCand)
maxDistSrcToCand = sqr_dists[0];
}
for (PointId i = 0; i < candView->size(); ++i)
{
std::vector<PointId> indices(1);
std::vector<double> sqr_dists(1);
PointRef candPoint = candView->point(i);
srcIndex.knnSearch(candPoint, 1, &indices, &sqr_dists);
if (sqr_dists[0] > maxDistCandToSrc)
maxDistCandToSrc = sqr_dists[0];
}
maxDistSrcToCand = std::sqrt(maxDistSrcToCand);
maxDistCandToSrc = std::sqrt(maxDistCandToSrc);
return std::max(maxDistSrcToCand, maxDistCandToSrc);
}
} // namespace Utils
} // namespace pdal