A new algorithm for computing the convex hull of a planar point set
From MaRDI portal
Publication:926679
DOI10.1631/jzus.2007.A1210zbMath1142.65024OpenAlexW2020591635MaRDI QIDQ926679
Publication date: 20 May 2008
Published in: Journal of Zhejiang University. Science A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1631/jzus.2007.a1210
algorithmextreme pointsconvex hulltime complexitycomputational geometryordered convex hull point sequence
Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Convex sets in (2) dimensions (including convex curves) (52A10) Complexity and performance of numerical algorithms (65Y20)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Space-efficient planar convex hull algorithms
- On-line construction of the convex hull of a simple polyline
- A linear algorithm for finding the convex hull of a simple polygon
- Space-efficient algorithms for computing the convex hull of a simple polygonal line in linear time
- Convex hulls, oracles, and homology
- On finding the convex hull of a simple polygon
- The Ultimate Planar Convex Hull Algorithm?
- A Lower Bound to Finding Convex Hulls
- Computational Geometry in C
- On a Simple, Practical, Optimal, Output-Sensitive Randomized Planar Convex Hull Algorithm
- Measuring Concavity on a Rectangular Mosaic
This page was built for publication: A new algorithm for computing the convex hull of a planar point set