Alpha_expansion_graph_cut.h File Reference

This file contains 3 graph-cut algorithms, which can be used as a template parameter for CGAL::internal::Surface_mesh_segmentation. More...

#include <CGAL/assertions.h>
#include <boost/version.hpp>
#include <boost/graph/adjacency_list.hpp>
#include <boost/graph/kolmogorov_max_flow.hpp>
#include <vector>

Include dependency graph for Alpha_expansion_graph_cut.h:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Namespaces
namespace	CGAL

Detailed Description

This file contains 3 graph-cut algorithms, which can be used as a template parameter for CGAL::internal::Surface_mesh_segmentation.

Main differences between implementations are underlying max-flow algorithm and graph type (i.e. results are the same, performance differs).

For activating MAXFLOW software, define CGAL_USE_BOYKOV_KOLMOGOROV_MAXFLOW_SOFTWARE. It activates Alpha_expansion_graph_cut_boykov_kolmogorov, and makes CGAL::internal::Surface_mesh_segmentation choose this implementation for graph-cut.

Also algorithms can be used by their-own for applying alpha-expansion graph-cut on any graph.