Here is a list of all modules:
[detail level 12]
▼CGAL and the Boost Graph Library Reference | |
Specializations of boost::graph_traits | The Bgl defines the class template boost::graph_traits as a uniform interface to the properties and types of graph types |
Named Parameters | The algorithms of the Boost Graph Library (Bgl) often have many parameters with default values that are appropriate for most cases |
Concepts | We extend the Boost Graph Library (Bgl for short) with a set of new concepts |
Properties | The property tags model of the boost concept PropertyTag |
Dynamic Properties | The dynamic property tags enable to associate information to simplices of a FaceGraph on the fly |
External Indices | A number of BGL and CGAL algorithms require the graph to have (initialized) integer-like indices for its vertices, edges, or faces |
Helper Functions | Generic convenience functions for testing if an edge is a border edge, if a mesh is triangular, for conversion between models of different FaceGraph concepts, etc |
Iterators and Circulators | Several iterators and circulators are provided that enable, for example, to iterate through the halfedges incident to a given face or vertex |
Selection Functions | Several functions to enlarge or reduce a k-ring selection of vertices, edges, or faces |
Graph Adaptors | Graph adaptors are classes that build an interface over an existing graph to provide new functionalities |
Euler Operations | We call high level operations that maintain the validity of a halfedge graph Euler Operations |
Partitioning Operations | Methods to split a mesh into subdomains, using the library METIS or a graphcut implementation |
I/O Functions | Methods to read and write graphs |