meshvoronoi_d.h

Go to the documentation of this file.

/* This software and supporting documentation are distributed by
 *     Institut Federatif de Recherche 49
 *     CEA/NeuroSpin, Batiment 145,
 *     91191 Gif-sur-Yvette cedex
 *     France
 *
 * This software is governed by the CeCILL-B license under
 * French law and abiding by the rules of distribution of free software.
 * You can  use, modify and/or redistribute the software under the
 * terms of the CeCILL-B license as circulated by CEA, CNRS
 * and INRIA at the following URL "http://www.cecill.info".
 *
 * As a counterpart to the access to the source code and  rights to copy,
 * modify and redistribute granted by the license, users are provided only
 * with a limited warranty  and the software's author,  the holder of the
 * economic rights,  and the successive licensors  have only  limited
 * liability.
 *
 * In this respect, the user's attention is drawn to the risks associated
 * with loading,  using,  modifying and/or developing or reproducing the
 * software by the user in light of its specific status of free software,
 * that may mean  that it is complicated to manipulate,  and  that  also
 * therefore means  that it is reserved for developers  and  experienced
 * professionals having in-depth computer knowledge. Users are therefore
 * encouraged to load and test the software's suitability as regards their
 * requirements in conditions enabling the security of their systems and/or
 * data to be ensured and,  more generally, to use and operate it in the
 * same conditions as regards security.
 *
 * The fact that you are presently reading this means that you have had
 * knowledge of the CeCILL-B license and that you accept its terms.
 */
 
 
#ifndef AIMS_DISTANCEMAP_MESHVORONOI_D_H
#define AIMS_DISTANCEMAP_MESHVORONOI_D_H
 
 
#include <aims/distancemap/meshvoronoi.h>
#include <aims/distancemap/meshdistance.h>
#include <aims/distancemap/stlsort.h>
#include <aims/mesh/surfaceOperation.h>
#include <aims/mesh/surface.h>
#include <float.h>
#include <stack>
#include <set>
 
namespace aims
{
  namespace meshdistance
  {
 
// Compute a geodesic voronoi diagram (dist = MAX_FLOAT,object=true ) of objects defined in inittex. 
// The background has the label 0 and the objects have a positive label 
// The distance can be euclidean geodesic (connexity=false) or just the connexity of the triangulation(connexity=true)
// This function can as well be used for dilation(object=true)/erosion(object=false) 
// using the dist parameter as the size of the structuring element
template <class T>
Texture<T> MeshVoronoiT ( const AimsSurface<3,Void> & mesh,
                          const Texture<T> & inittex,
                          const T & Back, const T & For,
                          float dist, bool connexity, bool object)
{
  Texture<T>                            vor = inittex;
  Texture<float>                        tex;
  const std::vector<Point3df>           & vert = mesh.vertex();
  const std::vector< AimsVector<uint,3> >       & poly = mesh.polygon();
  unsigned                              i, n = vert.size();
 
  ASSERT( inittex.nItem() == n );
 
  tex.reserve(n);
 
  // neighbours map
 
  std::map<unsigned, std::set<unsigned> >       neighbours;
  unsigned                      v1, v2, v3;
 
  for( i=0; i<poly.size(); ++i )
    {
      v1 = poly[i][0];
      v2 = poly[i][1];
      v3 = poly[i][2];
      if(inittex.item(v1)!=For 
         && inittex.item(v2)!=For)
        {
          neighbours[v1].insert( v2 );
          neighbours[v2].insert( v1 );
        }
      if(inittex.item(v1)!=For 
         && inittex.item(v3)!=For) 
        {
          neighbours[v1].insert( v3 );
          neighbours[v3].insert( v1 );
        }
      if(inittex.item(v2)!=For 
         && inittex.item(v3)!=For)  
        {
          neighbours[v2].insert( v3 );
          neighbours[v3].insert( v2 );
        }
    }
  
 
  // init distance texture
  if (object)
    {
      for( i=0; i<n; ++i )
        {
          if( inittex.item(i) == Back )
            tex.push_back( FLT_MAX );
          else 
            if( inittex.item(i) == For )
              tex.push_back( MESHDISTANCE_FORBIDDEN );
            else
              tex.push_back( 0 );
        }
    }
  else
    {
      for( i=0; i<n; ++i )
        {
          if( inittex.item(i) == Back )
            tex.push_back( 0 );
          else 
            if( inittex.item(i) == For )
              tex.push_back( MESHDISTANCE_FORBIDDEN );
            else
              tex.push_back( FLT_MAX );
        }
    }
  
  std::multimap<float,unsigned> front1, front2;
  std::multimap<float,unsigned> *cfront = &front1;
  std::multimap<float,unsigned>::iterator       iv;
  std::set<unsigned>                            neigh;
  std::set<unsigned>::iterator          in, fn,iu,eu = neigh.end();
  float                                 d=0, d2, l;
  Point3df                              pos;
 
  // init first front
  for( i=0; i<n; ++i )
    if( tex.item(i) == 0 )
      front1.insert( std::pair<float,unsigned>(  0 , i ) );
 
 
  //TimeTexture<T>      tvor;
  //    loop until current front is empty
  while( cfront->size() > 0 && d < dist )
    {
      iv=cfront->begin();
      i = (*iv).second;
      d = (*iv).first;  
      cfront->erase(iv);
      neigh.erase(i);  
      for( in=neighbours[i].begin(), fn=neighbours[i].end(); in!=fn; ++in )
      {
        d2 = tex.item( *in );
        pos =  vert[i] - vert[*in];
        if (!connexity)
          l = sqrt( pos[0] * pos[0] + pos[1] * pos[1] + pos[2] * pos[2] );
        else
          l = 1;
 
        if( d2 > d + l &&  vor.item( *in ) != For)
          {
            iu = neigh.find(*in);
            if (iu != eu)
              {
                std::pair<std::multimap<float,unsigned>::iterator,
                  std::multimap<float,unsigned>::iterator>
                  im = cfront->equal_range(tex.item( *in ) );
                std::multimap<float,unsigned>::iterator em;
                ++im.second;
                for (em = im.first; em != im.second && em->second != *in ;
                  ++em) {}
                cfront->erase(em);
                neigh.erase(iu);
              }
            tex.item( *in ) = d + l;
            neigh.insert( *in );
            cfront->insert(std::pair<float,unsigned>( tex.item( *in ), *in ) );
            vor.item( *in ) = vor.item( i );
 
          }
      }
 
    }
 
  return (vor);
 
}
 
  }
}
 
 
#endif