Pages that link to "Item:Q1862123"
From MaRDI portal
The following pages link to Reporting intersecting pairs of convex polytopes in two and three dimensions (Q1862123):
Displaying 7 items.
- Efficient algorithms for counting and reporting pairwise intersections between convex polygons (Q294592) (← links)
- A dual approach to detect polyhedral intersections in arbitrary dimensions (Q758179) (← links)
- Optimal algorithms for some polygon enclosure problems for VLSI layout analysis (Q864923) (← links)
- Reporting intersections among thick objects. (Q1853186) (← links)
- Counting and representing intersections among triangles in three dimensions (Q2571213) (← links)
- Reporting Intersections of Polygons (Q3811702) (← links)
- Efficiently stabbing convex polygons and variants of the Hadwiger-Debrunner \((p, q)\)-theorem (Q5881548) (← links)