A technique for adding range restrictions to generalized searching problems

DOI10.1016/S0020-0190(97)00183-XzbMath1339.68267OpenAlexW2070356817MaRDI QIDQ293144

Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid

Publication date: 9 June 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S002001909700183X?np=y

zbMATH Keywords

data structurescomputational geometryintersection searchingrange restriction

Mathematics Subject Classification ID

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

Related Items (4)

DATA STRUCTURES FOR RANGE-AGGREGATION OVER CATEGORIES ⋮ Colored top-\(K\) range-aggregate queries ⋮ Efficient Top-k Queries for Orthogonal Ranges ⋮ EFFICIENT NON-INTERSECTION QUERIES ON AGGREGATED GEOMETRIC DATA

Cites Work

• General methods for adding range restrictions to decomposable searching problems
• Decomposable searching problems
• 3-D vertical ray shooting and 2-D point enclosure, range searching, and arc shooting amidst convex fat objects
• Algorithms for generalized halfspace range searching and other intersection searching problems
• Connected component and simple polygon intersection searching
• Adding range restriction capability to dynamic data structures
• Using persistent data structures for adding range restrictions to searching problems
• Further Results on Generalized Intersection Searching Problems: Counting, Reporting, and Dynamization
• On intersection searching problems involving curved objects
• GENERALIZED INTERSECTION SEARCHING PROBLEMS

This page was built for publication: A technique for adding range restrictions to generalized searching problems