Boost logo

Boost :

From: (noreply_at_[hidden])
Date: 2006-11-10 10:19:04

Support Requests item #1594210, was opened at 2006-11-10 07:19
Message generated for change (Tracker Item Submitted) made by Item Submitter
You can respond by visiting:

Please note that this message will contain a full copy of the comment thread,
including the initial issue submission, for this request,
not just the latest update.
Category: multi_index
Group: None
Status: Open
Resolution: None
Priority: 5
Private: No
Submitted By: Nobody/Anonymous (nobody)
Assigned to: Joaquín M López Muñoz (joaquintides)
Summary: Graph vs. Multi_index for geometric algorithms

Initial Comment:
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)

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

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

Thank you for any helpful suggestions!

Hans van Zwol


You can respond by visiting:

Using Tomcat but need to do more? Need to support web services, security?
Get stuff done quickly with pre-integrated technology to make your job easier
Download IBM WebSphere Application Server v.1.0.1 based on Apache Geronimo

Boost-bugs mailing list

Boost list run by bdawes at, gregod at, cpdaniel at, john at