5 citations · 34 across the 24 of their papers we have counts for
7 papers · 1 filter
Spherical Convex Hull Membership: Complexity and Performance of Geometric and Accelerated Methods
Bahman Kalantari
We study the problem of testing membership of the origin in the convex hull of unit vectors in , seeking a convex combination of norm at most or a s…
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…
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…
A Comparison of the Triangle Algorithm and SMO for Solving the Hard Margin Problem
Mayank Gupta, Bahman Kalantari
In this article we consider the problem of testing, for two finite sets of points in the Euclidean space, if their convex hulls are disjoint and computing an optimal supporting hyp…
Randomized Triangle Algorithms for Convex Hull Membership
Bahman Kalantari
We present randomized versions of the {\it triangle algorithm} introduced in \cite{kal14}. The triangle algorithm tests membership of a distinguished point in…
Fast Approximation and Randomized Algorithms for Diameter
Sharareh Alipour, Bahman Kalantari, Hamid Homapour
We consider approximation of diameter of a set of points in dimension . Eeciolu and Kalantari \cite{kal} have shown that given any , by co…
A Characterization Theorem and An Algorithm for A Convex Hull Problem
Bahman Kalantari
Given and , testing if , the convex hull of , is a fundamental problem in computational geomet…