On Tue, 3 Aug 2010, Anders Wallin wrote:
my previous explanation of my application was maybe not the clearest, so here is another try: http://tinyurl.com/3aoejnd
looking at the BGL-documentation, would a planar_face_traversal of the outermost/innermost face of my graph traverse the edges/vertices in a useful order for producing the output I want?
I'm not too familiar with them, but isn't this the sort of thing that marching squares/marching cubes algorithms are for? What is the actual input to your algorithm? Just a graph where the nodes have positions attached? Is that guaranteed to be a planar drawing? Also, is there anything in CGAL (www.cgal.org) that would help you? It appears that CGAL has algorithms for generating meshes from point sets. -- Jeremiah Willcock