Further Results on Generalized Intersection Searching Problems: Counting, Reporting, and Dynamization
From MaRDI portal
Publication:4845853
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
Cited in
(35)- Optimal and near-optimal algorithms for generalized intersection reporting on pointer machines
- Connected component and simple polygon intersection searching
- Computing and Combinatorics
- A new framework for addressing temporal range queries and some preliminary results
- Two-dimensional substring indexing.
- Succinct color searching in one dimension
- A technique for adding range restrictions to generalized searching problems
- Array range queries
- I/O-optimal categorical 3-sided skyline queries
- Time windowed data structures for graphs
- Efficient non-intersection queries on aggregated geometric data
- Efficiently approximating color-spanning balls
- On approximate colored path counting
- scientific article; zbMATH DE number 7561469 (Why is no real title available?)
- Data structures for range-aggregation over categories
- Querying relational event graphs using colored range searching data structures
- Further results on generalized intersection searching problems: Counting, reporting, and dynamization
- Algorithms for generalized halfspace range searching and other intersection searching problems
- GENERALIZED INTERSECTION SEARCHING PROBLEMS
- Approximate colored range and point enclosure queries
- Adaptive data structures for 2D dominance colored range counting
- Hierarchical categories in colored searching
- Point enclosure problem for homothetic polygons
- 3-D vertical ray shooting and 2-D point enclosure, range searching, and arc shooting amidst convex fat objects
- Colored top-\(K\) range-aggregate queries
- The intersection searching problem for c-oriented polygons
- Efficient range searching for categorical and plain data
- Spaces, trees, and colors: the algorithmic landscape of document retrieval on sequences
- Dynamic range majority data structures
- New upper bounds for generalized intersection searching problems
- Data structures for categorical path counting queries
- scientific article; zbMATH DE number 1389816 (Why is no real title available?)
- scientific article; zbMATH DE number 7378722 (Why is no real title available?)
- Querying Relational Event Graphs Using Colored Range Searching Data Structures
- Partial enclosure range searching
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)
