Pages that link to "Item:Q3210183"

The following pages link to An $O(n\log ^2 h)$ Time Algorithm for the Three-Dimensional Convex Hull Problem (Q3210183):

Displayed 6 items.

• Derandomizing an output-sensitive convex hull algorithm in three dimensions (Q1346251) ‎ (← links)
• Constructing the convex hull of a partially sorted set of points (Q1803271) ‎ (← links)
• Optimal output-sensitive convex hull algorithms in two and three dimensions (Q1816462) ‎ (← links)
• Output-sensitive results on convex hulls, extreme points, and related problems (Q1816463) ‎ (← links)
• A time-optimal parallel algorithm for three-dimensional convex hulls (Q1899449) ‎ (← links)
• An Output-Sensitive Convex Hull Algorithm for Planar Objects (Q4513200) ‎ (← links)