CGAL users discussion list

[schrodingersnewcat <>]

Hello,

I am trying to use an AABB tree with the exact predicates exact
constructions kernel on polyhedrons using the polyhedron triangle primitive. 
When I call accelerate_distance_queries(), I get the following error output
from the executable:

terminate called after throwing an instance of 'CGAL::Assertion_exception'
  what():  CGAL ERROR: assertion violation!
Expr: i >= 0 && i < dim
File: /home/rcf-proj/jdo/friesz/lib64/include/CGAL/Kd_tree_rectangle.h
Line: 82
Abort

I can get the tree to work with the Cartesian kernel using Gmpq as the field
type and with a filtered Cartesian kernel also using Gmpq.  Is there a
reason why the exact kernel fails?  

I would like to use the exact kernel because it is much faster at Nef
containment and intersection operations, from what I can tell.

Any help is appreciated.



--
View this message in context: 
http://cgal-discuss.949826.n4.nabble.com/AABB-tree-Exact-predicates-exact-constructions-kernel-tp3506553p3506553.html
Sent from the cgal-discuss mailing list archive at Nabble.com.