The following pages link to (Q3969899):
Displayed 10 items.
- In-place algorithms for computing a largest clique in geometric intersection graphs (Q741534) (← links)
- A linear time algorithm for obtaining the convex hull of a simple polygon (Q1053995) (← links)
- Finding the minimum vertex distance between two disjoint convex polygons in linear time (Q1071519) (← links)
- The expected size of some graphs in computational geometry (Q1106021) (← links)
- Sphere of influence graphs: Edge density and clique size (Q1339834) (← links)
- Sphere of influence graphs in general metric spaces (Q1596920) (← links)
- Sphere of influence graphs and the \(L_{\infty}\)-metric (Q1811067) (← links)
- SIG-dimension conjecture proved for graphs having a perfect matching (Q2966508) (← links)
- Complexity, convexity, and unimodality (Q3219150) (← links)
- On the expected maximum degree of Gabriel and Yao graphs (Q3558941) (← links)