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.

[1]  Prosenjit Gupta.  Range-Aggregate Query Problems Involving Geometric Aggregation Operations , 2006, Nord. J. Comput..

[2]  Michiel H. M. Smid,et al.  Efficient Non-intersection Queries on Aggregated Geometric Data , 2005, COCOON.

[3]  K. Srinathan,et al.  Range-Aggregate Queries Involving Geometric Aggregation Operations , 2011, WALCOM.

[4]  Joseph O'Rourke,et al.  Computational geometry in C (2nd ed.) , 1998 .

[5]  Joseph O'Rourke,et al.  Computational Geometry in C. , 1995 .

[6]  David Eppstein.  Dynamic Three-Dimensional Linear Programming , 1992, INFORMS J. Comput..

[7]  Prosenjit Gupta,et al.  Range-Aggregate Proximity Detection for Design Rule Checking in VLSI Layouts , 2006, CCCG.

[8]  Michiel H. M. Smid,et al.  Two-Dimensional Range Diameter Queries , 2012, LATIN.

[9]  Timothy M. Chan.  A Fully Dynamic Algorithm for Planar Width , 2003, Discret. Comput. Geom..

[10]  K. Srinathan,et al.  Counting Maximal Points in a Query Orthogonal Rectangle , 2013, WALCOM.

[11]  Mark de Berg,et al.  Computational geometry: algorithms and applications , 1997 .

[12]  Michiel H. M. Smid,et al.  On the power of the semi-separated pair decomposition , 2009, Comput. Geom..

[13]  Michiel H. M. Smid,et al.  Approximating range-aggregate queries using coresets , 2010, CCCG.

[14]  Prosenjit Gupta,et al.  Range aggregate structures for colored geometric objects , 2010, CCCG.

[15]  Jan van Leeuwen,et al.  Maintenance of Configurations in the Plane , 1981, J. Comput. Syst. Sci..

[16]  David G. Kirkpatrick,et al.  Determining the Separation of Preprocessed Polyhedra - A Unified Approach , 1990, ICALP.

[17]  Yufei Tao,et al.  Range aggregate processing in spatial databases , 2004, IEEE Transactions on Knowledge and Data Engineering.

[18]  J. O´Rourke,et al.  Computational Geometry in C: Arrangements , 1998 .

[19]  David G. Kirkpatrick,et al.  Computing Common Tangents Without a Separating Line , 1995, WADS.

[20]  Pankaj K. Agarwal,et al.  Geometric Range Searching and Its Relatives , 2007 .

[21]  Michiel H. M. Smid,et al.  Data structures for range-aggregate extent queries , 2008, Comput. Geom..

[22]  Gerth Stølting Brodal,et al.  Dynamic Planar Range Maxima Queries , 2011, ICALP.