CGAL users discussion list

[sgdimitris <>]

Hello to all users,
I would like to ask how can I create a polyhedron if I have a set of planes?
Or with other words how can I transform a polyhedron from plane
representation to vertices or to facets representation?  

for example I can do the opposite with the following
"
typedef CGAL::Exact_predicates_inexact_constructions_kernel  K;
typedef CGAL::Polyhedron_3<K>                                         
Polyhedron_3;

//a functor computing the plane containing a triangular facet
struct Plane_from_facet {
  Polyhedron_3::Plane_3 operator()(Polyhedron_3::Facet& f) {
      Polyhedron_3::Halfedge_handle h = f.halfedge();
      return Polyhedron_3::Plane_3( h->vertex()->point(),
                                    h->next()->vertex()->point(),
                                    h->opposite()->vertex()->point());
  }
};

int _tmain(int argc, _TCHAR* argv[])
{
     Polyhedron_3 poly;
     //  ...
     // Add vertices end edges to Polyhedron, so I have its facets
    // ...
   std::transform( poly.facets_begin(), poly.facets_end(),
poly.planes_begin(),Plane_from_facet());
}
"

So, my question is that if I have a set of planes, how I take the polyhedron
that they create when they intersect?   




 

--
View this message in context: 
http://cgal-discuss.949826.n4.nabble.com/Create-Polyhedron-from-given-Planes-tp4568074p4568074.html
Sent from the cgal-discuss mailing list archive at Nabble.com.