CGAL users discussion list

[hank choi <>]

ㅔ

2013. 6. 10. 오전 8:05에 "schrodingersnewcat" <>님이 작성:

Okay, I've done that and it does indeed come back telling me there are
degenerate triangles.

First a note.  I had to use this snippet instead of what you posted as
CGAL::orientation was giving me an error.

for (Polyhedron::Facet_iterator fit=polyhedron.facets_begin();
                        fit!=polyhedron.facets_end();
                        ++fit)
        {
                if ( CGAL::collinear(
                                fit->halfedge()->vertex()->point(),
                                fit->halfedge()->next()->vertex()->point(),
                                fit->halfedge()->opposite()->vertex()->point() ) )
                {
                        std::cout << "degenerate triangle\n";
                }
        }

So, now my question is how do I repair a polyhedron that has developed this
pathology and how does it occur in the first place?

As I said before I'm using a kernel with an exact number type.  In fact it
is interchangeable with CGAL::Exact_predicates_exact_constructions_kernel.
I just wanted to specify the number and kernel type manually.

The polyhedrons I'm using are the result of boolean operations using Nef
polyhedrons.  Each is converted from a Nef polyhedron a few steps before I
create the AABB trees.




--
View this message in context: http://cgal-discuss.949826.n4.nabble.com/Divide-by-Zero-in-AABB-tree-tp4657026p4657665.html
Sent from the cgal-discuss mailing list archive at 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