CGAL users discussion list

[David Arken <>]

I've 100k+ points, and the make_mesh+refine_mesh function puts weights
on a few hundred. I tried to give them no_perturb() and no_exude() --
but it seems it still puts weights on the points (is that a bug?). You
think computing the Delaunay from scratch is the right way to solve my
problem?

I was trying to go thru the list of points, find out the weighted
points, and was hoping to remove and reinsert them.  But the following
loop does not seem to compile: (Maybe my typedefs dont make sense?)

    // Fix regular triangulation
    typedef CGAL::Exact_predicates_inexact_constructions_kernel K;
    typedef CGAL::Polyhedral_mesh_domain_with_features_3<K> Mesh_domain;
    typedef CGAL::Mesh_polyhedron_3<K>::Type Polyhedron;

    typedef CGAL::Mesh_triangulation_3<Mesh_domain>::type Tr;
    typedef 
CGAL::Mesh_complex_3_in_triangulation_3<Tr,Mesh_domain::Corner_index,Mesh_domain::Curve_segment_index>
C3t3;
    typedef C3t3::Triangulation Tr;
    typedef typename Tr::Finite_vertices_iterator Finite_vertices_iterator;
    const Tr& tr_ = c3t3.triangulation();
    for( Finite_vertices_iterator vit = tr_.finite_vertices_begin();
         vit != tr_.finite_vertices_end();
         ++vit)
        std::cout << (*vit).weight() << std::endl;


Thanks.


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
>
>