Pages that link to "Item:Q919797"
From MaRDI portal
The following pages link to An efficient and numerically correct algorithm for the 2D convex hull problem (Q919797):
Displaying 17 items.
- A new algorithm for computing the convex hull of a planar point set (Q926679) (← links)
- Convex hull properties and algorithms (Q984371) (← links)
- Some performance tests of convex hull algorithms (Q1070524) (← links)
- Exact computation of the sign of a finite sum (Q1294292) (← links)
- Numerical stability of a convex hull algorithm for simple polygons (Q1310463) (← links)
- Computing convex hull in a floating point arithmetic (Q1337401) (← links)
- An auxiliary theorem for stability analysis in the presence of interval- valued parameters (Q1337490) (← links)
- Convex-hull algorithms: implementation, testing, and experimentation (Q1712057) (← links)
- On computing the closest boundary point on the convex hull (Q1824383) (← links)
- An algorithm for the construction of convex hulls in simple integer recourse programming (Q1918422) (← links)
- A fast and efficient algorithm for determining the connected orthogonal convex hulls (Q2671859) (← links)
- (Q3814809) (← links)
- Computing the convex hull in the Euclidean plane in linear expected time (Q3974960) (← links)
- Computing Two-Dimensional Integer Hulls (Q4268868) (← links)
- Convex hull of a planar set of straight and circular line segments (Q4484714) (← links)
- EXACT AND OPTIMAL CONVEX HULLS IN 2D (Q4682192) (← links)
- Applications of a semi-dynamic convex hull algorithm (Q5056119) (← links)
