Reporting Intersections of Polygons

DOI10.1080/00207168708803553MaRDI QIDQ3811702zbMATH OpenOpenAlexFDO

Authors Richard I. Hartley

Publication date 1987

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207168708803553

zbMATH Keywords

intersectionsplane-sweeping algorithmpolygons

Mathematics Subject Classification ID

Polytopes and polyhedra (52Bxx) Searching and sorting (68P10) Analysis of algorithms and problem complexity (68Q25) Computing methodologies and applications (68U99)

Recommendations

• scientific article; zbMATH DE number 1830727
• Reporting and counting segment intersections
• Reporting intersections among thick objects.
• Reporting intersecting pairs of convex polytopes in two and three dimensions
• Reporting red-blue intersections between two sets of connected line segments
• Reporting bichromatic segment intersections from point sets
• Reporting curve segment intersections using restricted predicates
• Common intersections of polygons
• Line-segment intersection reporting in parallel
• Reporting red-blue intersections between two sets of connected ine segments

Cites work

• Algorithms for Reporting and Counting Geometric Intersections
• Comments on “algorithms for reporting and counting geometric intersections”
• Plane-sweep algorithms for intersecting geometric figures

Cited in

(16)

• Reporting red-blue intersections between two sets of connected ine segments
• Reporting and counting segment intersections
• Reporting intersecting pairs of convex polytopes in two and three dimensions
• Connected component and simple polygon intersection searching
• Efficient algorithms for counting and reporting pairwise intersections between convex polygons
• Finding Rectangle Intersections by Divide-and-Conquer
• scientific article; zbMATH DE number 3890752 (Why is no real title available?)
• scientific article; zbMATH DE number 3911725 (Why is no real title available?)
• Dynamic C-oriented polygonal intersection searching
• Hierarchical representations of collections of small rectangles
• Reassembling polygons from edges
• Reporting red-blue intersections between two sets of connected line segments
• scientific article; zbMATH DE number 1830727 (Why is no real title available?)
• Connected component and simple polygon intersection searching
• SignedIntersection -- a new algorithm for finding the intersection of two simple polygons
• Common intersections of polygons

This page was built for publication: Reporting Intersections of Polygons

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