The bisector function is an important tool for analyzing and filtering Euclidean skeletons. In this paper, we are proposing a new way to compute 2D and 3D discrete bisector function based on annuli. From a continuous point of view, a point that belongs to the medial axis is the center of a maximal ball that hits the background in more than one point. The maximal angle between those points is expected to be high for most of the object points and corresponds to the bisector angle. This logic is not really applicable in the discrete space since we may miss some background points that can lead to small bisector angles. In this work we use annuli to find the background points in order to compute the bisector angle. Our approach offers the possibility to change the thickness of the annulus at a given point and is thus flexible when computing skeletons. Our work can be extended to nD and we propose the nD algorithm.