testReducedMedialAxis.cpp File Reference

#include <iostream>
#include <array>
#include "DGtal/base/Common.h"
#include "DGtal/helpers/StdDefs.h"
#include "DGtal/geometry/volumes/distance/PowerMap.h"
#include "DGtal/geometry/volumes/distance/ReducedMedialAxis.h"
#include "DGtal/geometry/volumes/distance/ExactPredicateLpPowerSeparableMetric.h"
#include "DGtal/kernel/sets/DigitalSetDomain.h"
#include "DGtal/kernel/sets/DigitalSetBySTLSet.h"

Go to the source code of this file.

Functions
bool	testReducedMedialAxis (std::array< bool, 2 > const &aPeriodicity={{ false, false }})
int	main (int argc, char **argv)

Detailed Description

This program is free software: you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version.

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.

You should have received a copy of the GNU General Public License along with this program. If not, see http://www.gnu.org/licenses/.

Author

David Coeurjolly (david.nosp@m..coe.nosp@m.urjol.nosp@m.ly@l.nosp@m.iris..nosp@m.cnrs.nosp@m..fr ) Laboratoire d'InfoRmatique en Image et Systèmes d'information - LIRIS (CNRS, UMR 5205), CNRS, France

Date

2012/12/08

Functions for testing class ReducedMedialAxis.

This file is part of the DGtal library.

Definition in file testReducedMedialAxis.cpp.

Function Documentation

main()

int main	(	int	argc,
		char **	argv
	)

Definition at line 161 of file testReducedMedialAxis.cpp.

{
  trace.beginBlock ( "Testing class ReducedMedialAxis" );
  trace.info() << "Args:";
  for ( int i = 0; i < argc; ++i )
    trace.info() << " " << argv[ i ];
  trace.info() << endl;
 
  bool res =
       testReducedMedialAxis()
    && testReducedMedialAxis( {{ true,  false }} )
    && testReducedMedialAxis( {{ false, true  }} )
    && testReducedMedialAxis( {{ true,  true  }} )
  ; // && ... other tests
 
  trace.emphase() << ( res ? "Passed." : "Error." ) << endl;
  trace.endBlock();
  return res ? 0 : 1;
}

References DGtal::Trace::beginBlock(), DGtal::Trace::emphase(), DGtal::Trace::endBlock(), DGtal::Trace::info(), testReducedMedialAxis(), and DGtal::trace.

testReducedMedialAxis()

bool testReducedMedialAxis

(

std::array< bool, 2 > const &

aPeriodicity = {{ false, false }}

)

Example of a test. To be completed.

Definition at line 53 of file testReducedMedialAxis.cpp.

                                                                    {{ false, false }} )
{
  unsigned int nbok = 0;
  unsigned int nb = 0;
 
  trace.beginBlock ( "Testing PowerMap2D ..." );
 
  Z2i::Domain domain(Z2i::Point(0,0),Z2i::Point(10,10));
  Z2i::Domain domainLarge(Z2i::Point(0,0),Z2i::Point(10,10));
 
  DigitalSetBySTLSet<Z2i::Domain > set(domain);
  set.insertNew(Z2i::Point(3,3));
  //set.insertNew(Z2i::Point(3,7));
  set.insertNew(Z2i::Point(7,7));
 
  using SetDomain = DigitalSetDomain< DigitalSetBySTLSet<Z2i::Domain > >;
  using Image = ImageContainerBySTLMap< SetDomain , DGtal::int64_t>;
  Image image( new SetDomain( set ) );
 
  //Setting some values
  image.setValue(Z2i::Point(3,3), 9);
  //  image.setValue(Z2i::Point(3,7), 0);
  image.setValue(Z2i::Point(7,7), 16);
 
  Z2i::L2PowerMetric l2power;
  PowerMap<Image, Z2i::L2PowerMetric> power(&domainLarge, &image, &l2power, aPeriodicity );
 
  for(unsigned int i=0; i<11; i++)
    {
      for(unsigned int j=0; j<11; j++)
        if (image.domain().isInside(Z2i::Point(i,j)))
          trace.info()<< image(Z2i::Point(i,j))<<" ";
        else
          trace.info()<< "0 ";
 
      trace.info()<<std::endl;
    }
  trace.info()<<std::endl;
 
  //Power Map
  for(unsigned int i=0; i<11; i++)
    {
      for(unsigned int j=0; j<11; j++)
        trace.info()<< power(Z2i::Point(i,j))[0]<<","<<power(Z2i::Point(i,j))[1]<<" ";
      trace.info()<<std::endl;
    }
 
  trace.info()<<std::endl;
  //Reconstruction
  for(unsigned int i=0; i<11; i++)
    {
      for(unsigned int j=0; j<11; j++)
        {
          Z2i::Point p(i,j);
          auto dist = (i-power(p)[0])*(i-power(p)[0]) +
            ( j-power(p)[1])*(j-power(p)[1])  - image(power.projectPoint(power(p)));
          trace.info()<< dist;
        }
      std::cerr<<std::endl;
    }
  trace.info()<<std::endl;
 
  //Medial Axis extraction
  ReducedMedialAxis<PowerMap<Image, Z2i::L2PowerMetric> >::Type  rdma = ReducedMedialAxis< PowerMap<Image, Z2i::L2PowerMetric> >::getReducedMedialAxisFromPowerMap(power);
 
  //Reconstruction
  for(unsigned int i=0; i<11; i++)
    {
      for(unsigned int j=0; j<11; j++)
        {
          Z2i::Point p(i,j);
          if (rdma.domain().isInside(p) )
            trace.info()<< rdma(p);
          else
            trace.info()<< " - ";
 
        }
      std::cerr<<std::endl;
    }
  trace.info()<<std::endl;
 
 
  ++nbok;
  nb++;
  trace.info() << "(" << nbok << "/" << nb << ") "
               << "true == true" << std::endl;
  trace.endBlock();
 
  bool isEqual = true;
  for ( auto const & pt : domain )
    {
      const Image::Value a = image.domain().isInside(pt) ? image(pt) : 0;
      const Image::Value b = rdma.domain().isInside(pt) ? rdma(pt) : 0;
      if ( a != b )
        {
          isEqual = false;
          break;
        }
    }
 
  trace.info() << "Equality ? " << isEqual << std::endl;
 
  return nbok == nb;
}

Referenced by main().