CGAL users discussion list

[Wellington Castro <>]

Laurent thanks a lot for your reply. This really helped me.

2016-07-29 5:57 GMT-04:00 Laurent Rineau (CGAL/GeometryFactory) <>:

Le Thursday 28 July 2016 12:33:10 Wellington Castro a écrit :
> Hi Laurent, I think that is the first option. Because some meshes I get
> error and others not. In the cases with error, I am planning to search the
> 3 nearest neighbors and calculate the distance to the plane described by
> then. Do you think os a good ideia ?

I would instead try to filter out the degenerated triangles from the input of
the AABB tree. For example, to construct the AABB tree from facets of a
polyhedron:

      AABB_tree facet_tree; // zero-constructed
      for(Polyhedron::Facet_iterator
          fit = polyhedron->facets_begin(),
          end = polyhedron->facets_end();
          fit!=end; ++fit)
      {
        Polyhedron::Point a(fit->halfedge()->vertex()->point()),
            b(fit->halfedge()->next()->vertex()->point()),
            c(fit->halfedge()->prev()->vertex()->point());

        if(!CGAL::collinear(a,b,c))
          facet_tree.insert(Facet_primitive(fit, *poly_item->polyhedron(),
pmap));
      }
      facet_tree.build();

that way, you remove all facets that have a degenerated triangle.

--
Laurent Rineau, PhD
R&D Engineer at GeometryFactory           http://www.geometryfactory.com/
Release Manager of the CGAL Project       http://www.cgal.org/


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