Skip to Content.
Sympa Menu

cgal-discuss - Re: [cgal-discuss] How to retrieve handles of vertices which constitute an edge in a 3D triangulation?

Subject: CGAL users discussion list

List archive

Re: [cgal-discuss] How to retrieve handles of vertices which constitute an edge in a 3D triangulation?


Chronological Thread 
  • From: Efi Fogel <>
  • To:
  • Subject: Re: [cgal-discuss] How to retrieve handles of vertices which constitute an edge in a 3D triangulation?
  • Date: Sun, 06 May 2007 21:28:12 +0200

Take a look at the Arrangement_2 and Boolean_set_operations_2 packages.

Rajdeep Mukherjee wrote:
Hello all,
I'm new to this discussion room and I'm afraid that my questions are very much like beginners!!
I'm using CGAL to answer some queries on geometric regions e.g. whether one region is within another region,
whether they intersect or not. The regions are all convex polygon in my case. The Nef_polyhedron section in the manual
seems to have these types of operations defined.
Is there any other web manual(or something of this sort) available, that is concise but good to start with.
However, my main question is what is the largest dimension supported by CGAL to answer this type of queries?
Thanks,
Rajdeep
--
____ _ ____ _
/_____/_) o /__________ __ //
(____ ( ( ( (_/ (_/-(-'_(/
_/






Archive powered by MHonArc 2.6.16.

Top of Page