CGAL users discussion list

[David Arken <>]

Hi Olivier,

Do you know why this does not work -- was trying your suggestion:

    C3t3 tmp_c3t3; // Code from refine_mesh
    std::for_each(c3t3.triangulation().finite_vertices_begin(),
                  c3t3.triangulation().finite_vertices_end(),
                  CGAL::details::Insert_vertex_in_c3t3<C3t3>(tmp_c3t3));

    c3t3.swap(tmp_c3t3);
    // now there are no tetrahedrons in c3t3?

Thanks,
--Ram

On Mon, Sep 24, 2012 at 3:42 AM, Olivier Devillers
<>
 wrote:
> Le 9/23/12 5:26 PM, David Arken a écrit :
>
>> What is the fastest way to convert a regular triangulation with
>> weights on points to another regular triangulation with all weights
>> zero. I hope that this will guarantee that the regular triangulation
>> is indeed a delaunay triangulation.
>>
>> Thanks,
>>
> ????
>
> compute the Delaunay triangulation of the unweighted points !
>
>
>
> --
> You are currently subscribed to cgal-discuss.
> To unsubscribe or access the archives, go to
> https://sympa.inria.fr/sympa/info/cgal-discuss
>
>