CGAL users discussion list

["Sebastien Loriot (GeometryFactory)" <>]

On 05/05/2014 05:18 PM, fcaillaud wrote:
> Hello,
>
> I've just discovered the AABB tree data structure and need, for each of my
> topological operations, to compute the distance of the resulting point to
> the mesh.
>
> Thus, I use the squared_distance(Point) to get it after having successfully
> build the tree.
>
> And I receive this precondition violation message :
>
> CGAL ERROR: precondition violation!
> Expr: (squared_radius >= FT(0)) & (o != COLLINEAR)
> File: /usr/include/CGAL/Cartesian/Sphere_3.h
> Line: 57
>
> The resulting point causing this should be on the mesh surface or not so far
> (this should be an issue ?), is incident to many edges and be placed in a
> dense, concave space of the surface. When I try with a constant distant
> point, there no problem.
>
> Have you any idea of what happen exactly ?
>
> Can I really compute this so closed distance with an AABB tree ?
>
> PS : I run it on ubuntu 12.04 with gcc-4.6.3 .

What kernel are you using? Could you show how you are using the AABB tree?

Sebastien

> --
> View this message in context: 
> http://cgal-discuss.949826.n4.nabble.com/Squared-distance-on-AABB-tree-of-CGAL-precondition-violation-tp4659248.html
> Sent from the cgal-discuss mailing list archive at Nabble.com.