Table 1.
Comparasion of different (1 + ε) − approximation algorithms to compute the diameter of T.
Fig 1.
Diagram of the partition for the point set.
Solid points are real points in the set T, while empty points are virtual points in the set of pis.
Fig 2.
Diagram of the 6n regions for the point set and the Cartesian coordinate system.
Fig 3.
(a) T(1) case; (b) T(2) case; (c) T(3) case. The theoretical error bounds are shown as dash-dotted lines.
Fig 4.
CPU time with different N values.
Points are generated similarly to the T(1) case. n = 2, 12, 100 and 300 respectively.