Further Results on Generalized Intersection Searching Problems: Counting, Reporting, and Dynamization
From MaRDI portal
Publication:4845853
DOI10.1006/jagm.1995.1038zbMath0839.68106OpenAlexW2042364367MaRDI QIDQ4845853
Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid
Publication date: 28 May 1996
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jagm.1995.1038
Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items
Efficiently approximating color-spanning balls, A technique for adding range restrictions to generalized searching problems, Dynamic range majority data structures, DATA STRUCTURES FOR RANGE-AGGREGATION OVER CATEGORIES, 3-D vertical ray shooting and 2-D point enclosure, range searching, and arc shooting amidst convex fat objects, Connected component and simple polygon intersection searching, I/O-optimal categorical 3-sided skyline queries, Efficient range searching for categorical and plain data, Two-dimensional substring indexing., Adaptive data structures for 2D dominance colored range counting, Point enclosure problem for homothetic polygons, Querying relational event graphs using colored range searching data structures, Unnamed Item, Querying Relational Event Graphs Using Colored Range Searching Data Structures, Colored top-\(K\) range-aggregate queries, New upper bounds for generalized intersection searching problems, Spaces, Trees, and Colors, A new framework for addressing temporal range queries and some preliminary results, Unnamed Item, Approximate colored range and point enclosure queries, EFFICIENT NON-INTERSECTION QUERIES ON AGGREGATED GEOMETRIC DATA, Optimal and near-optimal algorithms for generalized intersection reporting on pointer machines, Array Range Queries, Time Windowed Data Structures for Graphs, Data structures for categorical path counting queries, Algorithms for generalized halfspace range searching and other intersection searching problems, Succinct Color Searching in One Dimension
