CGAL users discussion list

["Tyver Ray" <>]

Thanks for your answer!

I've tried :

#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
#include <CGAL/Triangulation_euclidean_traits_xy_3.h>
#include <CGAL/Delaunay_triangulation_2.h>
#include <CGAL/Triangulation_line_face_circulator_2.h>

struct K : CGAL::Exact_predicates_inexact_constructions_kernel {};

typedef CGAL::Triangulation_euclidean_traits_xy_3<K>  Gt;
typedef CGAL::Delaunay_triangulation_2<Gt> Delaunay;

typedef Delaunay::Line_face_circulator Line_face_circulator;
typedef K::Point_3   Point;


int main()
{
    Delaunay dt;

    dt.insert(Point(1, 3, 17));
    dt.insert(Point(2, 3, 13));
    dt.insert(Point(3, 3, 18));
    dt.insert(Point(4, 3, 18));

    const Point& aa = Point(0, 0, 3);
    const Point& bb = Point(4, 0, 6);

    Line_face_circulator lfi = Line_face_circulator(aa, bb, dt);

    return 1;
}

but it doesn't build! What's the problem?

Error    7    error C2665: 'CGAL::Triangulation_line_face_circulator_2<Gt,Tds>::Triangulation_line_face_circulator_2' : none of the 6 overloads could convert all the argument types

The method takes two points aa and bb to create the segment and compare it to all of the triangle edges right?


In advance, thank youuuuuu!

2007/6/19, Andreas Fabri < >:

You might have a look at the Line_face_circulator.
It allows to traverse all triangles intersected by a Line_2

andreas


Tyver Ray wrote:
> Hello!
>
> There's a sublime figure that I've created just for you!!
>
> If I want to select all the triangles (red, orange and green on the
> figure) that have their vertices on the black edge on the figure below,
> do I have to iterate on all finite vertices and compare the vertices to
> the all the points on the black edge?
> If I have 200 000 triangles it will take a long time...Do you have
> another idea or method or if there's not please tell me!
>
>
> | ¬
> |    ¬
> |        ¬
> |     ¬    ¬
> |¬          ¬
> |    ¬       ¬
> |        ¬   ¬
> |¬   ¬      ¬
>
>
> Thank you!
>
> Tyv

--
You are currently subscribed to cgal-discuss.
To unsubscribe or access the archives, go to
https://lists-sop.inria.fr/wws/info/cgal-discuss