Persönlicher Status und Werkzeuge

Home Datasets and Software Software Planar Cut Source Code

Planar Cut Source Code

The PlanarCut library computes max-flow/min-s-t-cut on planar graphs. It implements an efficient algorithm, which has almost linear running time. The library also provides for several easy-to-use interfaces in order to define planar graphs that are common in computer vision applications (see CVPR 2009). The code was implemented by Eno Töppe and Frank R. SchmidtDownload Source Code: - September 22, 2011 (LGPL)

Last edited 10.01.2013 10:57 by toeppe