document: Applying BGL to computational geometry The author applies Boost Graph Library to the domain of computational geometry . First , he formulates a concrete problem in graph terms . Second , he develops a way to transform the output of an existing algorithm into an appropriate Boost Graph Library data structure . Finally , he implements two new algorithms for my Boost Graph Library graph . The first algorithm gets the job done , but could have been written in any programming language . The second algorithm , however , shows the power of Boost Graph Library 's generic programming approach.Graphs , graphics , and generic programming combine in this novel use of the Boost Graph Library
doc_bio_tags: O O O B I O O O B I I O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O B I I
extractive_keyphrases: boost graph library computational geometry
abstractive_keyphrases: boost libraries c++ threads smart pointers graph-theoretic concepts directed graph file dependencies bgl graph generic programming approach