Re: [boost] Re: BGL - how to find end of predecessor chain?

From: jsiek_at_[hidden]
Date: 2000-10-17 17:11:25

Hi Herve,

I'm sure there is interest in computation geometry libraries and
planar graph algorithms here at boost (they're already on the boost
graph library to-do list page). Even more, it would be great if people
like you and Lutz would like to spearhead a proposal for adding these
things to boost! One issue in encorporating parts of CGAL may be the
license... I noticed CGAL's license is too restrictive for boost.

Cheers,

Jeremy

Herve Bronnimann writes:
 > This discussion reminds me of an invention of Lutz Kettner. He called it
 > circulator. Intuitively, iterators iterate over a range, and circulators
 > add the capability to have a "circular range". Lutz needed it in his
 > implementation of half-edge data structures, and it is also needed in
 > planar maps and other geometric structures. This is why they are part of
 > the CGAL library.
 > 
 > Circulators would provide a nice library for boost, I'll make sure to
 > mention it to Lutz. Meanwhile, check out:
 > 
 > CGAL: computational geometry algorithms library ( http://www.cgal.org/ )
 > and especially the reference manual for circulators (can view it at
 > http://www.cgal.org/Manual/doc_html/frameset/fsSupport.html )
 > 
 > Lutz's article "Using Generic Programming for Designing a Data Structure
 > for Polyhedral Surfaces", CGT&A (first article on the page
 > http://www.cs.unc.edu/~kettner/pub/index.html )
 > 
 > Cheers,
 > -- 
 > Hervé