Calculate the intersection of two regions.

intersection calculates the intersection of the regions in Region1 with the regions in Region2. Each region in Region1 is intersected with all regions in Region2. The order of regions in RegionIntersection is identical to the order of regions in Region1.

Empty input regions are permitted. Because empty result regions are possible, the system flag 'store_empty_region' should be set appropriately.

Let N be the number of regions in Region1, F1 be
their average area, and F2 be the total area of all regions in
Region2.  Then the runtime complexity is
O(F1 log((F1)) + N * (sqrt(F1) + sqrt(F2))).

intersection always returns 2 (H_MSG_TRUE). The behavior in case of empty input (no regions given) can be set via set_system('no_object_result',<Result>) and the behavior in case of an empty input region via set_system('empty_region_result',<Result>). If necessary, an exception handling is raised.

intersection is reentrant and processed without parallelization.

threshold, connection, regiongrowing, pouring

select_shape, disp_region

union1, union2, complement

Foundation