4 citations · 5 across the 5 of their papers we have counts for
9 papers
Maximum Centre-Disjoint Mergeable Disks
Ali Gholami Rudi
Given a set of disks in the plane, the goal of the problem studied in this paper is to choose a subset of these disks such that none of its members contains the centre of any other…
Packing Rotating Segments
Ali Gholami Rudi
We show that the following variant of labeling rotating maps is NP-hard, and present a polynomial approximation scheme for solving it. The input is a set of feature points on a map…
Approximate Discontinuous Trajectory Hotspots
Ali Gholami Rudi
A hotspot is an axis-aligned square of fixed side length , the duration of the presence of an entity moving in the plane in which is maximised. An exact hotspot of a polygonal t…
Approximate Curve-Restricted Simplification of Polygonal Curves
Ali Gholami Rudi
The goal in the min-\# curve simplification problem is to reduce the number of the vertices of a polygonal curve without changing its shape significantly. We study curve-restricted…
Looking for Bird Nests: Identifying Stay Points with Bounded Gaps
Ali Gholami Rudi
A stay point of a moving entity is a region in which it spends a significant amount of time. In this paper, we identify all stay points of an entity in a certain time interval, whe…
Time-Windowed Contiguous Hotspot Queries
Ali Gholami Rudi
A hotspot of a moving entity is a region in which it spends a significant amount of time. Given the location of a moving object through a certain time interval, i.e. its trajectory…
Approximate Hotspots of Orthogonal Trajectories
Ali Gholami Rudi
In this paper we study the problem of finding hotspots, i.e. regions in which a moving entity has spent a significant amount of time, for polygonal trajectories. The fastest optima…
A Practical Algorithm for Enumerating Collinear Points
Ali Gholami Rudi, Raimi Ayinde Rufai
This paper studies the problem of enumerating all maximal collinear subsets of size at least three in a given set of points. An algorithm for this problem, besides solving dege…
An Improved Lower Bound for General Position Subset Selection
Ali Gholami Rudi
In the General Position Subset Selection (GPSS) problem, the goal is to find the largest possible subset of a set of points such that no three of its members are collinear. If $s_{…