Pages that link to "Item:Q1337401"
From MaRDI portal
The following pages link to Computing convex hull in a floating point arithmetic (Q1337401):
Displaying 16 items.
- Error control in polytope computations (Q700748) (← links)
- Constructing strongly convex hulls using exact or rounded arithmetic (Q1201743) (← links)
- Why does information-based complexity use the real number model? (Q1292417) (← links)
- Exact computation of the sign of a finite sum (Q1294292) (← links)
- Numerical stability of a convex hull algorithm for simple polygons (Q1310463) (← links)
- Robust gift wrapping for the three-dimensional convex hull (Q1337472) (← links)
- Euclidean minimum spanning trees with independent and dependent geometric uncertainties (Q1984604) (← links)
- Fast and accurate floating point summation with application to computational geometry (Q2387749) (← links)
- Using interval arithmetic for determining the structure of convex hulls (Q2387769) (← links)
- Classroom examples of robustness problems in geometric computations (Q2479475) (← links)
- FLOATING-POINT ARITHMETIC FOR COMPUTATIONAL GEOMETRY PROBLEMS WITH UNCERTAIN DATA (Q3401892) (← links)
- Computing Two-Dimensional Integer Hulls (Q4268868) (← links)
- A CONVEX HULL ALGORITHM FOR POINTS WITH APPROXIMATELY KNOWN POSITIONS (Q4312276) (← links)
- EXACT AND OPTIMAL CONVEX HULLS IN 2D (Q4682192) (← links)
- Voronoi Diagram and Delaunay Triangulation with Independent and Dependent Geometric Uncertainties (Q5072221) (← links)
- A Provably Robust Algorithm for Triangle-triangle Intersections in Floating-point Arithmetic (Q5883709) (← links)
