Algorithms for generalized halfspace range searching and other intersection searching problems

DOI10.1016/0925-7721(94)00019-0zbMath0849.68024OpenAlexW1584486777MaRDI QIDQ1917041

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

Publication date: 4 November 1996

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0925-7721(94)00019-0

zbMATH Keywords

filtering searchpersistent data structuresintersection searching problem

Mathematics Subject Classification ID

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

Related Items (4)

A technique for adding range restrictions to generalized searching problems ⋮ DATA STRUCTURES FOR RANGE-AGGREGATION OVER CATEGORIES ⋮ 3-D vertical ray shooting and 2-D point enclosure, range searching, and arc shooting amidst convex fat objects ⋮ EFFICIENT NON-INTERSECTION QUERIES ON AGGREGATED GEOMETRIC DATA

Cites Work

• Unnamed Item
• Range searching with efficient hierarchical cuttings
• On ray shooting in convex polytopes
• More on k-sets of finite sets in the plane
• The power of geometric duality
• Making data structures persistent
• Cutting hyperplane arrangements
• Efficient partition trees
• Connected component and simple polygon intersection searching
• Intersection Queries in Curved Objects
• Filtering Search: A New Approach to Query-Answering
• New Upper Bounds in Klee’s Measure Problem
• Algorithms for ray-shooting and intersection searching
• On intersection searching problems involving curved objects
• Further results on generalized intersection searching problems: Counting, reporting, and dynamization
• GENERALIZED INTERSECTION SEARCHING PROBLEMS
• Space searching for intersecting objects

This page was built for publication: Algorithms for generalized halfspace range searching and other intersection searching problems