Milena (Olena)  User documentation 2.0a Id
 All Classes Namespaces Functions Variables Typedefs Enumerator Groups Pages
distance_and_closest_point_geodesic.hh
1 // Copyright (C) 2008, 2009 EPITA Research and Development Laboratory (LRDE)
2 //
3 // This file is part of Olena.
4 //
5 // Olena is free software: you can redistribute it and/or modify it under
6 // the terms of the GNU General Public License as published by the Free
7 // Software Foundation, version 2 of the License.
8 //
9 // Olena is distributed in the hope that it will be useful,
10 // but WITHOUT ANY WARRANTY; without even the implied warranty of
11 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
12 // General Public License for more details.
13 //
14 // You should have received a copy of the GNU General Public License
15 // along with Olena. If not, see <http://www.gnu.org/licenses/>.
16 //
17 // As a special exception, you may use this file as part of a free
18 // software project without restriction. Specifically, if other files
19 // instantiate templates or use macros or inline functions from this
20 // file, or you compile this file and link it with other files to produce
21 // an executable, this file does not by itself cause the resulting
22 // executable to be covered by the GNU General Public License. This
23 // exception does not however invalidate any other reasons why the
24 // executable file might be covered by the GNU General Public License.
25 
26 #ifndef MLN_TRANSFORM_DISTANCE_AND_CLOSEST_POINT_GEODESIC_HH
27 # define MLN_TRANSFORM_DISTANCE_AND_CLOSEST_POINT_GEODESIC_HH
28 
32 
33 # include <mln/canvas/distance_geodesic.hh>
34 # include <mln/transform/internal/closest_point_functor.hh>
35 
36 # include <mln/data/fill.hh>
37 # include <mln/util/couple.hh>
38 
39 
40 namespace mln
41 {
42 
43  namespace transform
44  {
45 
57  template <typename I, typename N, typename D>
58  util::couple<mln_ch_value(I,D), mln_ch_value(I,mln_psite(I))>
59  distance_and_closest_point_geodesic(const Image<I>& input,
60  const Neighborhood<N>& nbh,
61  D max);
62 
63 
76  template <typename P, typename N, typename D>
77  util::couple<mln_image_from_grid(mln_grid(P),D),
78  mln_image_from_grid(mln_grid(P),unsigned)>
79  distance_and_closest_point_geodesic(const p_array<P>& pset,
80  const box<P>& closest_point_domain,
81  const Neighborhood<N>& nbh,
82  D max);
83 
84 
85 # ifndef MLN_INCLUDE_ONLY
86 
87  template <typename I, typename N, typename D>
88  inline
89  util::couple<mln_ch_value(I,D), mln_ch_value(I, mln_psite(I))>
91  const Neighborhood<N>& nbh,
92  D max)
93  {
94  trace::entering("transform::distance_closest_point_geodesic");
95 
96  mln_precondition(exact(input).is_valid());
97  mln_precondition(exact(nbh).is_valid());
98 
99  internal::closest_point_functor_with_sites<I> f;
100  mln_ch_value(I,D) dmap = mln::canvas::distance_geodesic(input, nbh,
101  max, f);
102 
103  trace::exiting("transform::distance_and_closest_point_geodesic");
104  return make::couple(dmap, f.cp_ima);
105  }
106 
107  template <typename P, typename N, typename D>
108  inline
111  const box<P>& closest_point_domain,
112  const Neighborhood<N>& nbh,
113  D max)
114  {
115  trace::entering("transform::distance_and_closest_point_geodesic");
116 
117  mln_precondition(closest_point_domain.is_valid());
118  mln_precondition(exact(nbh).is_valid());
119  mln_precondition(geom::bbox(pset) <= closest_point_domain);
120 
121  typedef mln_image_from_grid(mln_grid(P), bool) I;
122  internal::closest_point_functor_with_indexes<I> f(pset);
123 
124  I ima(closest_point_domain);
125  data::fill(ima, false);
126  data::fill((ima | pset).rw(), true);
127 
128  mln_ch_value(I,D) dmap = mln::canvas::distance_geodesic(ima, nbh, max, f);
129 
130  trace::exiting("transform::distance_and_closest_point_geodesic");
131  return make::couple(dmap, f.cp_ima);
132  }
133 
134 # endif // ! MLN_INCLUDE_ONLY
135 
136  } // end of namespace mln::transform
137 
138 } // end of namespace mln
139 
140 
141 #endif // ! MLN_TRANSFORM_DISTANCE_AND_CLOSEST_POINT_GEODESIC_HH