compute the intersection of two regions . concode_field_sep NodesCleaner nodeCleaner concode_field_sep BSPTree<S> recurseComplement concode_elem_sep Order visitOrder concode_elem_sep Region<S> buildConvex concode_elem_sep void visitInternalNode concode_elem_sep Region<S> getComplement concode_elem_sep BSPTree<S> merge concode_elem_sep BSPTree<S> merge concode_elem_sep BSPTree<S> merge concode_elem_sep BSPTree<S> merge concode_elem_sep Region<S> difference concode_elem_sep Region<S> xor concode_elem_sep Region<S> union concode_elem_sep void visitLeafNode
Region < S > function ( final Region < S > arg0 , final Region < S > arg1 ) { final BSPTree < S > loc0 = arg0 . getTree ( false ) . merge ( arg1 . getTree ( false ) , new IntersectionMerger ( ) ) ; loc0 . visit ( nodeCleaner ) ; return arg0 . buildNew ( loc0 ) ; }