Pages that link to "Item:Q1107994"

The following pages link to A new O(n\(\cdot \log \,n)\) algorithm for computing the intersection of convex polygons (Q1107994):

Displaying 10 items.

• Efficient algorithms for counting and reporting pairwise intersections between convex polygons (Q294592) (← links)
• Detecting the intersection of convex objects in the plane (Q1183506) (← links)
• A simple linear algorithm for intersecting convex polygons (Q1822240) (← links)
• An $O(E\log E + I)$ Expected Time Algorithm for the Planar Segment Intersection Problem (Q3685220) (← links)
• (Q4256651) (← links)
• (Q4698691) (← links)
• An Optimal Algorithm for the Intersection Radius of a Set of Convex Polygons (Q4876693) (← links)
• An O(log log n) algorithm to compute the kernel of a polygon (Q5054771) (← links)
• (Q5368724) (← links)
• Intersecting disks using two congruent disks (Q5925580) (← links)