Pages that link to "Item:Q4312276"
From MaRDI portal
The following pages link to A CONVEX HULL ALGORITHM FOR POINTS WITH APPROXIMATELY KNOWN POSITIONS (Q4312276):
Displaying 11 items.
- Preprocessing imprecise points for Delaunay triangulation: simplified and extended (Q644800) (← links)
- An algorithm to find the lineality space of the positive hull of a set of vectors (Q662122) (← links)
- An efficient convex hull algorithm using affine transformation in planar point set (Q900582) (← links)
- Constructing strongly convex hulls using exact or rounded arithmetic (Q1201743) (← links)
- Computing convex hull in a floating point arithmetic (Q1337401) (← links)
- An effective method to determine whether a point is within a convex hull and its generalized convex polyhedron classifier (Q2225169) (← links)
- Using interval arithmetic for determining the structure of convex hulls (Q2387769) (← links)
- Convex hulls under uncertainty (Q2408916) (← links)
- Minimizing co-location potential of moving entities (Q2829447) (← links)
- Delaunay Triangulation of Imprecise Points Simplified and Extended (Q3183447) (← links)
- The implementation of an algorithm to find the convex hull of a set of three-dimensional points (Q3358263) (← links)
