Pages that link to "Item:Q3974960"

The following pages link to Computing the convex hull in the Euclidean plane in linear expected time (Q3974960):

Displaying 9 items.

• Randomized quickhull (Q675302) (← links)
• On the oscillation of the expected number of extreme points of a random set (Q756837) (← links)
• Delaunay triangulation and the convex hull of n points in expected linear time (Q799379) (← links)
• A note on the expected time required to construct the outer layer (Q1062448) (← links)
• Fast linear expected-time algorithms for computing maxima and convex hulls (Q1206440) (← links)
• Average complexity of a gift-wrapping algorithm for determining the convex hull of randomly given points (Q2365326) (← links)
• Convex Hulls of Random Walks (Q4039322) (← links)
• (Q4606269) (← links)
• LATIN 2004: Theoretical Informatics (Q5901636) (← links)