Pages that link to "Item:Q1096406"

The following pages link to Finding the convex hull of a simple polygon in linear time (Q1096406):

Displaying 12 items.

• A linear-time algorithm to compute the triangular hull of a digital object (Q528337) (← links)
• Convex hulls of objects bounded by algebraic curves (Q802894) (← links)
• The orthogonal convex skull problem (Q1102544) (← links)
• Computing the shortest diagonal of a monotone polygon in linear time (Q1198084) (← links)
• Numerical stability of a convex hull algorithm for simple polygons (Q1310463) (← links)
• Optimal computation of finitely oriented convex hulls (Q1820432) (← links)
• Space-efficient algorithms for computing the convex hull of a simple polygonal line in linear time (Q2489016) (← links)
• A linear time algorithm to remove winding of a simple polygon (Q2489541) (← links)
• Convex hull of a planar set of straight and circular line segments (Q4484714) (← links)
• An Output-Sensitive Convex Hull Algorithm for Planar Objects (Q4513200) (← links)
• Finding the convex hull of a simple polygon (Q5896232) (← links)
• LATIN 2004: Theoretical Informatics (Q5901636) (← links)