Pages that link to "Item:Q1140425"
From MaRDI portal
The following pages link to On the \(\Omega (n\log n)\) lower bound for convex hull and maximal vector determination (Q1140425):
Displaying 11 items.
- Connecting colored point sets (Q868381) (← links)
- Some dynamic computational geometry problems (Q1071526) (← links)
- A variant of Ben-Or's lower bound for algebraic decision trees (Q1096401) (← links)
- Comments on a lower bound for convex hull determination (Q1150269) (← 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)
- Maintenance of configurations in the plane (Q1158972) (← links)
- Comparisons between linear functions can help (Q1170029) (← links)
- Lower bounds for maximal and convex layers problems (Q1825651) (← links)
- On constant factors in comparison-based geometric algorithms and data structures (Q2349854) (← links)
- An optimal deterministic algorithm for geodesic farthest-point Voronoi diagrams in simple polygons (Q6174809) (← links)
