Pages that link to "Item:Q1158971"
From MaRDI portal
The following pages link to On the complexity of finding the convex hull of a set of points (Q1158971):
Displaying 8 items.
- A linear algorithm for finding the convex hull of a simple polygon (Q1134524) (← links)
- On the \(\Omega (n\log n)\) lower bound for convex hull and maximal vector determination (Q1140425) (← links)
- Comments on a lower bound for convex hull determination (Q1150269) (← links)
- How to reduce the average complexity of convex hull finding algorithms (Q1151049) (← links)
- Linear decision trees are too weak for convex hull problem (Q1155366) (← links)
- On the complexity of finding the convex hull of a set of points (Q1158971) (← links)
- On finding the convex hull of a simple polygon (Q3331831) (← links)
- An optimal deterministic algorithm for geodesic farthest-point Voronoi diagrams in simple polygons (Q6174809) (← links)
