On modeling the query processing-relevant complexity of 2-D spatial objects

We present a conceptual framework for looking at query processing oriented complexity measures for spatial objects. We look at benefits that could result from development of such a measure. While Brinkhoff et. al. (1995) presented a complexity measure, they did not offer much theoretical justification for their choice of parameters nor for the functional form that they used.