Comments on “algorithms for reporting and counting geometric intersections”

DOI10.1109/TC.1981.6312179zbMath0447.68120OpenAlexW2011318166WikidataQ60017373 ScholiaQ60017373MaRDI QIDQ3893371

Kevin Q. Brown

Publication date: 1981

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tc.1981.6312179

zbMATH Keywords

computational geometryoptimal algorithmsgeometric intersection problems

Mathematics Subject Classification ID

Computing methodologies and applications (68U99)

Related Items (15)

Space reduction and an extension for a hidden line elimination algorithm ⋮ Euclidean chains and their shortcuts ⋮ Polygonal intersection searching ⋮ Partitioning arrangements of lines. II: Applications ⋮ Design of the CGAL 3D spherical kernel and application to arrangements of circles on a sphere ⋮ A worst-case efficient algorithm for hidden-line elimination^† ⋮ Reporting Intersections of Polygons ⋮ A tight upper bound for the number of intersections between two rectangulars paths ⋮ Algorithms for the line-constrained disk coverage and related problems ⋮ An optimal time and minimal space algorithm for rectangle intersection problems ⋮ Improved output-sensitive snap rounding ⋮ Algorithms for the line-constrained disk coverage and related problems ⋮ Topological sweep of the complete graph ⋮ An improved upper bound on the number of intersections between two rectangular paths ⋮ Reporting and counting segment intersections

This page was built for publication: Comments on “algorithms for reporting and counting geometric intersections”