New upper bounds for generalized intersection searching problems

DOI10.1007/3-540-60084-1_97zbMath1412.68287OpenAlexW1502823945MaRDI QIDQ4645201

Christos Makris, Panayiotis Bozanis, Nectarios Kitsios, Athanasios K. Tsakalidis

Publication date: 10 January 2019

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-60084-1_97

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items

I/O-optimal categorical 3-sided skyline queries ⋮ Colored range queries and document retrieval ⋮ Cross-document pattern matching ⋮ Point enclosure problem for homothetic polygons ⋮ Querying relational event graphs using colored range searching data structures ⋮ Colored top-\(K\) range-aggregate queries ⋮ WCET free time analysis of hard real-time systems on multiprocessors: A regular language-based model ⋮ Unnamed Item ⋮ Time Windowed Data Structures for Graphs ⋮ Succinct Color Searching in One Dimension

Cites Work

• Unnamed Item
• Unnamed Item
• Making data structures persistent
• Geometric retrieval problems
• Adding range restriction capability to dynamic data structures
• Point retrieval for polygons
• Optimal Search in Planar Subdivisions
• An optimal algorithm for intersecting line segments in the plane
• A Functional Approach to Data Structures and Its Use in Multidimensional Searching
• Further Results on Generalized Intersection Searching Problems: Counting, Reporting, and Dynamization
• GENERALIZED INTERSECTION SEARCHING PROBLEMS