id,summary,reporter,owner,description,type,status,milestone,component,version,severity,resolution,keywords,cc
772,Graph vs. Multi_index for geometric algorithms,nobody,joaquintides,"{{{
Dear Boost Supporter,

I am working on an implementation of a 2D polygon 
boolean class. I am aware that such classes are 
already available but all have technical (robustness, 
performance, flexibility) or license (commercial, GPL) 
limitations.

I would like to use STL and Boost as much as possible.

Some of my algorithms require various range searches 
and intersection tests. The multi_index_container 
class seems ideal to implement these. On the other 
hand I will need various graph traversal algorithms, 
which suggests using the Graph library, which has very 
limited possibilities for sorting an efficient 
searching.

Do you see an easy way to combine the advantages of 
both libraries? Obviously, I would like to avoid 
maintaining a separate multi_sorted search structure 
next to my graph.

My email address
hans.van.zwol@nxp.com
hans.van.zwol@xs4all.nl

Thank you for any helpful suggestions!

Hans van Zwol
}}}",Support Requests,closed,,multi_index,None,,Duplicate,,