/usr/include/pdal/io/GDALGrid.hpp is in libpdal-dev 1.4.0-1+b1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 | /******************************************************************************
* Copyright (c) 2016, Hobu Inc. (info@hobu.co)
*
* 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 <math.h>
#include <memory>
#include <string>
#include <vector>
namespace pdal
{
class GDALGrid
{
public:
static const int statCount = 1;
static const int statMin = 2;
static const int statMax = 4;
static const int statMean = 8;
static const int statStdDev = 16;
static const int statIdw = 32;
GDALGrid(size_t width, size_t height, double edgeLength, double radius,
double noData, int outputTypes, size_t windowSize);
// Get the number of bands represented by this grid.
int numBands() const;
// Return a pointer to the data in a raster band, row-major ordered.
uint8_t *data(const std::string& name);
// Add a point to the raster grid.
void addPoint(double x, double y, double z);
// Compute final values after all points have been added.
void finalize();
size_t width() const
{ return m_width; }
size_t height() const
{ return m_height; }
double noData() const
{ return m_noData; }
private:
size_t m_width;
size_t m_height;
size_t m_windowSize;
double m_edgeLength;
double m_radius;
double m_noData;
typedef std::vector<double> DataVec;
typedef std::unique_ptr<DataVec> DataPtr;
DataPtr m_count;
DataPtr m_min;
DataPtr m_max;
DataPtr m_mean;
DataPtr m_stdDev;
DataPtr m_idw;
DataPtr m_idwDist;
int m_outputTypes;
// Find an index into the actual storage given a grid coordinate.
size_t index(size_t i, size_t j)
{ return (j * m_width) + i; }
// Determine if a cell i, j has no associated points.
bool empty(size_t i, size_t j)
{ return empty(index(i, j)); }
// Determine if a cell with index \c idx has no associated points.
bool empty(size_t idx)
{ return ((*m_count)[idx] <= 0); }
// Convert an absolute X position to a horizontal cell index.
int horizontalIndex(double x)
{ return x / m_edgeLength; }
// Convert an absolute Y position to a vertical cell index.
int verticalIndex(double y)
{ return m_height - (y / m_edgeLength) - 1; }
// Return the absolute horizontal position of the center of a cell given
// the cell i index.
double horizontalPos(size_t i)
{ return (i + .5) * m_edgeLength; }
// Return the absolute vertical position of the center of a cell given
// the cell j index.
double verticalPos(size_t j)
{ return (m_height - (j + .5)) * m_edgeLength; }
// Determine the distance from the center of cell at coordinate i, j to
// a point at absolute coordinate x, y.
double distance(size_t i, size_t j, double x, double y)
{
double x1 = horizontalPos(i);
double y1 = verticalPos(j);
return sqrt(pow(x1 - x, 2) + pow(y1 - y, 2));
}
// Update cell at i, j with value at a distance.
void update(int i, int j, double val, double dist);
// Fill cell at index \c i with the nondata value.
void fillNodata(size_t i);
// Fill an empty cell with a value inverse-distance averaged from
// surrounding cells.
void windowFill()
{
for (size_t i = 0; i < width(); ++i)
for (size_t j = 0; j < height(); ++j)
if (empty(i, j))
windowFill(i, j);
}
// Fill empty cell at dstI, dstJ with inverse-distance weighted values
// from neighboring cells.
void windowFill(size_t dstI, size_t dstJ);
// Cumulate data from a source cell to a destination cell when doing
// a window fill.
void windowFillCell(size_t srcIdx, size_t dstIdx, double distance);
};
typedef std::unique_ptr<GDALGrid> GDALGridPtr;
} //namespace pdal
|