Pages that link to "Item:Q3919102"
From MaRDI portal
The following pages link to Approximation algorithms for convex hulls (Q3919102):
Displayed 15 items.
- On computing approximate convex hulls (Q584737) (← links)
- A linear time algorithm for computing the convex hull of an ordered crossing polygon (Q792775) (← links)
- An efficient and numerically correct algorithm for the 2D convex hull problem (Q919797) (← links)
- A note on approximate convex hulls (Q1072709) (← links)
- Approximating the diameter of a set of points in the Euclidean space (Q1123610) (← links)
- Fast geometric approximation techniques and geometric embedding problems (Q1202926) (← links)
- An approximate algorithm for computing multidimensional convex hulls (Q1294388) (← links)
- On the number of clusters (Q1350805) (← links)
- A new variational approach based on level-set function for convex hull problem with outliers (Q2037215) (← links)
- A new active convex hull model for image regions (Q2384092) (← links)
- Special cases of travelling salesman problems and heuristics (Q2639760) (← links)
- Approximate Polytope Membership Queries (Q4600697) (← links)
- Approximate Convex Hull of Data Streams (Q5002691) (← links)
- Economical Delone Sets for Approximating Convex Bodies (Q5116467) (← links)
- Approximating the discrete center line segment in linear time (Q6139050) (← links)