Covering shapes by ellipses

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 06-08-January-2002, Issue , 2002, Pages 453-454

  Efrat, Alon ^a   Hoffmann, Frank ^b   Knauer, Christian ^b   Kriegel, Klaus ^b   Rote, Gunter ^b   Wenkt, Carola ^b  

^a University of Arizona   (United States)

^b FREIE UNIVERSITÄT BERLIN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 21144443479     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (8)

1. H. Brönnimann and M. T. Goodrich, Almost Optimal Set Covers in Finite VC-Dimension Discrete Comput. Geom. 14 (1995) 463-479.
2. K.L. Clarkson, Algorithms for Polytope Covering and Approximation Proc. 3rd WADS, LNCS 709: 346-352, Springer-Verlag, 1993.
3. J.C. Culberson, R.A. Reckhow, Covering Polygons is Hard, J. Alg. 17(1) (1994): 2-44.
4. A. Efrat, F. Hoffmann, K. Kriegel, C. Schultz, and C. Wenk, Geometric Algorithms for the Analysis of 2D-Electrophoresis Gels, Proc. 5th RECOMB: 114-123, 2001.
5. N. Littlestone, Learning Quickly When Irrelevant Attributes Abound: A New Linear-Threshold Algorithm, Proc. 28th FOCS:68-77, 1987.
6. J. Matousek, Efficient Partition Trees, Discrete Comput. Geom. 8: 315-334, 1992.
7. M. Sharir and P.K. Agarwal, Davenport-Schinzel Sequences and Their Geometric Applications, Cambridge Univ. Press, 1995.
8. E. Welzl, Partition Trees for Triangle Counting and Other Range Searching Problems, Proc. 4th SoCG:23-33, 1988.