CGAL users discussion list

[Andreas Fabri <>]

We could add an insertion of a range to the Triangulation_3 class, but then no
reshuffling of the points should happen as the insertion order implies which
triangles you have.  This is different for the Delaunay/Regular triangulation
where the resulting triangulation is unique, that is independent from the
insertion order.

andreas

On 5/13/2019 9:01 AM, Marc Alexa wrote:

Yes, CGAL is sometimes mysterious in what types are accepted by what functions. I agree you’d expect that the insert method for Triangulation_3 should be able to understand how to handle the pairs if Delaunay_triangulation_3 does. But, no. If you insist on using the pairs and are ok with initially getting a Delaunay triangulation, the following code works just fine:

#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>

#include <CGAL/Triangulation_3.h> #include <CGAL/Delaunay_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 CGAL::Delaunay_triangulation_3<K, Tds> DT; 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 = DT(points.begin(), points.end());
    CGAL_assertion(T.number_of_vertices() == 6); return 0; }
I believe speed-wise there is very little to be gained from not using Delaunay. If you don’t care about what coordinate in space carries which number, you could insert the range of points first and then set the info later. In this case, however, the order of the points you get form the vertex iterator will likely differ from the order in which you provided the points. 


-Marc

On 13. May 2019, at 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/
--
You are currently subscribed to cgal-discuss. To unsubscribe or access the archives, go to
https://sympa.inria.fr/sympa/info/cgal-discuss

-- 
Andreas Fabri, PhD
Chief Officer, GeometryFactory
Editor, The CGAL Project

phone: +33.492.954.912    skype: andreas.fabri