Skip to Content.
Sympa Menu

cgal-discuss - Re: [cgal-discuss] CGAL and Boost

Subject: CGAL users discussion list

List archive

Re: [cgal-discuss] CGAL and Boost


Chronological Thread 
  • From: Vicente Helano <>
  • To:
  • Subject: Re: [cgal-discuss] CGAL and Boost
  • Date: Tue, 17 Jul 2007 06:09:53 -0800

Hi prof. Pion,

I added a naive implementation of a null_vertex function to the Delaunay
triangulation graph traits, and now it works, even when using gcc 3.4.6.
It was also needed to use an associative property map for the mate
vector, instead of a stl vector. This fixed errors about get and put
functions.

In fact, I want to compute a matching of the Voronoi diagram and identify
the matched edges with their primal ones. I think I should use the Voronoi
diagram adaptor to switch from one representation to the other. So, I need
to implement a Boost graph traits to it. Is it ok?

The working code is attached to this email.

Regards,
Vicente Helano.

> -----Original Message-----
> From:
>
> Sent: Tue, 10 Jul 2007 06:29:11 -0800
> To:
>
> Subject: Re: [cgal-discuss] CGAL and Boost
>
> Hi prof. Pion,
>
> Thanks for your help.
> You are right. I was using gcc 3.4.6.
> But I changed to gcc 4.1.2, and I am still getting errors.
> Basically, there are three error messages:
> 1. /usr/include/boost/graph/max_cardinality_matching.hpp:601: error:
> 'null_vertex' is not a member of
> 'boost::graph_traits<CGAL::Delaunay_triangulation_2...'
> 2. /usr/include/boost/graph/max_cardinality_matching.hpp:623: error: no
> matching function for call to 'get(...)'
> 3. /usr/include/boost/graph/max_cardinality_matching.hpp:626: error: no
> matching function for call to 'put(...) '
>
> Should I have to add these methods to the Delaunay_triangulation_2
> graph traits?
>
> The error messages and the source code are attached to this email.
>
> Best regards,
> Vicente Helano.
>
>> -----Original Message-----
>> From:
>>
>> Sent: Thu, 05 Jul 2007 09:43:40 +0200
>> To:
>>
>> Subject: Re: [cgal-discuss] CGAL and Boost
>>
>>
>> a écrit :
>>> Dear Friends,
>>>
>>> I am trying to compute maximum matchings of 2d triangulations using
>>> the
>>> Boost
>>> algorithms library, but I am getting a lot of errors.
>> > ...
>>
>> Hi Vicente,
>>
>> You did not mention the compiler you are using.
>> Note that g++ 3.3 has some problems with the BGL adapters,
>> it might be this problem, in which case you could try a more
>> recent g++.
>>
>> --
>> Sylvain Pion
>> INRIA Sophia-Antipolis
>> Geometrica Project-Team
>> CGAL, http://cgal.org/
> --
> You are currently subscribed to cgal-discuss.
> To unsubscribe or access the archives, go to
> https://lists-sop.inria.fr/wws/info/cgal-discuss

____________________________________________________________
FREE 3D EARTH SCREENSAVER - Watch the Earth right on your desktop!
Check it out at http://www.inbox.com/earth

Attachment: graph_traits_Delaunay_triangulation_2.h
Description: Binary data

Attachment: maximum_matching.cpp
Description: Binary data




Archive powered by MHonArc 2.6.16.

Top of Page