20 citations · 24 across the 10 of their papers we have counts for
12 papers
Computing Planar Convex Hulls with a Promise
Sepideh Aghamolaei, Kevin Buchin, Timothy M. Chan +5
Computing the convex hull of a planar -point set is one of the most fundamental problems in computational geometry. It has an lower bound in the algebraic comp…
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 Voronoi visibility maps of 1.5D terrains with multiple viewpoints
Vahideh Keikha, Maria Saumell
Given an -vertex 1.5D terrain $\T$ and a set $\A$ of viewpoints, the Voronoi visibility map $\vorvis(\T,\A)$ is a partitioning of $\T$ into regions such that each region i…
Minimum color spanning circle of imprecise points
Ankush Acharyya, Ramesh K. Jallu, Vahideh Keikha +2
Let be a set of colored imprecise points, where each point is colored by one of colors. Each imprecise point is specified by a unit disk in which the point lies. W…
Large -gons in a 1.5D Terrain
Vahideh Keikha
Given is a 1.5D terrain , i.e., an -monotone polygonal chain in . For a given , our objective is to approximate the largest area or perim…
Clustering Geometrically-Modeled Points in the Aggregated Uncertainty Model
Vahideh Keikha, Sepideh Aghamolaei, Ali Mohades +1
The -center problem is to choose a subset of size from a set of points such that the maximum distance from each point to its nearest center is minimized. Let $Q=\{Q_1,\l…
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…
Computing The Packedness of Curves
Sepideh Aghamolaei, Vahideh Keikha, Mohammad Ghodsi +1
A polygonal curve with vertices is -packed, if the sum of the lengths of the parts of the edges of the curve that are inside any disk of radius is at most , for…
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…
Largest and Smallest Area Triangles on Imprecise Points
Vahideh Keikha, Maarten Löffler, Ali Mohades
Assume we are given a set of parallel line segments in the plane, and we wish to place a point on each line segment such that the resulting point set maximizes or minimizes the are…
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…
Maximum-Area Triangle in a Convex Polygon, Revisited
Vahideh Keikha, Maarten Löffler, Ali Mohades +2
We revisit the following problem: Given a convex polygon , find the largest-area inscribed triangle. We show by example that the linear-time algorithm presented in 1979 by Dobki…