Connected component and simple polygon intersection searching

DOI10.1007/3-540-57155-8_234zbMath1504.68039OpenAlexW1500116075MaRDI QIDQ5060096

Pankaj K. Agarwal, Marc J. van Kreveld

Publication date: 18 January 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-57155-8_234

Mathematics Subject Classification ID

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

Related Items (1)

On intersection searching problems involving curved objects

Cites Work

• Unnamed Item
• Unnamed Item
• Partitioning arrangements of lines. II: Applications
• General methods for adding range restrictions to decomposable searching problems
• Applications of a new space-partitioning technique
• Efficient partition trees
• Finding the connected components and a maximum clique of an intersection graph of rectangles in the plane
• Ray Shooting and Other Applications of Spanning Trees with Low Stabbing Number
• An optimal real-time algorithm for planar convex hulls
• A general approach to connected-component labeling for arbitrary image representations
• GENERALIZED INTERSECTION SEARCHING PROBLEMS
• Space searching for intersecting objects

This page was built for publication: Connected component and simple polygon intersection searching