GENERALIZED INTERSECTION SEARCHING PROBLEMS

From MaRDI portal
Publication:5289294

DOI10.1142/S021819599300004XzbMath0777.68078MaRDI QIDQ5289294

Ravi Janardan, Mario A. Lopez

Publication date: 22 August 1993

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)




Related Items (24)

A technique for adding range restrictions to generalized searching problemsOn intersection searching problems involving curved objectsDATA STRUCTURES FOR RANGE-AGGREGATION OVER CATEGORIESFurther results on generalized intersection searching problems: Counting, reporting, and dynamization3-D vertical ray shooting and 2-D point enclosure, range searching, and arc shooting amidst convex fat objectsAlgorithms for generalized halfspace range searching and other intersection searching problemsThe submatrices character count problem: An efficient solution using separable valuesConnected component and simple polygon intersection searchingI/O-optimal categorical 3-sided skyline queriesEfficient range searching for categorical and plain dataColored range queries and document retrievalQuerying relational event graphs using colored range searching data structuresQuerying Relational Event Graphs Using Colored Range Searching Data StructuresNew upper bounds for generalized intersection searching problemsSpaces, Trees, and ColorsA new framework for addressing temporal range queries and some preliminary resultsUnnamed ItemConnected component and simple polygon intersection searchingApproximate colored range and point enclosure queriesEFFICIENT NON-INTERSECTION QUERIES ON AGGREGATED GEOMETRIC DATAOptimal and near-optimal algorithms for generalized intersection reporting on pointer machinesArray Range QueriesAlgorithms for generalized halfspace range searching and other intersection searching problemsSuccinct Color Searching in One Dimension




This page was built for publication: GENERALIZED INTERSECTION SEARCHING PROBLEMS