#150: Deducing/computing the « complementary » neighborhood --------------------------+------------------------------------------------- Reporter: levill_r | Owner: Olena Team Type: task | Status: new Priority: major | Milestone: Olena 1.0 Component: Milena | Version: 1.0 Keywords: connectivity | --------------------------+------------------------------------------------- (Suggested by Aroune.) Some algorithms require two neighborhoods: one for the objects of an image (foreground), and one for the background. Most of the time, the latter can be deduced (or computed) from the former, and ''vice versa'' (there might be some cases where a choice can occur, but we'll leave this aside for the moment). * Write a routine for the simplest cases (regular grids). * Search for a general definition (presumably expressed in the context of complexes) to extend this routine to the complex cases (graph-based domains, etc.) -- Ticket URL: <https://trac.lrde.org/olena/ticket/150> Olena <http://olena.lrde.epita.fr> Olena, a generic and efficient C++ image processing library.