On intersection searching problems involving curved objects

DOI10.1007/3-540-58218-5_17zbMath1502.68322OpenAlexW1498691581MaRDI QIDQ5054760

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

Publication date: 9 December 2022

Published in: Algorithm Theory — SWAT '94 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-58218-5_17

Mathematics Subject Classification ID

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

Related Items

A technique for adding range restrictions to generalized 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

Cites Work

• Unnamed Item
• Fast detection of polyhedral intersection
• On \(k\)-sets in arrangements of curves and surfaces
• Quasi-optimal range searching in spaces of finite VC-dimension
• Counting Circular Arc Intersections
• Intersection Queries in Curved Objects
• Intersection queries in sets of disks
• Connected component and simple polygon intersection searching
• Further results on generalized intersection searching problems: Counting, reporting, and dynamization
• On range searching with semialgebraic sets
• GENERALIZED INTERSECTION SEARCHING PROBLEMS