basic_maxtree.cc

00001 
00002 #include <cstdlib>
00003 
00004 #include <ntg/int.hh>
00005 #include <oln/basics2d.hh>
00006 #include <oln/lrde/ufmt/basic_maxtree.hh>
00007 #include <oln/lrde/ufmt/log.hh>
00008 
00009 
00010 
00011 void usage(char* argv[])
00012 {
00013   std::cerr << "usage: " << argv[0] << " input.pgm c" << std::endl;
00014   std::cerr << "basic max-tree computation with union-find" << std::endl;
00015   // FIXME: get precise description...
00016   exit(1);
00017 }
00018 
00019 
00020 int main(int argc, char* argv[])
00021 {
00022   if (argc != 3)
00023     usage(argv);
00024 
00025   using namespace oln;
00026   typedef image2d<ntg::int_u8> image_t;
00027 
00028   image_t input = load(argv[1]);
00029 
00030   int c = atoi(argv[2]);
00031   if (not (c == 4 or c == 8))
00032     usage(argv);
00033 
00034   typedef lrde::ufmt::basic_maxtree<image_t> algorithm_t;
00035 
00036   algorithm_t run(input,
00037                   c == 4 ? neighb_c4() : neighb_c8());
00038   run.go();
00039 
00040   std::cout << "n level roots = " << n_level_roots(run) << std::endl;
00041 }

Generated on Tue Feb 20 20:18:28 2007 for Olena by  doxygen 1.5.1