branching angle, and number of nodes. These descriptors have been used in
numerous applications [36, 37].
Delaunay Triangulation In representing an object using Delaunay
triangulation (DT), edges are formed by joining pairs of points from the set
P ¼ p
1
, p
2
, ..., p
n
fg
in such a way that as many triangles as possible are
generated, but without any crossing lines. DT is a specific triangulation based
on locally equiangular triangles [38] and is normally derived from the Voronoi
partitioning of the object shape [39, 40]. The Voronoi diagram partitions the
object into disjoint regions such that each region R
i
is composed of a subset of
points p
i
and is defined as
R
i
¼ x: E
d
x, p
i
ðÞ< E
d
x, p
j
for all j 6¼ i (10:34)
where E
d
is the Euclidean distance (describe