Covering shapes by ellipses

Authors:
Alon Efrat;Frank Hoffmann;Christian Knauer;Klaus Kriegel;Günter Rote;Carola Wenk
Affiliations:
University of Arizona, Arizona;Freie Universität Berlin, Takustrasse 9, D-14195 Berlin, Germany;Freie Universität Berlin, Takustrasse 9, D-14195 Berlin, Germany;Freie Universität Berlin, Takustrasse 9, D-14195 Berlin, Germany;Freie Universität Berlin, Takustrasse 9, D-14195 Berlin, Germany;Freie Universität Berlin, Takustrasse 9, D-14195 Berlin, Germany
Venue:
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Year:
2002

Partition trees for triangle counting and other range searching problems

SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Efficient partition trees

Discrete & Computational Geometry - Special issue on ACM symposium on computational geometry, North Conway
Covering polygons is hard

Journal of Algorithms
Davenport-Schinzel sequences and their geometric applications

Davenport-Schinzel sequences and their geometric applications
Geometric algorithms for the analysis of 2D-electrophoresis gels

RECOMB '01 Proceedings of the fifth annual international conference on Computational biology
Algorithms for Polytope Covering and Approximation

WADS '93 Proceedings of the Third Workshop on Algorithms and Data Structures

Hi-index	0.00