Data Structures for Restricted Triangular Range Searching
نویسندگان
چکیده
We present data structures for triangular emptiness and reporting queries for a planar point set, where the query triangle contains the origin. The data structures use near-linear space and achieve polylogarithmic query times.
منابع مشابه
Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing
We present a succinct representation of a set of n points on an n × n grid using n lg n + o(n lg n) bits to support orthogonal range counting in O(lg n/ lg lg n) time, and range reporting in O(k lg n/ lg lg n) time, where k is the size of the output. This achieves an improvement on query time by a factor of lg lg n upon the previous result of Mäkinen and Navarro [1], while using essentially the...
متن کاملRange restricted positivity-preserving scattered data interpolation
The construction of a range restricted bivariate C ( or G ) interpolant to scattered data is considered in which the interpolant is positive everywhere if the original data are positive. This study is motivated by earlier work in which sufficient conditions are derived on Bézier points in order to ensure that surfaces comprising cubic Bézier triangular patches are always positive and satisfy C ...
متن کاملQuerying Relational Event Graphs Using Colored Range Searching Data Structures
We present a general approach for analyzing structural parameters of a relational event graph within arbitrary query time intervals using colored range query data structures. Relational event graphs generally represent social network datasets, where each graph edge carries a timestamp. We provide data structures based on colored range searching to efficiently compute several graph parameters (e...
متن کاملRange Searching in Categorical Data: Colored Range Searching on Grid
Range searching, a fundamental problem in numerous applications areas, has been widely studied in computational geometry and spatial databases. Given a set of geometric objects, a typical range query asks for reporting all the objects that intersect a query object. However in many applications, including databases and network routing, input objects are partitioned into categories and a query as...
متن کاملEfficient Data Structures for Range Searching on a Grid
We consider the 2-dimensional range searching problem in the case where all points lie on an integer grid. A new data structure is presented that solves range queries on a U * U grid in O( k + log log U) time using O( n log n) storage, where n is the number of points and k the number of reported answers. Although the query time is very good the preprocessing time of this method is very high. A ...
متن کامل