Algorithm 1 Generalized intersection over union [25]

Input:    Two arbitrary convex shapes: $A,B\subseteq \mathbb{S}\in {\mathbb{R}}^n$ Output:    $GIoU$  1 For A and B, find the smallest enclosing convex object C, where $C\subseteq \mathbb{S}\in {\mathbb{R}}^n$  2 $IoU=\frac{|A\cap B|}{|A\cup B|}$  3 $GIoU=IoU-\frac{\left|C\right(A\cup B\left)\right|}{\left|C\right|}$