Pages that link to "Item:Q3922189"
From MaRDI portal
The following pages link to A Lower Bound to Finding Convex Hulls (Q3922189):
Displaying 33 items.
- On computing approximate convex hulls (Q584737) (← links)
- Optimal parallel algorithms for computing convex hulls and for sorting (Q594601) (← links)
- Randomized quickhull (Q675302) (← links)
- Fast randomized parallel methods for planar convex hull construction (Q676065) (← links)
- A new algorithm for computing the convex hull of a planar point set (Q926679) (← links)
- Convex hull properties and algorithms (Q984371) (← links)
- Some performance tests of convex hull algorithms (Q1070524) (← links)
- Some dynamic computational geometry problems (Q1071526) (← links)
- A variant of Ben-Or's lower bound for algebraic decision trees (Q1096401) (← links)
- Finding the convex hull of a sorted point set in parallel (Q1108791) (← links)
- On selecting the k largest with median tests (Q1115626) (← 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)
- Maintenance of configurations in the plane (Q1158972) (← links)
- On the complexity of the extreme points decision problem (Q1183448) (← links)
- A lower bound for randomized algebraic decision trees (Q1386178) (← links)
- Lower bounds for parallel algebraic decision trees, parallel complexity of convex hulls and related problems (Q1389649) (← links)
- Routing in a polygonal terrain with the shortest beacon watchtower (Q1699277) (← links)
- Constructing the convex hull of a partially sorted set of points (Q1803271) (← links)
- Lower bounds for maximal and convex layers problems (Q1825651) (← links)
- Efficiently testing digital convexity and recognizing digital convex polygons (Q2203347) (← links)
- A filtering technique for fast convex hull construction in \(\mathbb{R}^2\) (Q2279854) (← links)
- Subquadratic algorithms for algebraic 3SUM (Q2415376) (← links)
- Quasi-Monotonic Sequences: Theory, Algorithms and Applications (Q3033808) (← links)
- A note on bicriterion programming (Q3040940) (← links)
- Finding the Convex Hull of Discs in Parallel (Q4513213) (← links)
- Distribution-sensitive algorithms (Q5054869) (← links)
- An optimal algorithm to compute the inverse beacon attraction region (Q5115823) (← links)
- Efficient Algorithms to Test Digital Convexity (Q5237086) (← links)
- An optimal deterministic algorithm for geodesic farthest-point Voronoi diagrams in simple polygons (Q6174809) (← links)
