Pages that link to "Item:Q1053995"
From MaRDI portal
The following pages link to A linear time algorithm for obtaining the convex hull of a simple polygon (Q1053995):
Displaying 4 items.
- A linear time algorithm for computing the convex hull of an ordered crossing polygon (Q792775) (← links)
- Approximate polytope ensemble for one-class classification (Q898344) (← links)
- Finding the convex hull of a simple polygon in linear time (Q1096406) (← links)
- A novel algorithm for finding convex hull of a generic polygon with simulation of progressively supporting elastic lines (Q6618153) (← links)