Subject: CGAL users discussion list
List archive
- From: Ben Galehouse <>
- To:
- Subject: Bounded versus unbounded simplices in Convex_hull_d
- Date: Tue, 16 Oct 2007 18:49:22 -0400
I create a convex hull and then want to work through the (bounded) simplices. I basically have
for(Simplex_iterator s = hull.simplices_begin();
s != hull.simplices_end();
s++){
...
Point_d<Cartesian_d<Gmpq> >newPoint = hull.point_of_simplex(s, 0)
...
}
And the call to point_of_simplex then gives a segmentation fault. I'm still sorting through the different levels of header files to get a feel from the convex hull code, but it looks like it keeps tract of some unbounded simplices, as well as the bounded simplices that interest me. Would s iterate over these unbounded simplices? Would a segmentation fault be expected when asking for a point of such?
And finally... If yes to the previous, how should I tell the difference between a bounded and unbounded simplex? If no to the previous, why might the fault be happening?
Apologies if I'm missing something obvious in the documentation.
- Bounded versus unbounded simplices in Convex_hull_d, Ben Galehouse, 10/17/2007
- Re: [cgal-discuss] Bounded versus unbounded simplices in Convex_hull_d, Camille Wormser, 10/17/2007
Archive powered by MHonArc 2.6.16.