CGAL users discussion list

["Sebastien Loriot (GeometryFactory)" <>]

OK let's close this thread.

Here is a minimal and efficient example showing how you can test
if a point is inside a polyhedron.

However it is not yet in CGAL and required a file to be patched.
If you compile the example in the directory provided, it should works
without any problem.

Sebastien.

On 03/26/2013 08:54 AM, ChaoM wrote:
> Hello Oleg:
>        I  read your code that "Determining if a point is inside a
> polyhedron?"  I have the same problem!  And I wanna to know "How to
> construct a Polyhedron? and when I convert a common Polyhedron to a
> Nef_Polyhedon, there is a error!!  Finally, I exactly agree with you ,
> because My goal is take two Polyhedrons (such as Cone,Clinder,Sphere,Cube
> and so on!) intersections! I want to know how do you finish your goal?
>        Perhaps you can give me some more detail codes!
>                    thank you!
>
>
>
> --
> View this message in context: 
> http://cgal-discuss.949826.n4.nabble.com/Determining-if-a-point-is-inside-a-polyhedron-tp4523460p4657029.html
> Sent from the cgal-discuss mailing list archive at Nabble.com.

Attachment: point_inside_polygon.tgz
Description: application/compressed-tar