5 citations · 34 across the 24 of their papers we have counts for
4 papers · 1 filter
Spherical Triangle Algorithm: A Fast Oracle for Convex Hull Membership Queries
Bahman Kalantari, Yikai Zhang
The it Convex Hull Membership(CHM) problem is: Given a point and a subset of points in , is ? CHM is not only a fundamental problem in Line…
Approximating Bimatrix Nash Equilibrium Via Trilinear Minimax
Bahman Kalantari
The Bimatrix Nash Equilibrium (NE) for real matrices and , denoted as the {\it Row} and {\it Column} players, is characterized as follows: Let $Δ=S_m \times S_n…
The edge-vertex inequality in a planar graph and a bipartition for the class of all planar graphs
M. R. Emamy-K., Bahman Kalantari, Tatiana Correa
For a planar graph with a given f-vector we introduce a cubic polynomial whose coefficients depend on the f-vector. The planar graph is said to be real if…
Robust Vertex Enumeration for Convex Hulls in High Dimensions
Pranjal Awasthi, Bahman Kalantari, Yikai Zhang
Computation of the vertices of the convex hull of a set of points in is a fundamental problem in computational geometry, optimization, machine learning and…