CGAL users discussion list

[Mael <>]

Hello,

Insertion of a range of points is basically the insertion of points 
one-by-one, except that points are sorted before. Thus, if you're not 
inserting a lot of points, the spatial sorting of points will not make a 
big difference, and you can simply do something like

for(const My_point_with_info& pt : my_pts)
{
  vertex_handle vh = tr.insert(pt.point());
  vh->info() = pt.info();
}

and you're done.

If you're going to insert a lot of points, you can simply copy the 
function that inserts a range with info from DT3 or RT3 
(https://github.com/CGAL/cgal/blob/master/Triangulation_3/include/CGAL/Delaunay_triangulation_3.h#L431) 
into Triangulation_3.h and it should work almost out of the box.

Best,
Mael

On 13/05/2019 04:25, sanlingtonCGAL wrote:
> Hi,
>
> I know the Delaunay and Regular triangulation in CGAL can already add
> information to vertices while inserting /a range of points/, as introduced
> in
> https://doc.cgal.org/latest/Triangulation_3/index.html#Triangulation_3Delaunay
>
> But it seems that the Triangulation_2/3 (not Delaunay triangulation or
> Regular triangulation) can't do that, am I correct?
>
> What I want to do is to construct Triangulation by inserting a range of
> points, and each point or vertex would carry extra information, like an
> index.
> I am using codes like:
>
> #include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
> #include <CGAL/Triangulation_3.h>
> #include <CGAL/Triangulation_cell_base_3.h>
> #include <CGAL/Triangulation_vertex_base_with_info_3.h>
> #include <vector>
> typedef CGAL::Exact_predicates_inexact_constructions_kernel         K;
> typedef CGAL::Triangulation_vertex_base_with_info_3<unsigned, K>    Vb;
> typedef CGAL::Triangulation_cell_base_3<K>                 Cb;
> typedef CGAL::Triangulation_data_structure_3<Vb, Cb>                Tds;
> //Use the Fast_location tag. Default or Compact_location works too.
> typedef CGAL::Triangulation_3<K, Tds> Triangulation;
> typedef Triangulation::Point
> Point;
> int main()
> {
>         std::vector< std::pair<Point, unsigned> > points;
>         points.push_back(std::make_pair(Point(0, 0, 0), 0));
>         points.push_back(std::make_pair(Point(1, 0, 0), 1));
>         points.push_back(std::make_pair(Point(0, 1, 0), 2));
>         points.push_back(std::make_pair(Point(0, 0, 1), 3));
>         points.push_back(std::make_pair(Point(2, 2, 2), 4));
>         points.push_back(std::make_pair(Point(-1, 0, 1), 5));
>
>         Triangulation T(points.begin(), points.end());
>         CGAL_assertion(T.number_of_vertices() == 6);
>         
>         return 0;
> }
>
> The above codes are similar to those in the manual document, I just replaced
> the Delaunay with Triangulation. But the compiler gave me errors like:
>
> c:\program files (x86)\microsoft visual
> studio\2017\community\vc\tools\msvc\14.16.27023\include\xmemory0(881): error
> C2664: 'CGAL::Point_3<Kernel_>::Point_3(CGAL::Point_3<Kernel_> &&)': cannot
> convert argument 1 from '_Ty' to 'const CGAL::Origin &'
> 1>        with
> 1>        [
> 1>            Kernel_=CGAL::Epick
> 1>        ]
> 1>        and
> 1>        [
> 1>            _Ty=std::pair<Point,unsigned int>
> 1>        ]
> 1>c:\program files (x86)\microsoft visual
> studio\2017\community\vc\tools\msvc\14.16.27023\include\xmemory0(879): note:
> Reason: cannot convert from '_Ty' to 'const CGAL::Origin'
> 1>        with
> 1>        [
> 1>            _Ty=std::pair<Point,unsigned int>
> 1>        ]
>
>
> What should I do to add information to point/vertex of a Triangulation while
> inserting a range of points?
>
> Thank you.
>
>
>
>
>
> --
> Sent from: http://cgal-discuss.949826.n4.nabble.com/