PlanarGC  1.0.2
 All Data Structures Functions Variables Enumerations Enumerator Friends Pages
Documentation

Overview

CutPlanar finds a minimal cut in an arbitrary planar graph, i.e., in a graph that can be embedded into the plane. The authors of this code are especially interested in Computer Vision applications. Therefore, three additional classes are provided that make the definition of planar graphs easier and provide the user with enough freedom in order to concentrate on the specific image based model that arises from the given Computer Vision problem.

Depending on the specific application you are interested in, we would like to direct your focus on the tutorials of the following classes:

  1. CutGrid defines a 4-connected planar graph whose vertices are placed on a rectangular grid.
  2. CutSegment uses a grid graph whose edges are defined w.r.t. neighboring image data.
  3. CutShape uses the planar grid as defined in http://www.csd.uwo.ca/~schmidtf/pdf/STCB-07.pdf . The only thing the user has to provide is the pairwise dissimilarity matrix between pairs of points on two given planar shapes.

If you are interested in a more general application of planar cuts, please follow the link to the CutPlanar tutorial. This class is in fact the core element of all three cut classes mentioned above.

© 2009 - 2013 by Eno Töppe, Frank R. Schmidt
generated by Doxygen