Adaptive data structures for 2D dominance colored range counting
From MaRDI portal
Publication:6179432
DOI10.1007/978-3-031-38906-1_30OpenAlexW4385367617MaRDI QIDQ6179432
Publication date: 16 January 2024
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-38906-1_30
computational geometryadaptive data structuresstabbing queriescolored range countingdominance range counting
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the equivalence of some rectangle problems
- Data structures for categorical path counting queries
- Efficient range searching for categorical and plain data
- Colored Range Searching in Linear Space
- Efficient Colored Orthogonal Range Counting
- Further Results on Generalized Intersection Searching Problems: Counting, Reporting, and Dynamization
- Approximate range counting revisited
- Adaptive and Approximate Orthogonal Range Counting
- Succinct Color Searching in One Dimension
- Better Data Structures for Colored Orthogonal Range Reporting
- Orthogonal range searching on the RAM, revisited
- Space-Efficient and Fast Algorithms for Multidimensional Dominance Reporting and Counting
- Algorithms for generalized halfspace range searching and other intersection searching problems
This page was built for publication: Adaptive data structures for 2D dominance colored range counting
