New upper bounds for generalized intersection searching problems

DOI10.1007/3-540-60084-1_97MaRDI QIDQ4645201zbMATHOpenAlexFDO

Authors Panayiotis Bozanis, Nectarios Kitsios, Christos Makris, 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)

Recommendations

• Further results on generalized intersection searching problems: Counting, reporting, and dynamization
• Further Results on Generalized Intersection Searching Problems: Counting, Reporting, and Dynamization
• Publication:4934236
• Algorithms for generalized halfspace range searching and other intersection searching problems
• Lower bounds for intersection searching and fractional cascading in higher dimension

Cites work

• scientific article; zbMATH DE number 4211552 (Why is no real title available?)
• scientific article; zbMATH DE number 4062593 (Why is no real title available?)
• A Functional Approach to Data Structures and Its Use in Multidimensional Searching
• Adding range restriction capability to dynamic data structures
• An optimal algorithm for intersecting line segments in the plane
• Further Results on Generalized Intersection Searching Problems: Counting, Reporting, and Dynamization
• GENERALIZED INTERSECTION SEARCHING PROBLEMS
• Geometric retrieval problems
• Making data structures persistent
• Optimal Search in Planar Subdivisions
• Point retrieval for polygons

Cited in

(16)

• Optimal and near-optimal algorithms for generalized intersection reporting on pointer machines
• Succinct color searching in one dimension
• A technique for adding range restrictions to generalized searching problems
• I/O-optimal categorical 3-sided skyline queries
• Time windowed data structures for graphs
• scientific article; zbMATH DE number 7561469 (Why is no real title available?)
• Querying relational event graphs using colored range searching data structures
• Further results on generalized intersection searching problems: Counting, reporting, and dynamization
• GENERALIZED INTERSECTION SEARCHING PROBLEMS
• Point enclosure problem for homothetic polygons
• Colored top-\(K\) range-aggregate queries
• Further Results on Generalized Intersection Searching Problems: Counting, Reporting, and Dynamization
• Cross-document pattern matching
• Lower bounds for set intersection queries
• Colored range queries and document retrieval
• WCET free time analysis of hard real-time systems on multiprocessors: A regular language-based model

This page was built for publication: New upper bounds for generalized intersection searching problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4645201)