2D中Pareto peeling的Hamilton-Jacobi scaling limits
Hamilton-Jacobi scaling limits of Pareto peeling in 2D
AI总结:
本文研究二维随机点集的Pareto peeling算法,证明其scaling limit由一阶Hamilton-Jacobi方程描述,并给出非强制非凸的极限Hamiltonian显式公式,区别于收敛于曲率流的凸剥离。
摘要:
Pareto hull peeling是一种离散算法,推广了凸包剥离,用于对欧几里得空间中的点进行排序。我们证明了二维中随机点集的Pareto peeling具有由一阶Hamilton-Jacobi方程描述的scaling limit,并给出了极限Hamiltonian的显式公式,该公式既非强制也非凸。这与收敛于曲率流的凸剥离形成对比。证明涉及与Calder (2016)类似的直接几何操作。
英文摘要:
Pareto hull peeling is a discrete algorithm, generalizing convex hull peeling, for sorting points in Euclidean space. We prove that Pareto peeling of a random point set in two dimensions has a scaling limit described by a first-order Hamilton-Jacobi equation and give an explicit formula for the limiting Hamiltonian, which is both non-coercive and non-convex. This contrasts with convex peeling, which converges to curvature flow. The proof involves direct geometric manipulations in the same spirit as Calder (2016).
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。