Sciweavers

102 search results - page 1 / 21
» Data Structures for Reporting Extension Violations in a Quer...
Sort
View
CCCG
2009
13 years 6 months ago
Data Structures for Reporting Extension Violations in a Query Range
Design Rule Checking (DRC) in VLSI design involves checking if a given VLSI layout satisfies a given set of rules, and reporting the violations if any. We propose data structures ...
Ananda Swarup Das, Prosenjit Gupta, Kannan Srinath...
COMPGEOM
2009
ACM
13 years 11 months ago
A general approach for cache-oblivious range reporting and approximate range counting
We present cache-oblivious solutions to two important variants of range searching: range reporting and approximate range counting. Our main contribution is a general approach for ...
Peyman Afshani, Chris H. Hamilton, Norbert Zeh
COMPGEOM
2010
ACM
13 years 10 months ago
Orthogonal range reporting: query lower bounds, optimal structures in 3-d, and higher-dimensional improvements
Orthogonal range reporting is the problem of storing a set of n points in d-dimensional space, such that the k points in an axis-orthogonal query box can be reported efficiently. ...
Peyman Afshani, Lars Arge, Kasper Dalgaard Larsen
STOC
2001
ACM
159views Algorithms» more  STOC 2001»
14 years 5 months ago
Optimal static range reporting in one dimension
We consider static one dimensional range searching problems. These problems are to build static data structures for an integer set S U, where U = {0, 1, . . . , 2w - 1}, which su...
Stephen Alstrup, Gerth Stølting Brodal, The...
SODA
2008
ACM
86views Algorithms» more  SODA 2008»
13 years 6 months ago
Space-efficient dynamic orthogonal point location, segment intersection, and range reporting
We describe an asymptotically optimal data-structure for dynamic point location for horizontal segments. For n line-segments, queries take O(log n) time, updates take O(log n) amo...
Guy E. Blelloch