CGAL users discussion list

["Florian Thiel" <>]

Hi!

We're using CGAL in a university project for a simulation of falling
cuboids (in 2D, so the simulation uses rectangles only). This involves
quadratic optimization. For every point (we've got 9 per cuboid) a
bunch of constraints are generated. The optimization generally works
but is very slow. For two cubes (about 50 constraints) every step (the
optimization calculates the acceleration for every point) takes about
one minute to compute. We'd need about 20 cubes and  at least 1,000
steps for our simulations, so this is clearly way to slow. Are there
any common programming traps which make qp solving so slow or is this
the speed you should be expecting in a situation like ours? What are
the common optimizations one could use?

Another thought: At the moment we're including all the constraints in
the qp formula (like deformation and collision). Would it be possible
to let CGAL do these things? Can we create predicates which evaluate
to true for each simulation step (i.e. considering only results in qp
for which all predicates hold)?

Thanks in advance,
Florian