Showing cs.CGShow all
2 papers · 1 filter
cs.CG2022
Maximum Weight Convex Polytope
Mohammad Ali Abam, Ali Mohammad Lavasani, Denis Pankratov
We study the maximum weight convex polytope problem, in which the goal is to find a convex polytope maximizing the total weight of enclosed points. Prior to this work, the only kno…
cs.CG2021
Advice Complexity of Online Non-Crossing Matching
Ali Mohammad Lavasani, Denis Pankratov
We study online matching in the Euclidean -dimesional plane with non-crossing constraint. The offline version was introduced by Atallah in 1985 and the online version was introd…