$extrastylesheet
Functions | |
template<typename G , typename L > | |
void | find_graph_link (Graph< G > &g_, const component_set< L > &comps, unsigned current_comp, int dmax, const typename L::site &c) |
template<typename F > | |
mln::util::couple< bool, typename scribo_support_(F)::site > | find_link (Link_Functor< F > &functor, unsigned current_object, anchor::Type anchor) |
template<typename L > | |
unsigned | find_root (object_groups< L > &parent, unsigned x) |
bool | have_link_valid (const mln::util::array< unsigned > &left_link, const mln::util::array< unsigned > &right_link, unsigned i) |
template<typename L > | |
bool | is_link_valid (const object_links< L > &left_link, const object_links< L > &right_link, unsigned i) |
template<typename I , typename J > | |
mln::trait::concrete< I >::ret | rd (const Image< I > &ima, const Image< J > &constraint) |
template<typename I , typename G > | |
void | update_graph_link (const Image< I > &lbl_, Graph< G > &g_, const typename I::site &p, const typename I::site &c, unsigned i, int dmax) |
Namespace of internal routines grouping text components.
void scribo::primitive::internal::find_graph_link | ( | Graph< G > & | g_, |
const component_set< L > & | comps, | ||
unsigned | current_comp, | ||
int | dmax, | ||
const typename L::site & | c | ||
) |
Find a neighbor of a component in a specific range if it exists.
g_ | The link graph. |
comps | A component set. |
current_comp | The current line being processed. |
dmax | The maximum lookup distance. |
c | Start point of the neighbor lookup. |
mln::util::couple<bool, typename scribo_support_(F) ::site> scribo::primitive::internal::find_link | ( | Link_Functor< F > & | functor, |
unsigned | current_object, | ||
anchor::Type | anchor | ||
) |
Find the neighbor of a line of text if exists.
[in,out] | functor | Functor used to compute the links. Stores the results. |
[in] | current_object | Current object id. |
[in] | anchor | The lookup anchor. |
unsigned scribo::primitive::internal::find_root | ( | object_groups< L > & | parent, |
unsigned | x | ||
) |
Find root in a parent array arrays.
bool scribo::primitive::internal::have_link_valid | ( | const mln::util::array< unsigned > & | left_link, |
const mln::util::array< unsigned > & | right_link, | ||
unsigned | i | ||
) |
Tells whether a component have at least one valid link link.
[in] | left_link | Left link of components. |
[in] | right_link | Right link of components. |
[in] | i | The component id. |
i-th
component has at least one valid link. bool scribo::primitive::internal::is_link_valid | ( | const object_links< L > & | left_link, |
const object_links< L > & | right_link, | ||
unsigned | i | ||
) |
Validate a link from two different links.
[in] | left_link | Left link of components. |
[in] | right_link | Right link of components. |
[in] | i | The component id. |
i-th
component mln::trait::concrete< I >::ret scribo::primitive::internal::rd | ( | const Image< I > & | ima, |
const Image< J > & | constraint | ||
) |
Tolerant constrained reconstruction algorithm.
void scribo::primitive::internal::update_graph_link | ( | const Image< I > & | lbl_, |
Graph< G > & | g_, | ||
const typename I::site & | p, | ||
const typename I::site & | c, | ||
unsigned | i, | ||
int | dmax | ||
) |
Update graph edges if a valid neighbor is found.
[in] | lbl_ | A label image. |
[in] | g_ | A graph. |
[in] | p | A site of lbl_ . |
[in] | c | A site of lbl_ . |
[in] | i | A vertex id. |
[in] | dmax | The maximum distance allowed to look for a neighbor. |