| 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 {{:spezial:bib:schmidt_et_al_cvpr09.pdf|CVPR 2009}}). The code was implemented by [[members:toeppe:|Eno Töppe]] and [[http://www.frank-r-schmidt.de|Frank R. Schmidt]] -- **Download Source Code**: {{:data:software:planarcut-v1.0.2.zip|planatcut-v1.0.2.zip}} - September 22, 2011 (LGPL){{:data:software:planarcut-v1.0.2.zip|}} | 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 {{:spezial:bib:schmidt_et_al_cvpr09.pdf|CVPR 2009}}). The code was implemented by [[members:toeppe:|Eno Töppe]] and [[http://www.frank-r-schmidt.de|Frank R. Schmidt]] -- **Download Source Code**: {{:data:software:planarcut-v1.0.2.zip|planatcut-v1.0.2.zip}} - September 22, 2011 (LGPL) |
Login
