activity
20172023
most citedA Practical Algorithm for Enumerating Collinear Points

1 citations · 1 across the 1 of their papers we have counts for

collaborators
Showing cs.CGShow all

6 papers · 1 filter

cs.CG2023

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…

cs.CG2019

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…

cs.CG2019

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…

cs.CG2018

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…

cs.CG2018

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…

cs.CG2017★ 1 cited

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…