Output-sensitive peeling of convex and maximal layers

Information Processing Letters

Volumn 59, Issue 5, 1996, Pages 255-259

  Nielsen, Franck ^a,b  

^a INRIA   (France)

^b UNIVERSITÉ CÔTE D'AZUR   (France)

Author keywords

Computational geometry; Convex hulls

Indexed keywords

EID: 0043041153     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/0020-0190(96)00116-0     Document Type: Article

References (19)

1. RK. Agarwal and J. Matoušek, Ray shooting and parametric search, SIAM J. Comput. 22 (4) (1993) 794-806.
2. T.M.Y. Chan, Output-sensitive results on convex hulls, extreme points and related problems, in: Proc. 11th Ann. ACM Symp. on Computational Geometry (1995) 10-19.
3. B. Chazelle, On the convex layers of a planar set, IEEE Trans. Inform. Theory 31 (1985) 509-517.
4. R. Cole, M. Sharir and C.K. Yap, On k-hulls and related problems, SIAM J. Comput. 16 (1987) 61-77.
5. H. Edelsbrunner and E. Welzl, Constructing belts in two-dimensional arrangements with applications, SIAM J. Comput. 15 (1986) 271-284.
6. H. Everett, J.-M. Robert and M. van Kreveld, An optimal algorithm for the (≤ k)-levels, with applications to separation and transversal problems, in: Proc. 9th Ann. ACM Symp. on Computational Geometry (1993) 38-46.
7. G. Frederickson and S. Rodger, A new approach to the dynamic maintenance of maximal points in a plane, Discrete Comput. Geom. 5 (1990) 365-374.
8. R. Janardan, On the dynamic maintenance of maximal points in the plane, Inform. Process. Lett. 40 (1991) 59-64.
9. R.A. Jarvis, On the identification of the convex hull of a finite set of points in the plane, Inform. Process. Lett. 2 (1973) 18-21.
10. S. Kapoor, Dynamic maintenance of maximas of 2-d point sets, in: Proc. 10th Ann. ACM Symp. on Computational Geometry (1994) 140-149.
11. D.G. Kirkpatrick and J.D. Radke, A framework for computational morphology, in: G.T. Toussaint, ed., Computational Geometry (North-Holland, Amsterdam, 1985) 217-248.
12. D.G. Kirkpatrick and R. Seidel, Output-size sensitive algorithms for finding maximal vectors, in: Proc. 1st Ann. ACM Symp. on Computational Geometry (1985) 89-96.
13. D.G. Kirkpatrick and R. Seidel, The ultimate planar convex hull algorithm?, SIAM J. Comput. 15 (1986) 287-299.
14. H.T. Kung, F. Luccio and F.P. Preparata, On finding the maxima of a set of vectors, J. ACM 22 (1975) 469-476.
15. F. Nielsen and M. Yvinec, Output-sensitive convex hull algorithms of planar convex objects, Research Rept. 2575, INRIA, BP93, 06902 Sophia-Antipolis, France, 1995.
16. M.H. Overmars and J. van Leeuwen, Dynamically maintaining configurations in the plane, in: Proc. 12th Ann. ACM Symp. on Theory of Computing (1980) 135-145.
17. M.H. Overmars and J. van Leeuwen, Maintenance of configurations in the plane, J. Comput. System Sci. 23 (1981) 166-204.
18. F.P. Preparata and M.I. Shamos, Computational Geometry: An Introduction (Springer, New York, 1985).
19. F.F. Yao, On finding the maximal elements in a set of plane vectors, Rept. R-667, Dept. of Computer Science, University of Illinois, Urbana, 1974.