Abstract
We present an algorithm which is numerically stable and optimal in time and space complexity for constructing the convex hull for a set of points on a plane. In contrast to existing numerically stable algorithms which return only an approximate hull, our algorithm constructs a polygon that is truly convex. The algorithm is simple and easy to implement. We assume a floating point arithmetic as a computation model.
| Original language | English |
|---|---|
| Pages (from-to) | 283-292 |
| Number of pages | 10 |
| Journal | Computational Geometry: Theory and Applications |
| Volume | 4 |
| Issue number | 5 |
| DOIs | |
| State | Published - Oct 1994 |
Keywords
- Convex hull
- Numerical stability
ASJC Scopus subject areas
- Computer Science Applications
- Geometry and Topology
- Control and Optimization
- Computational Theory and Mathematics
- Computational Mathematics