This work presents a comparative study of some multiresolution representations for polygonal lines. We study the strip tree, the arc tree and the box tree data structures, comparing their performance for construction, drawing, intersection and selection; and memory storage costs. The comparation uses actual databases available in the Internet. The goal of this study is to identify techniques and algorithms for interactive exploration of large cartographic data bases.