Connected component and simple polygon intersection searching
From MaRDI portal
Publication:5060096
Recommendations
Cites work
- scientific article; zbMATH DE number 3887061 (Why is no real title available?)
- scientific article; zbMATH DE number 5542185 (Why is no real title available?)
- 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
- GENERALIZED INTERSECTION SEARCHING PROBLEMS
- General methods for adding range restrictions to decomposable searching problems
- 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
(5)
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)