In this thesis, we show that the Gabriel Decomposition is a subset of the Delaunay Triangulation and a superset of the Relative Neighbor Decomposition.
By using this relation, an O($n^2$) time algorithm for computing the Relative Neighbor Decomposition of n-vertex polygon is presented which is more efficient than Toussaint's(O($n^3$)).