From approximate balls to approximate ellipses

A ball spans a set of n points when none of the points lie outside it. In Zarrabi-Zadeh and Chan (Proceedings of the 18th Canadian conference on computational geometry (CCCG’06), pp 139–142, 2006) proposed an algorithm to compute an approximate spanning ball in the streaming model of computation, an...

Full description

Bibliographic Details
Published in:Journal of Global Optimization : An International Journal Dealing with Theoretical and Computational Aspects of Seeking Global Optima and Their Applications in Science, Management and Engineering, Vol. 56, No. 1 (2013), p. 27-42
Main Author: Mukhopadhyay, Asish
Other Involved Persons: Greene, Eugene ; Sarker, Animesh ; Switzer, Tom
Format: electronic Article
Physical Description:Online-Ressource
QR Code: Show QR Code