Range-Aggregate Queries for Geometric Extent Problems

Let S be a set of n points in the plane. We present data structures that solve range-aggregate query problems on three geometric extent measure problems. Using these data structures, we can report, for any axis-parallel query rectangle Q, the area/perimeter of the convex hull, the width, and the radius of the smallest enclosing disk of the points in S ∩ Q.

• Type: Journal
• Year: 2013
• Where: CATS
• Authors: Peter Brass, Christian Knauer, Chan-Su Shin, Michiel H. M. Smid, Ivo Vigan
• Keywords: Applied Computing, CATS 2013