Abstract
We address the problem of how to cover a set of required points by a small number of axis-parallel ellipses that avoid a second set of forbidden points. We study geometric properties of such covers and present an efficient randomized approximation algorithm for the cover construction. This question is motivated by a special pattern recognition task where one has to identify ellipse-shaped protein spots in two-dimensional electrophoresis images.
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding authors
Rights and permissions
About this article
Cite this article
Efrat, A., Hoffmann, F., Knauer, C. et al. Covering with Ellipses. Algorithmica 38, 145–160 (2004). https://doi.org/10.1007/s00453-003-1047-0
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00453-003-1047-0