CGAL users discussion list

[Roger Mason <>]

Hello Andreas,

"Andreas Fabri [via cgal-discuss]"
<[hidden email]> writes:

> right.  The manual page also has a paragraph refering to an
> example for the Polyhedron. There as well, one stores handles
> to facets:
>
> This example can be easily extended to test polyhedral surfaces of the
> Polyhedron_3 class for (self-) intersections. The main difference are
> the numerous cases of incidences between triangles in the polyhedral
> surface that should not be reported as intersections, see the
> examples/Polyhedron/polyhedron_self_intersection.cpp example program in
> the Cgal distribution.

I think I tried something based on the manual example 61.5 a couple of
days ago, before I asked for help.

When I introduce:

typedef CGAL::Exact_predicates_inexact_constructions_kernel Kernel;
typedef Kernel::Point_3                                     Point_3;
typedef Kernel::Triangle_3                                  Triangle_3;
typedef std::vector<Triangle_3>                             Triangles;
typedef Triangles::iterator                                 Iterator;

into my existing code the application won't compile.  The stream of
errors is too long to include here.

I think it is time to give up on this.  Thank you very much for trying
to help, but I think using CGAL is beyond my programming skills.

Best wishes,
Roger

---

View this message in context: Re: Intersection of surfaces
Sent from the cgal-discuss mailing list archive at Nabble.com.