4 papers
Computing largest minimum color-spanning intervals of imprecise points
Ankush Acharyya, Vahideh Keikha, Maria Saumell +1
We study a geometric facility location problem under imprecision. Given unit intervals in the real line, each with one of colors, the goal is to place one point in each int…
On Optimal -gons in Convex Polygons
Vahideh Keikha
Let be a set of points in . For a given positive integer , our objective is to find a set of points, such that has the s…
Convex partial transversals of planar regions
Vahideh Keikha, Mees van de Kerkhof, Marc van Kreveld +6
We consider the problem of testing, for a given set of planar regions and an integer , whether there exists a convex shape whose boundary intersects at least region…
Maximum-Area Quadrilateral in a Convex Polygon, Revisited
Vahideh Keikha, Maarten Löffler, Ali Mohades +2
In this note we show by example that the algorithm presented in 1979 by Dobkin and Snyder for finding the largest-area k-gon that is inscribed in a convex polygon fails to find the…