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
|
//##########################################################################
//# #
//# CLOUDCOMPARE #
//# #
//# 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; version 2 or later of the License. #
//# #
//# 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. #
//# #
//# COPYRIGHT: CloudCompare project #
//# #
//##########################################################################
#ifndef SAITO_SQUARED_DISTANCE_TRANSFORM_HEADER
#define SAITO_SQUARED_DISTANCE_TRANSFORM_HEADER
// Inspired from bil_edt.cxx (VXL) by Ricardo Fabbri (rfabbri), Brown University (rfabbri@lems.brown.edu)
//Local
#include "Grid3D.h"
#include "MathTools.h"
namespace CCLib
{
class GenericProgressCallback;
class NormalizedProgress;
class GenericIndexedMesh;
class GenericCloud;
//! Class to compute a Squared Distance Field with the Saito algorithm on a 3D grid
class CC_CORE_LIB_API SaitoSquaredDistanceTransform : public Grid3D<unsigned>, public MathTools
{
public:
//! Default constructor
SaitoSquaredDistanceTransform() = default;
//! Initializes the grid
/** The memory for the grid must be explicitelty reserved prior to any action.
\return true if the initialization succeeded
**/
inline bool initGrid(const Tuple3ui& gridSize)
{
return Grid3D<GridElement>::init(gridSize.x, gridSize.y, gridSize.z, 0, 0); //margin = 0 (we need continuous memory)
}
//! Initializes the distance transform with a mesh
inline bool initDT( GenericIndexedMesh* mesh,
PointCoordinateType cellLength,
const CCVector3& gridMinCorner,
GenericProgressCallback* progressCb = nullptr)
{
return intersecthWith(mesh, cellLength, gridMinCorner, 1, progressCb);
}
//! Initializes the distance transform with a cloud
inline bool initDT( GenericCloud* cloud,
PointCoordinateType cellLength,
const CCVector3& gridMinCorner,
GenericProgressCallback* progressCb = nullptr)
{
return intersecthWith(cloud, cellLength, gridMinCorner, 1, progressCb);
}
//! Computes the exact Squared Distance Transform on the whole grid
/** Propagates the distances on the whole grid.
Base on the implementation by R. Fabbri (which is itslef based on
two independent implementations by O. Cuisenaire and J. C. Torelli).
PAPER
T. Saito and J.I. Toriwaki, "New algorithms for Euclidean distance
transformations of an n-dimensional digitised picture with applications",
Pattern Recognition, 27(11), pp. 1551-1565, 1994
\warning Output distances are squared
\param progressCb progress callback (optional)
\return success
**/
inline bool propagateDistance(GenericProgressCallback* progressCb = nullptr) { return SDT_3D(*this, progressCb); }
protected:
//! 1D Euclidean Distance Transform
static bool EDT_1D(GridElement* slice, std::size_t r, std::size_t c);
//! 2D Exact Squared Distance Transform
static bool SDT_2D(Grid3D<GridElement>& image, std::size_t sliceIndex, const std::vector<GridElement>& sq);
//! 3D Exact Squared Distance Transform
static bool SDT_3D(Grid3D<GridElement>& image, GenericProgressCallback* progressCb = nullptr);
};
}
#endif //SIGNED_SAITO_DISTANCE_TRANSFORM_HEADER
|
