Optimal computation of finitely oriented convex hulls
- 1 February 1987
- journal article
- Published by Elsevier in Information and Computation
- Vol. 72 (2) , 150-166
- https://doi.org/10.1016/0890-5401(87)90045-9
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- On some union and intersection problems for polygons with fixed orientationsComputing, 1986
- Dynamic C-oriented polygonal intersection searchingInformation and Control, 1984
- On the definition and computation of rectilinear convex hullsInformation Sciences, 1984
- A new linear convex hull algorithm for simple polygons (Corresp.)IEEE Transactions on Information Theory, 1984
- Finding the convex hull of a simple polygonJournal of Algorithms, 1983
- On the X-Y convex hull of a set of X-Y polygonsBIT Numerical Mathematics, 1983
- On finding the convex hull of a simple polygonInternational Journal of Parallel Programming, 1983
- Stabbing c-oriented polygonsInformation Processing Letters, 1983
- A linear algorithm for finding the convex hull of a simple polygonInformation Processing Letters, 1979
- On the identification of the convex hull of a finite set of points in the planeInformation Processing Letters, 1973