Numerical stability of a convex hull algorithm for simple polygons
From MaRDI portal
Recommendations
Cites work
- A linear algorithm for finding the convex hull of a simple polygon
- A new linear convex hull algorithm for simple polygons (Corresp.)
- An efficient algorithm for determining the convex hull of a finite planar set
- Constructing strongly convex approximate hulls with inaccurate primitives
- Finding the convex hull of a simple polygon
- Finding the convex hull of a simple polygon in linear time
- scientific article; zbMATH DE number 3919830 (Why is no real title available?)
- scientific article; zbMATH DE number 4032498 (Why is no real title available?)
- On finding the convex hull of a simple polygon
- On-line construction of the convex hull of a simple polyline
Cited in
(6)- Why does information-based complexity use the real number model?
- Exact computation of the sign of a finite sum
- Computing convex hull in a floating point arithmetic
- Constructing strongly convex approximate hulls with inaccurate primitives
- EXACT AND OPTIMAL CONVEX HULLS IN 2D
- NUMERICAL STABILITY OF ALGORITHMS FOR 2D DELAUNAY TRIANGULATIONS
This page was built for publication: Numerical stability of a convex hull algorithm for simple polygons
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1310463)