What type of study is this?

This is a Quantitative Study study.

October 10, 2025Open Access

Further analysis of Peeling Sequences

Key Points

The improved upper bound for peeling sequences is reduced to 9.78^n/500.
Dumitrescu and Tóth's methodology is employed for careful analysis of the problem.
Peeling sequences involve removing points from the convex hull iteratively.
Set P consists of n points in general position within the plane.

Abstract

Let P R² be a set of n points in general position. A peeling sequence of P is a list of its points, such that if we remove the points from P in that order, we always remove the next point from the convex hull of the remainder of P. Using the methodology of Dumitrescu and Tóth Dumitrescu, with more careful analysis, we improve the upper bound on the minimum number of peeling sequences for an n point set in the plane from 12. 29ⁿ100 to 9. 78ⁿ500.

Read Full Paperexternally

AI से पूछें

Bookmark

View Full Paper

Cite This Study

Dániel Gábor Simon (Sat,) studied this question.

synapsesocial.com/papers/68e865117ef2f04ca37e4e2c https://doi.org/https://doi.org/10.48550/arxiv.2510.03832

Also Consider

Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:

AI से पूछें

Bookmark

View Full Paper