CGAL users discussion list

[Sebastien Loriot <>]

You have one Nef polyhdron but featuring several shells.

See shell definition here:
https://doc.cgal.org/latest/Nef_3/#title1

And a shell exploration example here:
https://doc.cgal.org/latest/Nef_3/#title15

Note that you can also use the following Boolean operation function:
https://doc.cgal.org/latest/Polygon_mesh_processing/group__PMP__corefinement__grp.html#ga3ff96d36cad8f37efcdada916c46fbbe

together with this example:
https://doc.cgal.org/latest/Polygon_mesh_processing/Polygon_mesh_processing_2face_filtered_graph_example_8cpp-example.html#a5

that will give you access to each connected components.

Note that there is also this function to compute the centroid:
https://doc.cgal.org/latest/Polygon_mesh_processing/group__PMP__measure__grp.html

Best,

Sebastien.

On 5/8/23 10:10, "蓝色追风" ( via cgal-discuss Mailing List) 
wrote:
> Hi, all,
>
>
> I am currently working on computing the intersection between two 
> polyhedra using CGAL. Since the polyhedra are not convex, the 
> intersection results in two disjoint polyhedra, as shown in the attached 
> figure. However, when I used the NefPolyhedron Boolean operations, it 
> only gave me one NefPolyhedron.
>
> I am interested in computing the center of mass and volume of each of 
> the resulting polyhedra. Therefore, I would like to ask for your help in 
> splitting the NefPolyhedron into two disjoint polyhedra. There are very 
> few online codes on this topic, so I would appreciate it if you could 
> provide me with some sample code to achieve this.
>
> Thank you very much for your assistance.
>
> Daye
>
>
>
> --
> You are currently subscribed to cgal-discuss.
> To unsubscribe or access the archives, go to
> https://sympa.inria.fr/sympa/info/cgal-discuss