template<class Convex1 , class Convex2 , class NamedParameters_1 = parameters::Default_named_parameters, class NamedParameters_2 = parameters::Default_named_parameters>
template<class Convex1 , class Convex2 , class NamedParameters_1 = parameters::Default_named_parameters, class NamedParameters_2 = parameters::Default_named_parameters>
each input can be provided as a range, a mesh, or as the specialized structure CGAL::Convex_hull_hierarchy. They are not required to use the same input type.
Extra: used only if ch1 (ch2) is model of ConstRange
when ch1 (ch2) is a mesh, it is a property map associating points to its vertices
Type: a model of ReadablePropertyMap whose value types are the same for ch1 and ch2
Default: boost::get(CGAL::vertex_point, g)
Extra: used only if ch1 (ch2) is model of VertexListGraph and AdjacencyGraph. If this parameter is omitted, an internal property map for CGAL::vertex_point_t must be available in Convex_1 (Convex_2).
Default: a CGAL kernel deduced from the point type of the input, using CGAL::Kernel_traits
Extra: np1 only
if not 0 (no limit), indicates the maximum number of iterations performed by the algorithm. If this value is not 0, then an intersection might be reported even if the convex hulls does not intersect. However, if the convex hulls are reported not to intersect, this is guaranteed.
Type: a positive integer convertible to std::size_t