2 citations · 4 across the 13 of their papers we have counts for
9 papers · 1 filter
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…
A 2-Approximation Algorithm for Data-Distributed Metric k-Center
Sepideh Aghamolaei, Mohammad Ghodsi
In a metric space, a set of point sets of roughly the same size and an integer are given as the input and the goal of data-distributed -center is to find a subset of s…
A Massively Parallel Dynamic Programming for Approximate Rectangle Escape Problem
Sepideh Aghamolaei, Mohammad Ghodsi
Sublinear time complexity is required by the massively parallel computation (MPC) model. Breaking dynamic programs into a set of sparse dynamic programs that can be divided, solved…
An Efficient Construction of Yao-Graph in Data-Distributed Settings
Sepideh Aghamolaei, Mohammad Ghodsi
A sparse graph that preserves an approximation of the shortest paths between all pairs of points in a plane is called a geometric spanner. Using range trees of sublinear size, we d…
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…
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…
Catching a Polygonal Fish with a Minimum Net
Sepideh Aghamolaei
Given a polygon in the plane that can be translated, rotated and enlarged arbitrarily inside a unit square, the goal is to find a set of lines such that at least one of them al…
Point-Location in The Arrangement of Curves
Sepideh Aghamolaei, Mohammad Ghodsi
An arrangement of curves in the plane is given. The query is a point and the goal is to find the face of the arrangement that contains . A data-structure for point-locat…
Approximating The p-Mean Curve of Large Data-Sets
Sepideh Aghamolaei, Mohammad Ghodsi
A set of piecewise linear functions, called polylines, each with at most vertices can be simplified into a polyline with vertices, such that the Fréche…