Range-Aggregate Proximity Detection for Design Rule Checking in VLSI Layouts

In a range-aggegate query problem we wish to preprocess a set S of geometric objects such that given a query orthogonal range q, a certain intersection or proximity query on the objects of S intersected by q can be answered efficiently. Although range-aggregate queries have been widely investigated in the past for aggregation functions like average, count, min, max, sum etc. there is little work on proximity problems. In this paper, we consider the problem of determining if any pair of points in a query range are within a constant of each other. We consider variants with ranges being a vertical strip, a quadrant and a rectangle. All our solutions work in close to linear space and polylogarithmic query time.

• Type: Conference
• Year: 2006
• Where: CCCG
• Authors: R. Sharathkumar, Prosenjit Gupta
• Keywords: CCCG 2006, CCCG 2007, Proximity Query, Query Orthogonal Range, Range-aggegate Query Problem