voronoi.hh

// Copyright (C) 2007, 2008, 2009 EPITA Research and Development Laboratory (LRDE)
//
// This file is part of Olena.
//
// Olena 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 of the License.
//
// Olena 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 Olena.  If not, see <http://www.gnu.org/licenses/>.
//
// As a special exception, you may use this file as part of a free
// software project without restriction.  Specifically, if other files
// instantiate templates or use macros or inline functions from this
// file, or you compile this file and link it with other files to produce
// an executable, this file does not by itself cause the resulting
// executable to be covered by the GNU General Public License.  This
// exception does not however invalidate any other reasons why the
// executable file might be covered by the GNU General Public License.

#ifndef MLN_MAKE_VORONOI_HH
# define MLN_MAKE_VORONOI_HH


# include <vector>
# include <map>

# include <mln/core/concept/neighborhood.hh>
# include <mln/core/site_set/p_vertices.hh>
# include <mln/accu/stat/mean.hh>
# include <mln/estim/min_max.hh>
# include <mln/util/graph.hh>

namespace mln
{

  namespace make
  {


    template <typename I, typename N>
    p_vertices<util::graph, fun::i2v::array<mln_site(I)> >
    voronoi (Image<I>& ima_,
             Image<I>& orig_,
             const Neighborhood<N>& nbh);

# ifndef MLN_INCLUDE_ONLY

    template <typename I, typename N>
    inline
    p_vertices<util::graph, fun::i2v::array<mln_site(I)> >
    voronoi (Image<I>& ima_,
             Image<I>& orig_,
             const Neighborhood<N>& nbh)
    {
      typedef algebra::vec<2,float> X;
      typedef mln_value(I) V;
      typedef mln_psite(I) P;

      I& ima = exact(ima_);
      I& orig = exact(orig_);
      util::graph gr;
      V min, max;
      estim::min_max (ima, min, max);
      unsigned nb = max - min + 1;
      fun::i2v::array<P> v(nb);
      std::vector< accu::stat::mean< X > > tab_mean (nb);
      std::map<std::pair<V, V>, bool> m;

      {
        mln_piter(I) p(orig.domain());

        for_all(p)
          {
            if (orig(p) != 0)
              {
                X x = mln_psite(I)(p);
                tab_mean[orig(p) - min].take(x);
              }
          }
      }

      {
        mln_piter(I) p(ima.domain());
        mln_niter(N) n(nbh, p);

        for_all(p)
          {
            for_all (n) if (ima.has(n))
              if (ima(p) != ima(n))
                m[std::pair<V, V>(ima(p) - min, ima(n) - min)] = true;
          }
      }

      for (unsigned i = 0; i < nb; ++i)
        {
          gr.add_vertex();

          v[i] = point2d ((unsigned)tab_mean[i].to_result ()[0],
                                (unsigned)tab_mean[i].to_result ()[1]);
        }

      typename std::map<std::pair<V, V>, bool>::const_iterator it = m.begin ();
      for (; it != m.end (); ++it)
        gr.add_edge((*it).first.first, (*it).first.second);

      p_vertices<util::graph, fun::i2v::array<P> > res(gr, v);
      return res;
    }

# endif // ! MLN_INCLUDE_ONLY

  } // end of namespace mln::make

} // end of namespace mln


#endif // ! MLN_MAKE_VORONOI_HH