CGAL users discussion list

["Sebastien Loriot (GeometryFactory)" <>]

On 06/07/2013 02:56 PM, pwr00 wrote:
> Hi!
> Sorry about the repost. Seems like I have some issues with becoming allowed
> to post to the mailing list. I have been trying to find a answer to this
> question for a couple of weeks now and feel a bit lost.
>
> The basic problem is like this:
>
> 1. I create a Polyhedron3 that is a plane.
Do you mean a bounded part of a plane?

> 2. Convert the Polyhedron3 to a NefPolyhedron in order to make boolean
> operations on it.
> 3. I convert the NefPolyhedron back to Polyhedron3.
>
> My problem is that step3 triggers an assert because the shape is not simple.
> What options do I have in order to make boolean operations on a plane? Could
> someone point me in the right direction?
>
> - Can I temporarly close the shape somehow?
> - I've read in the manuals that it should be possible to define a plane that
> spans the entire space.
> 29.3 Infimaximal Box in
> http://www.cgal.org/Manual/latest/doc_html/cgal_manual/Nef_3/Chapter_main.html
> Is this somehting that can solve my issues?
If you want to work with infinite planes, it is the way to go.
Note that if the result is not simple you will not be able to
export it to Polyhedron_3 anyway. You will need to proceed for each shell.

Sebastien.

> --
> View this message in context: 
> http://cgal-discuss.949826.n4.nabble.com/Polyhedron-plane-to-nef-polyhedron-and-back-again-tp4657664.html
> Sent from the cgal-discuss mailing list archive at Nabble.com.