Subject: CGAL users discussion list
List archive
- From: Bernd Gärtner <>
- To: <>, Bernd Gärtner <>
- Subject: Re: [cgal-discuss] Re: Bug report: Polytope_distance_d package
- Date: Sat, 29 Jun 2013 14:38:43 +0200
Dear Jérémie,
did you try with option QP_BLAND, see http://www.cgal.org/Manual/latest/doc_html/cgal_manual/QP_solver_ref/Class_Quadratic_program_pricing_strategy.html#Cross_link_anchor_311? This will be slower but free from internal looping. There is also an example in the manual that shows how to use it: http://www.cgal.org/Manual/latest/doc_html/cgal_manual/QP_solver/Chapter_main.html#sec:QP-customization-cycling
Best,
Bernd.
On 6/25/13 1:02 PM, jdumas wrote:
Hi Bernd.
Do you have any news about a potential fix? Even with the hack I described
my program can still get stuck in a loop, and there's no way to know before
calling the function if it's gonna work or hang indefinitely, so it's a bit
problematic…
Best,
Jérémie.
--
View this message in context:
http://cgal-discuss.949826.n4.nabble.com/Bug-report-Polytope-distance-d-package-tp4657397p4657709.html
Sent from the cgal-discuss mailing list archive at Nabble.com.
- [cgal-discuss] Re: Bug report: Polytope_distance_d package, jdumas, 06/25/2013
- Re: [cgal-discuss] Re: Bug report: Polytope_distance_d package, Bernd Gärtner, 06/29/2013
Archive powered by MHonArc 2.6.18.