The special case where wi = 1, i = 1, . . . , n, was proposed by J. Sylvester in 1857 and amounts to finding the smallest circle that contains all the given points. The general case was introduced by Francis [3]. The most efficient algorithm known to date for the unweighted case is an O(n logn) algorithm by Shamos and Hoey [lo].' This algorithm utilizes the data structure so-called "Farthest po...

Luis P. Chimento, Alejandro S. Jakubi, and Diego Pavón Departamento de F́ısica, Universidad de Buenos Aires, 1428 Buenos Aires, Argentina Departamento de F́ısica, Universidad Autónoma de Barcelona, 08193 Bellaterra, Spain Abstract In a recent paper we showed that a quintessence scalar field plus a dissipative matter fluid can drive late cosmic accelerated expansion and simultaneously solve the co...