|
This class helps to perform the union of a set of 3D Nef polyhedra efficiently. It succesively applies the binary union operation of Nef_polyhedron_3, but schedules these union operations in an opportune way. The class is most efficient, if the polyhedra are added in sorted order. Any order that reflects proximity in the three-dimensional space is helpful. To allow saving memory space, the sorting is left to the user. This way the user can generate the polyhedra in a sorted way and add them one by one to Nef_nary_union_3.
#include <CGAL/Nef_nary_union_3.h>
| template < | class Nef_polyhedron_3, |
| class Nef_nary_union_3; |
As a template parameter an instantiation of the template class Nef polyhedra is needed.
| Nef_nary_union_3<Nef_polyhedron_3> U; | |
|
initialization only.
| |
| Nef_polyhedron_3 | U.get_union () const | returns the union of the polyhedra previously added to the class. |
| void | U.add_polyhedron ( Nef_polyhedron_3 N) | |
| adds a polyhedron. | ||
CGAL::Nef_polyhedron_3<Traits>