Efficient algorithms for counting and reporting pairwise intersections between convex polygons

DOI10.1016/S0020-0190(98)00187-2zbMath1339.68268OpenAlexW2066537884MaRDI QIDQ294592

Ravi Janardan, Prosenjit Gupta, Michiel H. M. Smid

Publication date: 16 June 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019098001872?np=y

zbMATH Keywords

data structurescomputational geometry

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05)

Related Items (4)

Efficient algorithms for counting and reporting pairwise intersections between convex polygons ⋮ Optimal algorithms for some polygon enclosure problems for VLSI layout analysis ⋮ Algorithms for the multiple label placement problem ⋮ Reporting intersecting pairs of convex polytopes in two and three dimensions

Cites Work

• Efficient algorithms for counting and reporting pairwise intersections between convex polygons
• Efficient partition trees
• Quasi-optimal upper bounds for simplex range searching and new zone theorems
• An optimal algorithm for intersecting line segments in the plane
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Efficient algorithms for counting and reporting pairwise intersections between convex polygons