In this article, we present an extension of the concept A-shape [1] to weighted points, where each point's weight is the radius of a disc centered at this point. In addition, we show that the resultant concept, we name weighted A-shape, is a graph extracted from the regular triangulation. This new concept unifies the two descriptors named ?-shape and space filling graph. This unification is defined by the fact that the families of the last two descriptors are contained in the weighted A-shape family, this allows to A-shape to escape the limits of these two descriptors.