#ifndef __fpa__Image__SkeletonFilter__hxx__
#define __fpa__Image__SkeletonFilter__hxx__

/* TODO
   #include <queue>
   #include <itkImageRegionConstIteratorWithIndex.h>
*/
#include <fpa/Base/Functors/Inverse.h>
#include <fpa/Image/Functors/SimpleNeighborhood.h>
#include <itkImageRegionIteratorWithIndex.h>

// -------------------------------------------------------------------------
#define fpa_Image_SkeletonFilter_OutputMacro( o_n, o_t )                \
  template< class _TImage >                                             \
  typename fpa::Image::SkeletonFilter< _TImage >::                      \
  o_t* fpa::Image::SkeletonFilter< _TImage >::                          \
  Get##o_n( )                                                           \
  {                                                                     \
    return(                                                             \
      dynamic_cast< o_t* >(                                             \
        this->itk::ProcessObject::GetOutput( this->m_##o_n##Idx )       \
        )                                                               \
      );                                                                \
  }

fpa_Image_SkeletonFilter_OutputMacro( Skeleton, TSkeleton );
fpa_Image_SkeletonFilter_OutputMacro( EndPoints, TIndices );
fpa_Image_SkeletonFilter_OutputMacro( Bifurcations, TIndices );
fpa_Image_SkeletonFilter_OutputMacro( Marks, TMarks );

// -------------------------------------------------------------------------
template< class _TImage >
fpa::Image::SkeletonFilter< _TImage >::
SkeletonFilter( )
  : Superclass( )
{
  typedef typename _TImage::PixelType _TPixel;
  typedef typename _TImage::Superclass _TImageBase;
  typedef fpa::Image::Functors::SimpleNeighborhood< _TImageBase > _TNeighFunc;
  typedef fpa::Base::Functors::Inverse< _TPixel, _TPixel > _TInvFunc;

  unsigned int nOutputs = this->GetNumberOfRequiredOutputs( );
  this->SetNumberOfRequiredOutputs( nOutputs + 4 );
  this->m_EndPointsIdx = nOutputs;
  this->m_BifurcationsIdx = nOutputs + 1;
  this->m_SkeletonIdx = nOutputs + 2;
  this->m_MarksIdx = nOutputs + 3;

  typename TIndices::Pointer end_points = TIndices::New( );
  typename TIndices::Pointer bifurcations = TIndices::New( );
  typename TSkeleton::Pointer skeleton = TSkeleton::New( );
  typename TMarks::Pointer marks = TMarks::New( );
  this->SetNthOutput( this->m_EndPointsIdx, end_points.GetPointer( ) );
  this->SetNthOutput( this->m_BifurcationsIdx, bifurcations.GetPointer( ) );
  this->SetNthOutput( this->m_SkeletonIdx, skeleton.GetPointer( ) );
  this->SetNthOutput( this->m_MarksIdx, marks.GetPointer( ) );

  typename _TNeighFunc::Pointer nfunc = _TNeighFunc::New( );
  nfunc->SetOrder( 2 );
  this->SetNeighborhoodFunction( nfunc );

  typename _TInvFunc::Pointer ifunc = _TInvFunc::New( );
  this->SetCostConversionFunction( ifunc );
}

// -------------------------------------------------------------------------
template< class _TImage >
fpa::Image::SkeletonFilter< _TImage >::
~SkeletonFilter( )
{
}

// -------------------------------------------------------------------------
template< class _TImage >
void fpa::Image::SkeletonFilter< _TImage >::
_BeforeGenerateData( )
{
  this->Superclass::_BeforeGenerateData( );
  this->m_SkeletonQueue.clear( );
}

// -------------------------------------------------------------------------
template< class _TImage >
void fpa::Image::SkeletonFilter< _TImage >::
_UpdateResult( const _TQueueNode& n )
{
  typedef typename _TSkeletonQueue::value_type _TSkeletonQueueValue;

  this->Superclass::_UpdateResult( n );

  // Update skeleton candidates
  double d = double( this->GetInput( )->GetPixel( n.Vertex ) );
  if( d >= double( 0 ) )
  {
    d += double( 1e-5 );
    double v = double( n.Result ) / ( d * d );
    this->m_SkeletonQueue.insert( _TSkeletonQueueValue( v, n.Vertex ) );

  } // fi
}

// -------------------------------------------------------------------------
template< class _TImage >
void fpa::Image::SkeletonFilter< _TImage >::
_AfterGenerateData( )
{
  this->Superclass::_AfterGenerateData( );
  this->_EndPoints( );
  this->_Skeleton( );
}

// -------------------------------------------------------------------------
template< class _TImage >
void fpa::Image::SkeletonFilter< _TImage >::
_EndPoints( )
{
  typedef itk::ImageRegionIteratorWithIndex< TMarks > _TMarksIt;

  /* TODO
     typedef itk::ImageRegionConstIteratorWithIndex< _TImage > _TDistMapIt;
     typedef itk::ImageRegionConstIteratorWithIndex< _TOutput > _TOutputIt;
     typedef std::multimap< double, TIndex, std::greater< double > > _TQueue;
     typedef typename _TQueue::value_type _TQueueValue;
  */

  static const double _eps = std::sqrt( double( Self::Dimension + 1 ) );
  auto input = this->GetInput( );
  auto mst = this->GetMinimumSpanningTree( );
  auto marks = this->GetMarks( );
  auto& end_points = this->GetEndPoints( )->Get( );

  // Some values
  marks->SetLargestPossibleRegion( input->GetLargestPossibleRegion( ) );
  marks->SetRequestedRegion( input->GetRequestedRegion( ) );
  marks->SetBufferedRegion( input->GetBufferedRegion( ) );
  marks->SetSpacing( input->GetSpacing( ) );
  marks->SetOrigin( input->GetOrigin( ) );
  marks->SetDirection( input->GetDirection( ) );
  marks->Allocate( );
  marks->FillBuffer( 0 );

  // BFS from maximum queue
  auto region = input->GetRequestedRegion( );
  while( this->m_SkeletonQueue.size( ) > 0 )
  {
    // Get node
    auto nIt = this->m_SkeletonQueue.begin( );
    auto n = *nIt;
    this->m_SkeletonQueue.erase( nIt );

    // Mark it and update end-points
    unsigned char m = marks->GetPixel( n.second );
    if( m != 0 )
      continue;
    marks->SetPixel( n.second, 1 );
    end_points.insert( n.second );

    // Mark path
    auto spac = marks->GetSpacing( );
    typename TMST::TPath::Pointer path;
    mst->GetPath( path, n.second );
    for( unsigned long i = 0; i < path->GetSize( ); ++i )
    {
      TIndex idx = path->GetVertex( i );
      typename _TImage::PointType cnt;
      input->TransformIndexToPhysicalPoint( idx, cnt );
      double r = double( input->GetPixel( idx ) ) * _eps;

      TIndex i0, i1;
      for( unsigned int d = 0; d < Self::Dimension; ++d )
      {
        long off = long( std::ceil( r / double( spac[ d ] ) ) );
        if( off < 3 )
          off = 3;
        i0[ d ] = idx[ d ] - off;
        i1[ d ] = idx[ d ] + off;

        if( i0[ d ] < region.GetIndex( )[ d ] )
          i0[ d ] = region.GetIndex( )[ d ];

        if( i1[ d ] >= region.GetIndex( )[ d ] + region.GetSize( )[ d ] )
          i1[ d ] = region.GetIndex( )[ d ] + region.GetSize( )[ d ] - 1;

      } // rof

      typename _TImage::SizeType size;
      for( unsigned int d = 0; d < Self::Dimension; ++d )
        size[ d ] = i1[ d ] - i0[ d ] + 1;

      typename _TImage::RegionType neighRegion;
      neighRegion.SetIndex( i0 );
      neighRegion.SetSize( size );

      _TMarksIt mIt( marks, neighRegion );
      for( mIt.GoToBegin( ); !mIt.IsAtEnd( ); ++mIt )
      {
        TIndex w = mIt.GetIndex( );
        typename _TImage::PointType p;
        marks->TransformIndexToPhysicalPoint( w, p );
        mIt.Set( 1 );

      } // rof

    } // rof

  } // elihw
}

// -------------------------------------------------------------------------
template< class _TImage >
void fpa::Image::SkeletonFilter< _TImage >::
_Skeleton( )
{
  auto mst = this->GetMinimumSpanningTree( );
  auto skeleton = this->GetSkeleton( );
  auto& end_points = this->GetEndPoints( )->Get( );

  typedef typename TMST::TPath _TPath;
  for( auto eIt = end_points.begin( ); eIt != end_points.end( ); ++eIt )
  {
    typename _TPath::Pointer path;
    mst->GetPath( path, *eIt );
    skeleton->AddBranch( path );

  } // rof
}

// -------------------------------------------------------------------------
/* TODO
   template< class _TImage >
   void fpa::Image::SkeletonFilter< _TImage >::
   _Skeleton(
   const TDistanceMap* dmap,
   const TCostMap* cmap,
   const TMST* mst,
   const TIndicesData& end_points,
   TIndicesData& bifurcations,
   TSkeleton* skeleton
   )
   {
   }
*/

#endif // __fpa__Image__SkeletonFilter__hxx__

// eof - $RCSfile$