CGAL users discussion list

["Amir Vaxman" <>]

I don't necessarily need a  solver (i.e., get a point which is in the
halfplane intersection). I want to know all connected domains that satisfy
the halfplane intersection.

Amir.

-----Original Message-----
From: Joachim Reichel 
[mailto:]
 
Sent: Sunday, December 28, 2008 3:11 PM
To: 

Subject: Re: [cgal-discuss] Using arrangment_2 for linear programming

Hi,

> Can I efficiently, within arrangement_2, create an arrangement of infinite
> lines in the plane, in a way that I can determine for a face (without O(n)
> checks for each face) in what side of any line it lies? (so, to create an
> arrangement of halfspaces).

if you are interested in exact linear programming, you might want to have a
look
at CGAL 3.4 beta, which has an exact linear and quadratic programming
solver. See

http://www.cgal.org/Manual/3.4/doc_html/cgal_manual/QP_solver/Chapter_main.h
tml

Regards,
  Joachim
-- 
You are currently subscribed to cgal-discuss.
To unsubscribe or access the archives, go to
https://lists-sop.inria.fr/wws/info/cgal-discuss