CGAL users discussion list

["Chaman Singh Verma" <>]

On Fri, Nov 28, 2008 at 8:56 PM, Gärtner Bernd <> wrote:

What you define in this way is an affine subspace, not a polytope. It has no corners (vertices). Or do you have the implicit constraints x >= 0? And is there just one equation, or more? Please provide some exact details in order to enable us to help you.

Best regards,
Bernd.


________________________________

Von: Chaman Singh Verma [mailto:]
Gesendet: Fr 28.11.2008 14:30
An: cgal-discuss
Betreff: [cgal-discuss] Intersection Points in Higher Dimension

Hello,

How can I know the intersection points of the polytope defined by

  a_1 x_1 + a_2 x_2 + ..............................
..........  a_n x_n = b_1
  .
  .
  .

where n is very large number. Besides knowing the corner vertices of
the polytope, I am interested in knowing the (n-2), (n-1) simplices.
Please let me know if they can be done using CGAL.

Thanks,
csv
Poona, India

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

Hello

I am sorry for putting = sign, must be replaced by <= sign. So I will have 
set of planes defined by those equations. So I am interested in knowing the
polytopes formed by the intersections of half spaces. 

Thanks.
csv