/usr/include/InsightToolkit/Common/itkChainCodePath2D.h is in libinsighttoolkit3-dev 3.20.1-1.
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 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 | /*=========================================================================
Program: Insight Segmentation & Registration Toolkit
Module: itkChainCodePath2D.h
Language: C++
Date: $Date$
Version: $Revision$
Copyright (c) Insight Software Consortium. All rights reserved.
See ITKCopyright.txt or http://www.itk.org/HTML/Copyright.htm for details.
This software is distributed WITHOUT ANY WARRANTY; without even
the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
PURPOSE. See the above copyright notices for more information.
=========================================================================*/
#ifndef __itkChainCodePath2D_h
#define __itkChainCodePath2D_h
#include "itkChainCodePath.h"
#include "itkObjectFactory.h"
#include "itkIndex.h"
#include "itkOffset.h"
#include <vector>
#include <string>
namespace itk
{
/** \class ChainCodePath2D
* \brief Represent a 2D path as a sequence of connected image index offsets
*
* This class is intended to represent sequences of connected indices in a 2D
* image plane. It does so by storing the offset of each index from its
* immediately preceeding, connected, index using a standard Freeman code
* (1=up, 2=up to the right, and so on proceeding clockwise to 8=up
* to the left). The only image index stored directly is thatof the first
* index.
* ChainCodePath2D maps a 1D integer input (step number) to
* a 2D interger output (either an offset or an image index, depending on
* whether Evaluate or EvaluateToIndex is called).
*
* \sa ChainCodePath
* \sa ParametricPath
* \sa Path
* \sa Index
*
* \ingroup PathObjects
*/
class ITKCommon_EXPORT ChainCodePath2D : public
ChainCodePath<2>
{
public:
/** Dimension underlying input image. */
itkStaticConstMacro(Dimension, unsigned int, 2);
/** Standard class typedefs. */
typedef ChainCodePath2D Self;
typedef ChainCodePath<2> Superclass;
typedef SmartPointer<Self> Pointer;
typedef SmartPointer<const Self> ConstPointer;
/** Run-time type information (and related methods). */
itkTypeMacro(ChainCodePath2D, ChainCodePath);
/** OutputType typedef support. */
typedef Superclass::OutputType OutputType;
typedef Superclass::InputType InputType;
/** The output type of this function is an Index */
typedef OutputType OffsetType;
typedef Index<2> IndexType;
/** ChainCodeType is a usless relic of the parent class */
typedef Superclass::ChainCodeType ChainCodeType;
typedef Superclass::ChainCodeSizeType ChainCodeSizeType;
/** ChainCodePath2D stores its data as a Freeman-encoded chain code */
typedef std::vector<int> ChainCode2DType;
// Functions inherited from Path
/** Evaluate the chaincode for the offset at the specified path-position. */
virtual OutputType Evaluate( const InputType & input ) const;
/** Like Evaluate(), but returns the index at the specified path-position. */
virtual IndexType EvaluateToIndex( const InputType & input ) const;
/** Increment the input variable passed by reference and return the offset
* stored at the previous path-position. If the chaincode is unable to be
* incremented, input is not changed and an offset of zero is returned, which
* may be used to check for the end of the chain code. */
virtual OffsetType IncrementInput(InputType & input) const;
// Functions specific to ChainCodePath and its descendents
/** New() method for dynamic construction */
itkNewMacro( Self );
/** How many steps in the chaincode? */
inline ChainCodeSizeType NumberOfSteps() const { return m_Chain2D.size(); }
/** Insert a new step into the chaincode at a specified position */
inline void InsertStep( InputType position, int encodedStep )
{
m_Chain2D.insert( m_Chain2D.begin()+position, encodedStep );
this->Modified();
}
inline void InsertStep( InputType position, OffsetType step )
{
m_Chain2D.insert( m_Chain2D.begin()+position, EncodeOffset(step) );
this->Modified();
}
/** Change the direction of a step in the chaincode */
inline void ChangeStep( InputType position, int encodedStep )
{
m_Chain2D[position]=encodedStep;
this->Modified();
}
inline void ChangeStep( InputType position, OffsetType step )
{
m_Chain2D[position]=EncodeOffset(step);
this->Modified();
}
/** Remove all steps from the chain code */
virtual inline void Clear()
{
m_Chain2D.clear();
this->Modified();
}
std::string GetChainCodeAsString(void) const;
protected:
ChainCodePath2D();
~ChainCodePath2D();
void PrintSelf(std::ostream& os, Indent indent) const;
/** Encode and Decode between an offset and a Freeman code */
inline int EncodeOffset( OffsetType step ) const
{
return m_FreemanCode[ step[0] + 1 ][ step[1] + 1 ];
}
inline OffsetType DecodeOffset( int encodedStep ) const
{
return m_ReverseFreemanCode[ encodedStep ];
}
private:
ChainCodePath2D(const Self&); //purposely not implemented
void operator=(const Self&); //purposely not implemented
ChainCode2DType m_Chain2D; // the Freeman-encoded chain code
// FreemanCode[][] implements a lookup table for converting offsets to a
// Freeman code. Within each dimension, the only allowable offset values are
// { -1, 0, 1 }. The y-axis is assumed to point up. It is initialized in the
// constructor. Use it as follows:
//
// encodedValue = m_FreemanCode[ x offset + 1 ][ y offset + 1 ]
//
int m_FreemanCode[3][3];
// m_ReverseFreemanCode[ encodedValue ] implements a lookup table for the
// inverse of m_FreemanCode[][]. It is initialized in the constructor.
OffsetType m_ReverseFreemanCode[9];
};
} // end namespace itk
#endif
|