V
Vahideh Keikha
Researcher at Academy of Sciences of the Czech Republic
Publications - 30
Citations - 54
Vahideh Keikha is an academic researcher from Academy of Sciences of the Czech Republic. The author has contributed to research in topics: Computer science & Line segment. The author has an hindex of 3, co-authored 22 publications receiving 37 citations. Previous affiliations of Vahideh Keikha include Amirkabir University of Technology & University of Sistan and Baluchestan.
Papers
More filters
Journal ArticleDOI
Maximum-Area Triangle in a Convex Polygon, Revisited
TL;DR: It is proved by counterexample that the linear-time algorithm presented in 1979 by Dobkin and Snyder for solving the largest-area inscribed triangle fails, as well as a renewed analysis of the problem.
Journal ArticleDOI
Windowing queries using Minkowski sum and their extension to MapReduce
TL;DR: A new version of the problem of finding popular places in a set of trajectories where the center of a query is a popular place if the length of the curves inside that query is at least f is defined and used to solve the original problem as well as this new version.
Journal ArticleDOI
A fully polynomial time approximation scheme for the smallest diameter of imprecise points
TL;DR: This paper presents a fully polynomial time approximation scheme (FPTAS) for computing the minimum diameter of a set of disjoint disks that runs in O ( n 2 ϵ − 1 ) time and shows that the results can be generalized in R d when the dimension d is an arbitrary fixed constant.
Proceedings ArticleDOI
Convex partial transversals of planar regions
Vahideh Keikha,Mees van de Kerkhof,Marc van Kreveld,Irina Kostitsyna,Maarten Löffler,Frank Staals,Jérôme Urhausen,Jordi L. Vermeulen,Lionov Wiratma,Lionov Wiratma +9 more
TL;DR: It is shown that the problem of testing, for a given set of planar regions R and an integer k, whether there exists a convex shape whose boundary intersects at least k regions of R is NP-hard when the regions are intersecting axis-aligned rectangles or 3-oriented line segments.
Proceedings Article
Largest and Smallest Area Triangles on Imprecise Points
TL;DR: In this paper, the authors studied the problem of placing three points in different regions such that the resulting triangle has the largest or smallest possible area, and showed that for a given set of line segments of equal length, the largest possible area triangle can be found in O(n log n)$ time.