Further Results on Generalized Intersection Searching Problems: Counting, Reporting, and Dynamization
DOI10.1006/JAGM.1995.1038zbMATH Open0839.68106OpenAlexW2042364367MaRDI QIDQ4845853FDOQ4845853
Authors: Prosenjit Gupta, Ravi Janardan, Michiel 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
Recommendations
- Further results on generalized intersection searching problems: Counting, reporting, and dynamization
- New upper bounds for generalized intersection searching problems
- GENERALIZED INTERSECTION SEARCHING PROBLEMS
- Publication:4934236
- Algorithms for generalized halfspace range searching and other intersection searching problems
Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cited In (35)
- Point enclosure problem for homothetic polygons
- Efficient range searching for categorical and plain data
- Title not available (Why is that?)
- Querying Relational Event Graphs Using Colored Range Searching Data Structures
- Hierarchical categories in colored searching
- Colored top-\(K\) range-aggregate queries
- Data structures for range-aggregation over categories
- Efficiently approximating color-spanning balls
- Computing and Combinatorics
- Two-dimensional substring indexing.
- A technique for adding range restrictions to generalized searching problems
- GENERALIZED INTERSECTION SEARCHING PROBLEMS
- The intersection searching problem for c-oriented polygons
- Dynamic range majority data structures
- Array range queries
- Adaptive data structures for 2D dominance colored range counting
- Time windowed data structures for graphs
- Partial enclosure range searching
- A new framework for addressing temporal range queries and some preliminary results
- Further results on generalized intersection searching problems: Counting, reporting, and dynamization
- Data structures for categorical path counting queries
- Title not available (Why is that?)
- Algorithms for generalized halfspace range searching and other intersection searching problems
- Approximate colored range and point enclosure queries
- 3-D vertical ray shooting and 2-D point enclosure, range searching, and arc shooting amidst convex fat objects
- I/O-optimal categorical 3-sided skyline queries
- Spaces, trees, and colors: the algorithmic landscape of document retrieval on sequences
- Title not available (Why is that?)
- Connected component and simple polygon intersection searching
- Optimal and near-optimal algorithms for generalized intersection reporting on pointer machines
- Efficient non-intersection queries on aggregated geometric data
- New upper bounds for generalized intersection searching problems
- Succinct color searching in one dimension
- On approximate colored path counting
- Querying relational event graphs using colored range searching data structures
This page was built for publication: Further Results on Generalized Intersection Searching Problems: Counting, Reporting, and Dynamization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4845853)
