Efficient algorithms for counting and reporting pairwise intersections between convex polygons
DOI10.1016/S0020-0190(98)00187-2zbMATH Open1339.68268OpenAlexW2066537884MaRDI QIDQ294592FDOQ294592
Authors: Prosenjit Gupta, Ravi Janardan, Michiel 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
Recommendations
- Reporting intersecting pairs of convex polytopes in two and three dimensions
- scientific article; zbMATH DE number 1830727
- Reporting Intersections of Polygons
- A simple linear algorithm for intersecting convex polygons
- A new O(n\(\cdot \log \,n)\) algorithm for computing the intersection of convex polygons
Data structures (68P05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational aspects related to convexity (52B55)
Cites Work
- Title not available (Why is that?)
- Efficient partition trees
- An optimal algorithm for intersecting line segments in the plane
- Quasi-optimal upper bounds for simplex range searching and new zone theorems
- Efficient algorithms for counting and reporting pairwise intersections between convex polygons
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (6)
- An algorithm for set operations on nonconvex polygons (with an application to census tracts)
- Title not available (Why is that?)
- Optimal algorithms for some polygon enclosure problems for VLSI layout analysis
- Efficient algorithms for counting and reporting pairwise intersections between convex polygons
- Reporting intersecting pairs of convex polytopes in two and three dimensions
- Algorithms for the multiple label placement problem
This page was built for publication: Efficient algorithms for counting and reporting pairwise intersections between convex polygons
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q294592)
