Abstract
Given an n-element point set in the plane, in how many ways can it be peeled off until no point remains? Only one extreme point can be removed at a time. The answer obviously depends on the point set. If the points are in convex position, there are exactly n! ways, which is the maximum number of ways for n points. But what is the minimum number?
Subject
General Mathematics,Engineering (miscellaneous),Computer Science (miscellaneous)
Reference9 articles.
1. Maintenance of configurations in the plane;J. Comput. Syst. Sci.,1981
2. On the convex layers of a planar set;IEEE Trans. Inf. Theory,1985
3. Traub, J.F. (1976). Recent Results and New Directions in Algorithms and Complexity, Academic Press.
4. Shamos, M.I. (1978). Problems in Computational Geometry. [Ph.D. Thesis, Yale University].
5. Dynamic planar convex hull operations in near-logarithmic amortized time;J. ACM,2001
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Peeling Sequences;Discrete & Computational Geometry;2024-02-02