Pages that link to "Item:Q926679"
From MaRDI portal
The following pages link to A new algorithm for computing the convex hull of a planar point set (Q926679):
Displaying 15 items.
- Incremental algorithms for finding the convex hulls of circles and the lower envelopes of parabolas (Q672261) (← links)
- An efficient convex hull algorithm using affine transformation in planar point set (Q900582) (← links)
- Convex hull properties and algorithms (Q984371) (← links)
- A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra (Q1199131) (← links)
- Algorithms to determine the edges of a convex hull from its vertices (Q1758820) (← links)
- Synergistic solutions for merging and computing planar convex hulls (Q1790964) (← links)
- An effective method to determine whether a point is within a convex hull and its generalized convex polyhedron classifier (Q2225169) (← links)
- A modified Graham's convex hull algorithm for finding the connected orthogonal convex hull of a finite planar point set (Q2242054) (← links)
- A fast algorithm to decide the inclusion of a point in the convex hull of a two-dimensional point set (Q2775708) (← links)
- Another Classroom Example of Robustness Problems in Planar Convex Hull Computation (Q2807866) (← links)
- ALGORITHMS FOR BALL HULLS AND BALL INTERSECTIONS IN NORMED PLANES (Q2970416) (← links)
- The implementation of an algorithm to find the convex hull of a set of three-dimensional points (Q3358263) (← links)
- (Q3775011) (← links)
- (Q3814809) (← links)
- Construction of some computational algorithms on finite sets of points in the plane (Q4884269) (← links)
