Computing Geometric Structures of Low Stabbing Number in the Plane∗

Abstract

The stabbing number of a geometric structure in IR with respect to lines is the maximum number of times any line stabs (intersects) the structure. We present algorithms for constructing popular geometric data structures with small stabbing number and for computing lower bounds on an optimal solution. We evaluate our methods experimentally.

Extracted Key Phrases

3 Figures and Tables

Cite this paper

@inproceedings{Mitchell2007ComputingGS, title={Computing Geometric Structures of Low Stabbing Number in the Plane∗}, author={Joseph S. B. Mitchell and Eli Packer}, year={2007} }