Connected component and simple polygon intersection searching

DOI10.1007/3-540-57155-8_234MaRDI QIDQ5060096zbMATH OpenOpenAlexFDO

Authors Pankaj K. Agarwal, Marc 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

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

Recommendations

• Connected component and simple polygon intersection searching
• Space searching for intersecting objects
• Reporting Intersections of Polygons
• Dynamic C-oriented polygonal intersection searching
• Efficient dynamic algorithms for some geometric intersection problems

Cites work

• A general approach to connected-component labeling for arbitrary image representations
• An optimal real-time algorithm for planar convex hulls
• 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
• General methods for adding range restrictions to decomposable searching problems
• GENERALIZED INTERSECTION SEARCHING PROBLEMS
• scientific article; zbMATH DE number 3887061 (Why is no real title available?)
• scientific article; zbMATH DE number 5542185 (Why is no real title available?)
• Partitioning arrangements of lines. II: Applications
• Ray Shooting and Other Applications of Spanning Trees with Low Stabbing Number
• Space searching for intersecting objects

Cited in

(7)

• Connected component and simple polygon intersection searching
• COMPACT INTERVAL TREES: A DATA STRUCTURE FOR CONVEX HULLS
• Dynamic C-oriented polygonal intersection searching
• On computing connected components of line segments
• On intersection searching problems involving curved objects
• Space searching for intersecting objects
• The intersection searching problem for c-oriented polygons

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5060096)