Contents
Other ResourcesPolygon Sponsor 
Connectivity Extraction 90
The connectivity extraction algorithm constructs the connectivity graph where input polygon sets are modeled as graph nodes and assigned node ids and overlap/touching between input polygon sets is modeled as graph edges. One supported graph formats is std::vector<std::set<int> > where node ids index into the vector and the sets of integers at each index are the ids of nodes for which an edge exists in the graph. It is required that such vector preallocate sufficient elements to store the graph generated by the algorithm, because only the operator[] is used internally to access the graph The other supported graph format is std::map<int, std::set<int> > which is slightly easier to work with, but potentially more expensive. Improving the interface to support more generic graph concepts is deferred to future work. The following is the declaration of the connectivity extraction algorithm.
template <typename coordinate_type> Example code connectivity_extraction_usage.cpp demonstrates using the connectivity extraction algorithm to build a connectivity graph on geometry. Member Functions
 
